A PSO Solution for Pursuit-evasion Problem of Randomly Mobile Agents
Pursuit-evasion problem is a process that one or several agents pursuit one or several other agents. The persuading agents and evading agents are regarded as mobile intelligent agents. These intelligent agents are considered as perspicacious particles to solve the pursuit-evasion problem. The moving trajectory of evading particles is partitioned into local moving functions. By particle swarm optimization(PSO) algorithm the pursuit particles solve these local functions. The function value that most close to evading particles is the local best value. The global best value can be obtained when evading particle is captured. Experiments show that pursuit-evasion solving based on PSO has better time performance, and with capture action areas increasing the capture time increases linearly.
particle swarm optimization mobile Agent pursuit-evasion problem
FAN Jiancong RUAN Jiuhong LIANG Yongquan TANG Leiyu
College of Information Science and Engineering, Shandong University of Science and Technology, Qingd Scientific Research Department, Shandong Jiaotong University, Jinan 250023, China College of Information Science and Engineering, Shandong University of Science and Technology, Qingd
国际会议
2009年中国控制与决策会议(2009 Chinese Control and Decision Conference)
广西桂林
英文
4032-4035
2009-06-17（万方平台首次上网日期，不代表论文的发表时间）