Please use this identifier to cite or link to this item:
https://hdl.handle.net/1889/3825
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Consolini, Luca | - |
dc.contributor.author | Laurini, Mattia | - |
dc.date.accessioned | 2019-04-17T10:38:11Z | - |
dc.date.available | 2019-04-17T10:38:11Z | - |
dc.date.issued | 2019-03 | - |
dc.identifier.uri | http://hdl.handle.net/1889/3825 | - |
dc.description.abstract | In 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.iso | Inglese | it |
dc.publisher | Università degli studi di Parma. Dipartimento di Ingegneria e architettura | it |
dc.relation.ispartofseries | Dottorato di ricerca in Tecnologie dell'informazione | it |
dc.rights | © Mattia Laurini, 2019 | it |
dc.subject | Computational methods | it |
dc.subject | Linear programming | it |
dc.subject | Acceleration of convergence | it |
dc.subject | Optimal control | it |
dc.subject | Speed planning | it |
dc.subject | Path planning | it |
dc.subject | Graphs | it |
dc.title | Graph-based optimization algorithms with applications to trajectory planning | it |
dc.title.alternative | Algoritmi di ottimizzazione basati su grafi con applicazioni alla pianificazione di traiettoria | it |
dc.type | Doctoral thesis | it |
dc.subject.miur | ING-INF/04 | it |
dc.subject.miur | MAT/09 | it |
Appears in Collections: | Tecnologie dell'informazione. Tesi di dottorato |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
relazione-finale-schema.pdf Until 2100-01-01 | Relazione | 77.55 kB | Adobe PDF | View/Open Request a copy |
Tesi.pdf | Tesi | 1.27 MB | Adobe PDF | View/Open |
This item is licensed under a Creative Commons License