Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments
AbstractThis paper presents an algorithm for finding a solution to the problem of planning a feasible path for a slender autonomous mobile robot in a large and cluttered environment. The presented approach is based on performing a graph search on a kinodynamic-feasible lattice state space of high resolution; however, the technique is applicable to many search algorithms. With the purpose of allowing the algorithm to consider paths that take the robot through narrow passes and close to obstacles, high resolutions are used for the lattice space and the control set. This introduces new challenges because one of the most computationally expensive parts of path search based planning algorithms is calculating the cost of each one of the actions or steps that could potentially be part of the trajectory. The reason for this is that the evaluation of each one of these actions involves convolving the robot’s footprint with a portion of a local map to evaluate the possibility of a collision, an operation that grows exponentially as the resolution is increased. The novel approach presented here reduces the need for these convolutions by using a set of offline precomputed maps that are updated, by means of a partial convolution, as new information arrives from sensors or other sources. Not only does this improve run-time performance, but it also provides support for dynamic search in changing environments. A set of alternative fast convolution methods are also proposed, depending on whether the environment is cluttered with obstacles or not. Finally, we provide both theoretical and experimental results from different experiments and applications. View Full-Text
Scifeed alert for new publicationsNever miss any articles matching your research from any publisher
- Get alerts for new papers matching your research
- Find out the new papers from selected authors
- Updated daily for 49'000+ journals and 6000+ publishers
- Define your Scifeed now
Samaniego, R.; Lopez, J.; Vazquez, F. Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments. Sensors 2017, 17, 1876.
Samaniego R, Lopez J, Vazquez F. Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments. Sensors. 2017; 17(8):1876.Chicago/Turabian Style
Samaniego, Ricardo; Lopez, Joaquin; Vazquez, Fernando. 2017. "Path Planning for Non-Circular, Non-Holonomic Robots in Highly Cluttered Environments." Sensors 17, no. 8: 1876.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.