Greedy Algorithm Based Multiple Target Searching for Mobile Robots

Abstract:

Article Preview

The article mainly researches path planning and task allocation problems of multiple mobile robots using A* searching algorithm and greedy algorithm, and solve the shortest path problems such that the robots can move from the start point to reach the multiple target points in a collision-free space, and uses 2-opt exchange heuristic algorithm to improve the shortest path. In this manner, the mobile moves to the final target point through the other points, and construct the motion path using A* searching algorithm and greedy algorithm. The supervised computer control the mobile robot feedback to the start point from the final target point through the other points, and programs a shortest path using 2-opt exchange heuristic algorithm. We develop the user interface to program the motion path of mobile robots via wireless RF interface. It can displays the motion path of the mobile robot on real-time. The simulated results presents that the proposed method can finds the shortest motion path for mobile robots moving to multiple target points from the start point in a collision-free space. Finally, we implement the experiment scenario on the grid platform using the module-based mobile robot.

Info:

Periodical:

Edited by:

Ran Chen

Pages:

1335-1339

DOI:

10.4028/www.scientific.net/AMM.44-47.1335

Citation:

J. H. Guo and K. L. Su, "Greedy Algorithm Based Multiple Target Searching for Mobile Robots", Applied Mechanics and Materials, Vols. 44-47, pp. 1335-1339, 2011

Online since:

December 2010

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.