Development of the Searching Algorithm with Complexity Environment for Mobile Robots
The article programs the shortest path searching problems of the mobile robot in the complexity unknown environment, and uses the mobile robot to present the movement scenario from the start point to the target point in a collision-free space. The complexity environment contains variety obstacles, such as road, tree, river, gravel, grass, highway and unknown obstacle. We set the relative dangerous grade for variety obstacles. The mobile robot searches the target point to locate the positions of unknown obstacles, and avoids these obstacles moving in the motion platform. We develop the user interface to help users filling out the positions of the mobile robot and the obstacles on the supervised computer, such the initial point of the mobile robot, the start point and the target point. The supervised computer programs the motion paths of the mobile robot according to A* searching algorithm, flood-fill algorithm and 2-op exchange algorithm The simulation results present the proposed algorithms that program the shortest motion paths from the initial point approach to the target point for the mobile robot. The supervised computer controls the mobile robot that follows the programmed motion path moving to the target point in the complexity environment via wireless radio frequency (RF) interface.