Abstract
This chapter defines path planning, lists possible fields of use, and states some additional terms that need to be met in the process of planning. Several possible ways to describe a planning problem and environment for the later path planning are given, such as graph representations, decomposition to cells, roadmaps, potential fields, and sampling-based path planning. Most commonly used search algorithms in path planning are described, starting with simple bug algorithms and continue with more advanced algorithms that can guarantee the optimal path and can include heuristics to narrow the search area or guarantee completeness. Also, some algorithms that do not require a fully known environment are introduced. For better understanding several illustrating examples and some implementations in Matlab scripts are given.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.