Combining Global and Local Planning with Guarantees on Completeness
Conference Paper, Proceedings of (ICRA) International Conference on Robotics and Automation, pp. 4500 - 4506, May, 2012
Abstract
Planning with kinodynamic constraints is often required for mobile robots operating in cluttered, complex environments. A common approach is to use a two-dimensional (2-D) global planner for long range planning, and a short range higher dimensional planner or controller capable of satisfying all of the constraints on motion. However, this approach is incomplete and can result in oscillations and the inability to find a path to the goal. In this paper we present an approach to solving this problem by combining the global and local path planning problem into a single search using a combined 2-D and higher dimensional state-space.
BibTeX
@conference{Zhang-2012-109557,author = {Haojie Zhang and Jon Butzke and Maxim Likhachev},
title = {Combining Global and Local Planning with Guarantees on Completeness},
booktitle = {Proceedings of (ICRA) International Conference on Robotics and Automation},
year = {2012},
month = {May},
pages = {4500 - 4506},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.