A multi-robot hunting algorithm based on dynamic prediction for trajectory of the moving target and hunting points

被引:0
作者
Hu, Jun [1 ,3 ]
Zhu, Qing-Bao [2 ,3 ]
机构
[1] School of Mathematic Science, Nanjing Normal University, Nanjing, Jiangsu 210000, China
[2] School of Computer Science, Nanjing Normal University, Nanjing, Jiangsu 210000, China
[3] Jiangsu Research Center of Information Security and Confidential Engineering, Nanjing, Jiangsu 210000, China
来源
Tien Tzu Hsueh Pao/Acta Electronica Sinica | 2011年 / 39卷 / 11期
关键词
Forecasting - Multipurpose robots - Industrial robots;
D O I
暂无
中图分类号
学科分类号
摘要
In order to fast surround the moving target by hunting robots, a multi-robot hunting algorithm based on dynamic prediction for the trajectory of the moving target and hunting points is proposed. With moving of the target, sample points are updated dynamically to predict possible position of the target in a short period of time by using the fitting of a polynomial, and the safe domain of the moving target, which is a denied area for the hunting robots, is built to avoid the target's escape when it detects robots. The method of negotiation is adopted to allocate appropriate desired hunting point for each robot. Then robots approach desired hunting points rapidly by means of multi-scout ant cooperation algorithm so as to achieve the hunting of the moving target. The simulations show that hunting robots can surround the moving target of which the trajectory is unknown rapidly and accurately by the algorithm in the environment with complex obstacles and the results obtained is satisfactory.
引用
收藏
页码:2480 / 2485
相关论文
empty
未找到相关数据