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.

Graph-based optimization algorithms with applications to trajectory planning

2019

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.
Algoritmi di ottimizzazione basati su grafi con applicazioni alla pianificazione di traiettoria
mar-2019
Inglese
Computational methods
Linear programming
Acceleration of convergence
Optimal control
Speed planning
Path planning
Graphs
ING-INF/04
MAT/09
Università degli Studi di Parma
File in questo prodotto:
File Dimensione Formato  
relazione-finale-schema.pdf

accesso solo da BNCF e BNCR

Tipologia: Altro materiale allegato
Dimensione 77.55 kB
Formato Adobe PDF
77.55 kB Adobe PDF
Tesi.pdf

accesso solo da BNCF e BNCR

Tipologia: Altro materiale allegato
Dimensione 1.27 MB
Formato Adobe PDF
1.27 MB Adobe PDF

I documenti in UNITESI sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14242/133619
Il codice NBN di questa tesi è URN:NBN:IT:UNIPR-133619