This paper describes a trajectory planning algorithm for mobile robot navigation in crowded environments; the aim is to solve the problem of planning a valid path through moving people. The proposed solution relies on an algorithm based on the Informed-RRT*, where the planner computes continuously a valid path to navigate in crowded environments. Our re-planning method allows to always obtain a feasible and optimal solution, while the robot executes the trajectory of the current path. Compared to other state of the art algorithms, our solution does not compute the entire path each time an obstacle is detected, but it evaluates the current solution validity, i.e., the presence of moving obstacles on the current path; in this case the algorithm tries to repair the current solution. Only if the current path is completely unacceptable, a new path is computed from scratch. Thanks to its reactivity, our solution always guarantees a valid path, that brings the robot to the desired goal position. We validated the proposed approach in a real case scenario where a mobile robot moves through human crowd in a safe and reliable way.

Dynamic trajectory planning for mobile robot navigation in crowded environments / Primatesta, Stefano; Russo, LUDOVICO ORLANDO; Bona, Basilio. - ELETTRONICO. - (2016). ((Intervento presentato al convegno 21st IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2016) tenutosi a Berlin (DE) nel September 6-9, 2016 [10.1109/ETFA.2016.7733510].

Dynamic trajectory planning for mobile robot navigation in crowded environments

PRIMATESTA, STEFANO;RUSSO, LUDOVICO ORLANDO;BONA, Basilio
2016

Abstract

This paper describes a trajectory planning algorithm for mobile robot navigation in crowded environments; the aim is to solve the problem of planning a valid path through moving people. The proposed solution relies on an algorithm based on the Informed-RRT*, where the planner computes continuously a valid path to navigate in crowded environments. Our re-planning method allows to always obtain a feasible and optimal solution, while the robot executes the trajectory of the current path. Compared to other state of the art algorithms, our solution does not compute the entire path each time an obstacle is detected, but it evaluates the current solution validity, i.e., the presence of moving obstacles on the current path; in this case the algorithm tries to repair the current solution. Only if the current path is completely unacceptable, a new path is computed from scratch. Thanks to its reactivity, our solution always guarantees a valid path, that brings the robot to the desired goal position. We validated the proposed approach in a real case scenario where a mobile robot moves through human crowd in a safe and reliable way.
978-1-5090-1314-2
File in questo prodotto:
File Dimensione Formato  
ETFA2016_paper_136.pdf

non disponibili

Descrizione: Articolo in atti di convegno
Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: Non Pubblico - Accesso privato/ristretto
Dimensione 1.65 MB
Formato Adobe PDF
1.65 MB Adobe PDF   Visualizza/Apri   Richiedi una copia
paperETFA2016_Primatesta.pdf

accesso aperto

Tipologia: 2. Post-print / Author's Accepted Manuscript
Licenza: PUBBLICO - Tutti i diritti riservati
Dimensione 1.64 MB
Formato Adobe PDF
1.64 MB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS 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/11583/2650938
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo