Enhanced A* Algorithm for Mobile Robot Path Planning with Non-Holonomic Constraints
Abstract
In this paper, a novel method for path planning of mobile robots is proposed, taking into account the non-holonomic turn radius constraints and finite dimensions of the robot. The approach involves rasterizing the environment to generate a 2D map and utilizes an enhanced version of the A* algorithm that incorporates non-holonomic constraints while ensuring collision avoidance. Two new instantiations of the A* algorithm are introduced and tested across various scenarios and environments, with results demonstrating the effectiveness of the proposed method.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.