Robotic Indoor Mobility Using Sensored Path
Abstract
one of the important research topics today is robotic indoor mobility and how to enhance the movement from point to point. Our proposed algorithm uses sensored path that helps the robot to navigate from source to destination across multi sensored points. We use Dijkstra’s algorithm as a simple algorithm for finding the shortest path for all possible (source, destination) pairs then depending on its result we calculate the minimum number of sensored turns that can lead the robot to reach its target.