Optimal Path Planner for Indoor Mobile Robot Environment

Abstract

The research paper elaborate the development of novel path finding algorithm which overcomes the traditional path finding algorithm discrepancies and making more realistic end solution for variety of robotic and game development application. The major shortcomings in traditional algorithms is edge or vertex constrained which failed to finds optimal path ensuring future non-collision of moving agent with other static and dynamic in-path obstacles or hurdles. This research work introduces analytic bounds to compare the path length of true shortest with the path cost found from the traditional path finding algorithm over the two dimensional uniform square grid maps.