Abstract

This paper presents modified A* and Lifelong Planning A* algorithms to facilitate more accurate path finding than existing methods, including the Minkowski sum for differential wheeled vehicles with shape constraints. We use a graphical method to check for obstructions without adding the outline of vehicles to obstacles. The method applies a procedure that enables vehicles to have forward movement with the smallest rotation possible, including their turning directions. Furthermore, we show that vehicles can pass through narrow passages because we accurately check for interference against obstacles using the graphical method. Consequently, we demonstrate via a series of simulations that our method can quickly replan a collision-free path while accurately taking into account the shape of vehicles.

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 call

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.