Please use this identifier to cite or link to this item: https://hdl.handle.net/1889/3825
Full metadata record
DC FieldValueLanguage
dc.contributor.advisorConsolini, Luca-
dc.contributor.authorLaurini, Mattia-
dc.date.accessioned2019-04-17T10:38:11Z-
dc.date.available2019-04-17T10:38:11Z-
dc.date.issued2019-03-
dc.identifier.urihttp://hdl.handle.net/1889/3825-
dc.description.abstractIn this work, we address a class of specially structured optimization problems. We introduce relevant applications in control engineering and telecommunication which fall in this class. We develop new graph-based procedures for efficiently solving problems belonging to this class, provide correctness and speed of convergence proofs and present some numerical experiments. We also address one of these problems in the continuous time domain.it
dc.language.isoIngleseit
dc.publisherUniversità degli studi di Parma. Dipartimento di Ingegneria e architetturait
dc.relation.ispartofseriesDottorato di ricerca in Tecnologie dell'informazioneit
dc.rights© Mattia Laurini, 2019it
dc.subjectComputational methodsit
dc.subjectLinear programmingit
dc.subjectAcceleration of convergenceit
dc.subjectOptimal controlit
dc.subjectSpeed planningit
dc.subjectPath planningit
dc.subjectGraphsit
dc.titleGraph-based optimization algorithms with applications to trajectory planningit
dc.title.alternativeAlgoritmi di ottimizzazione basati su grafi con applicazioni alla pianificazione di traiettoriait
dc.typeDoctoral thesisit
dc.subject.miurING-INF/04it
dc.subject.miurMAT/09it
Appears in Collections:Tecnologie dell'informazione. Tesi di dottorato

Files in This Item:
File Description SizeFormat 
relazione-finale-schema.pdf
  Until 2100-01-01
Relazione77.55 kBAdobe PDFView/Open Request a copy
Tesi.pdfTesi1.27 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons