English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/133133
Share/Impact:
Statistics
logo share SHARE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:
Title

Multi-objective cost-to-go functions on robot navigation in dynamic environments

AuthorsFerrer, Gonzalo ; Sanfeliu, Alberto
Issue Date2015
PublisherInstitute of Electrical and Electronics Engineers
CitationIROS 2015
AbstractIn our previous work we introduced the Anticipative Kinodynamic Planning (AKP): a robot navigation algorithm in dynamic urban environments that seeks to minimize its disruption to nearby pedestrians. In the present paper, we maintain all the advantages of the AKP, and we overcome the previous limitations by presenting novel contributions to our approach. Firstly, we present a multi-objective cost function to consider different and independent criteria and a well-posed procedure to build a joint cost function in order to select the best path. Then, we improve the construction of the planner tree by introducing a cost-to-go function that will be shown to outperform a classical Euclidean distance approach. In order to achieve real time calculations, we have used a steering heuristic that dramatically speeds up the process. Plenty of simulations and real experiments have been carried out to demonstrate the success of the AKP.
DescriptionTrabajo presentado a la International Conference on Intelligent Robots and Systems, celebrada en Hamburgo (Alemania) del 28 de septiembre al 2 de octubre de 2015.
Publisher version (URL)http://dx.doi.org/10.1109/IROS.2015.7353914
URIhttp://hdl.handle.net/10261/133133
DOI10.1109/IROS.2015.7353914
Identifiersdoi: 10.1109/IROS.2015.7353914
Appears in Collections:(IRII) Comunicaciones congresos
Files in This Item:
File Description SizeFormat 
cost-to-go.pdf2,57 MBUnknownView/Open
Show full item record
Review this work
 


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.