Multiple Static Target Hunting Based on the RRT and OSPA Distance

This paper considers multiple static target hunting control and path planning using multi-agents. The whole hunting process can be classified into two stages. The first is cruising stage, where the agents move in a certain formation to approach the multiple static targets. Once the agents enter into certain ranges around the targets, the agents will switch into the second stage of hunting. In these two stages, it is required to consider several issues: the agent controlling, path planning, and task allocation. Specifically, the traditional multi-agent controlling algorithm, rapidly-exploring random tree (RRT), and optimal sub-pattern assignment (OSPA) are respectively used in the process. Simulation experiment shows that the path planning and hunting algorithm can efficiently realize the formation movement and multiple static targets hunting.