Target search for multiple mobile robots based on A* path planning algorithm

In this paper, we show that multiple mobile robots are necessary to search for targets in clutter environments. In order to avoid the obstacles and to find the shortest route of the hunting goal, an algorithm for route planning for mobile robots is used. The algorithm uses an evaluation function (including cost functions and heuristic functions) to determine the path. Finally, the simulation result by MATLAB showed good performance of the algorithm.