Abstract
The path planning is one of the most important areas in robotics. Particularly in static environments, there are different algorithms that provide important solutions to this problem. Most of these algorithms are based on traditional geometric techniques such as: modeling of the free space, Voronoi diagrams and potential fields. This paper proposes an alternative to the strategy of decomposition in cells. The main objective of the algorithm is to identify and evaluate the free cells of the environment, and from them generate a possible path. The performance of the strategy was evaluated using a simulation on different observable static environments.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
