ICRA 2011 Paper Abstract

Close

Paper WeP209.4

Macharet, Douglas Guimarães (Universidade Federal de Minas Gerais), Alves Neto, Armando (Universidade Federal de Minas Gerais), da Camara Neto, Vilar Fiuza (Fundação Centro de Análise, Pesquisa e Inovação Tecnológica (FUC), Campos, Mario F. Montenegro (Federal University of Minas Gerais)

Nonholonomic Path Planning Optimization for Dubins' Vehicles

Scheduled for presentation during the Regular Sessions "Motion and Path Planning IV" (WeP209), Wednesday, May 11, 2011, 16:10−16:25, Room 5D

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on December 10, 2019

Keywords Nonholonomic Motion Planning

Abstract

In this paper we deal with the problem of path length optimization for nonholonomic robots modeled as Dubins' vehicles. We present an improved solution that computes paths through two-dimensional waypoints, that are shorter than those produced by one of the most used techniques in the literature. We initially present an optimization cost function that proves to be better suited for the nonholonomic constraints of the vehicles that are the focus of this work. We also propose an improvement for the Alternating Algorithm, used to determinate the orientation angles on the calculation of the Dubins' Path through the waypoints. Finally, we use a recently developed optimization meta-heuristic, called C-GRASP, to generate a path that is shorter than paths obtained with classical techniques. Our results show significant improvements on the search for optimal paths for the case of nonholonomic vehicles. Our methodology was thoroughly evaluated and validated in simulation, and the results have shown a decrease on path's length of 28% on average, compared with the classic technique found in literature. In some cases a reduction of approximately 50% was obtained.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2019 PaperCept, Inc.
Page generated 2019-12-10  05:20:40 PST  Terms of use