Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorPiazzi, Aurelio-
dc.contributor.authorMinari, Andrea-
dc.description.abstractThis thesis deals with the generation of the reference speed profile to be followed by a mobile robot or an industrial manipulator in order to complete an assigned task in minimum-time. The speed planning is a non trivial problem. Indeed, depending on the kind of robot considered and the purpose of the application, the sought speed profile has to take into account a series of limitations and constraints. The efficiency of the speed planning algorithms is a mandatory feature when the robot has to operate in dynamic environments in which the motion replanning can be frequently requested. This thesis proposes algorithms which exploit the structure of the finite dimensional formulations of the speed planning problem in order to get the optimal solution with the best possible time complexity and trying as much as possible to avoid using external solvers. Numerical tests show that the proposed algorithms, which in some cases have the best possible computational complexity, are significantly faster than algorithms already existing in
dc.publisherUniversità degli Studi di Parma. Dipartimento di Ingegneria e architetturait
dc.relation.ispartofseriesDottorato di ricerca in Tecnologie dell'informazioneit
dc.rights© Andrea Minari, 2020it
dc.subjectMinimum-time problemsit
dc.subjectMotion planningit
dc.subjectSpeed planningit
dc.titleOptimization-based speed planning for mobile robots and industrial manipulatorsit
dc.title.alternativePianificazione di velocità basata su ottimizzazione per robot mobili e manipolatori industrialiit
dc.typeDoctoral thesisit
Appears in Collections:Tecnologie dell'informazione, tesi di dottorato

Files in This Item:
File Description SizeFormat 
  Until 2100-01-01
Relazione Finale108.44 kBAdobe PDFView/Open Request a copy
PhDThesis.pdfPhd Thesis3.46 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.