Reduced Area Search (RAS): An Algorithm to optimize path planning of Mobile Robots

We present Reduced Area Search, an algorithm to optimize motion path planning. In the past few decades, optimal path planning has become prior for Autonomous Mobile Robots (AMR). Search-based algorithms like A* and Dijkstra are used for path planning on basis of search, similarly, sample-based algorithms like Rapidly-Exploring Random Tree (RRT), and Rapidly-Exploring Random Tree Star (RRT*) works based on sampling. The RAS algorithm reduces the area for search and sampling, reducing the exploration point, thereby minimizing time complexity.