A Comparison of A* and RRT* Algorithms with Dynamic and Real Time Constraint Scenarios for Mobile Robots

摘要

There is an increasing number of mobile robot applications. The demanding of the Industry 4.0 pushes the robotic areas in the direction of the decision. The autonomous robots should actually decide the path according to the dynamic environment. In some cases, time requirements must also be attended and require fast path planning methods. This paper addresses a comparison between well-known path planning methods using a realistic simulator that handles the dynamic properties of robot models including sensors. The methodology is implemented in SimTwo that allows to compare the A* and RRT* algorithms in different scenarios with dynamic and real time constraint scenarios.