Abstract
Obstacle danger level is taken into consideration in path planning using fractional potential maps. This paper describes the two optimisation methods tested: the A* algorithm and the Fast-Marching technique. The efficiency of the two approaches is illustrated and compared through a vehicle path planning application in a fixed obstacle environment. A ∗ is a heuristically ordered research algorithm and is complete and admissible. Fast-Marching provides a convex map without local minima and permits real-time evaluation of optimal trajectories. A vehicle path planning application is considered in a fixed obstacle environment. A specific danger level is given to each obstacle. The obtained continuous curve trajectories are compared.
Sign-in/Register to access full text options 
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.
