Mobile robot path planning
4.0
In this present work, we present an algorithm for path planning to a
target for mobile robot in unknown environment. The proposed algorithm
allows a mobile robot to navigate through static obstacles, and finding
the path in order to reach the target without collision. This algorithm
provides the robot the possibility to move from the initial position to
the final position (target). The proposed path finding strategy is
designed in a grid-map form of an unknown environment with static
unknown obstacles. The robot moves within the unknown environment by
sensing and avoiding the obstacles coming across its way towards the
target. When the mission is executed, it is necessary to plan an optimal
or feasible path for itself avoiding obstructions in its way and
minimizing a cost such as time, energy, and distance. The proposed path
planning must make the robot able to achieve these tasks: to avoid
obstacles, and to make ones way toward i