Mobile Robot Navigation on Partially Known Maps using a Fast A Star Algorithm Version
Paul Muntean

TL;DR
This paper evaluates a fast version of the A* algorithm for indoor mobile robot navigation in partially known environments, demonstrating its efficiency and potential for real-time path planning.
Contribution
It introduces and tests a modified, faster A* algorithm for mobile robot navigation, showing promising results in indoor environments.
Findings
Fast A* algorithm improves path planning efficiency
Algorithm performs well in simulation and real robot tests
Potential for further enhancement with sensor fusion
Abstract
Mobile robot navigation in total or partially unknown environments is still an open problem. The path planning algorithms lack completeness and/or performance. Thus, there is the need for complete (i.e., the algorithm determines in finite time either a solution or correctly reports that there is none) and performance (i.e., with low computational complexity) oriented algorithms which need to perform efficiently in real scenarios. In this paper we evaluate the efficiency of two versions of the A star algorithm for mobile robot navigation inside indoor environments with the help of two software applications and the Pioneer 2DX robot. We demonstrate that an improved version of the A star algorithm (we call this the fast A star algorithm) which (a different version of this algorithm is widely used in video games) can be successfully used for indoor mobile robot navigation. We evaluated the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Robotics and Sensor-Based Localization · AI-based Problem Solving and Planning
