The availability of an ecient and reliable path planning strategy is a great benet to mobile robots. Being able to intelligently connect a series of waypoints is a crucial requirement for the execution of autonomous navigation tasks. Several performance indices can be used to evaluate the goodness of a path, including its length and smoothness. In this paper, the authors focus on planar path planning for mobile robots; Bezier curves are employed, optimizing the computed path with respect to length and curvature, the latter used as a measure of smoothness. Due to the complexity of the objective function, optimization is performed by means of a direct search method. The proposed approach aims at generating paths oering advantages to mobile robots navigation in terms of controllability and reducing the related power consumption. The performed tests show that the presented method allows to achieve interesting results, suggesting its viability as a suitable path planning strategy for dierent kinds of mobile robots.

Generic Path Planning Algorithm for Mobile Robots Based on Bézier Curves / Costanzi, Riccardo; Fanelli, Francesco; Meli, Enrico; Ridolfi, Alessandro; Allotta, Benedetto. - ELETTRONICO. - 49:(2016), pp. 145-150. (Intervento presentato al convegno 9th IFAC Symposium on Intelligent Autonomous Vehicles tenutosi a Messe Leipzig, Germany nel June 29 - July 1, 2016) [10.1016/j.ifacol.2016.07.723].

Generic Path Planning Algorithm for Mobile Robots Based on Bézier Curves

FANELLI, FRANCESCO;MELI, ENRICO;RIDOLFI, ALESSANDRO;ALLOTTA, BENEDETTO
2016

Abstract

The availability of an ecient and reliable path planning strategy is a great benet to mobile robots. Being able to intelligently connect a series of waypoints is a crucial requirement for the execution of autonomous navigation tasks. Several performance indices can be used to evaluate the goodness of a path, including its length and smoothness. In this paper, the authors focus on planar path planning for mobile robots; Bezier curves are employed, optimizing the computed path with respect to length and curvature, the latter used as a measure of smoothness. Due to the complexity of the objective function, optimization is performed by means of a direct search method. The proposed approach aims at generating paths oering advantages to mobile robots navigation in terms of controllability and reducing the related power consumption. The performed tests show that the presented method allows to achieve interesting results, suggesting its viability as a suitable path planning strategy for dierent kinds of mobile robots.
2016
IFAC-PapersOnLine
9th IFAC Symposium on Intelligent Autonomous Vehicles
Messe Leipzig, Germany
June 29 - July 1, 2016
Costanzi, Riccardo; Fanelli, Francesco; Meli, Enrico; Ridolfi, Alessandro; Allotta, Benedetto
File in questo prodotto:
File Dimensione Formato  
preprint_version_pianificazione_DEF.pdf

Accesso chiuso

Descrizione: Articolo principale
Tipologia: Versione finale referata (Postprint, Accepted manuscript)
Licenza: Tutti i diritti riservati
Dimensione 464.97 kB
Formato Adobe PDF
464.97 kB Adobe PDF   Richiedi una copia

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

Utilizza questo identificatore per citare o creare un link a questa risorsa: https://hdl.handle.net/2158/1052905
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 14
  • ???jsp.display-item.citation.isi??? 12
social impact