A PSO Solution for Pursuit-evasion Problem of Randomly Mobile Agents

作     者：FAN Jiancong~1,RUAN Jiuhong~2,LIANG Yongquan~1,TANG Leiyu~(1,3) 1.College of Information Science and Engineering,Shandong University of Science and Technology,Qingdao 266510,China 2.Scientific Research Department,Shandong Jiaotong University,Jinan 250023,China 3.College of Science,Shandong University of Science and Technology,Qingdao 266510,China 

会议名称：《2009中国控制与决策会议》

会议日期：2009年

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 081104[工学-模式识别与智能系统] 08[工学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Nature Science Foundation of Shandong province under Grant G2007Y07 Spring bud planning of Shandong University of Science and Technology under Grant 

关 键 词：particle swarm optimization mobile Agent pursuit-evasion problem 

摘      要：正Pursuit-evasion problem is a process that one or several agents pursuit one or several other *** persuading agents and evading agents are regarded as mobile intelligent *** intelligent agents are considered as perspicacious particles to solve the pursuit-evasion *** moving trajectory of evading particles is partitioned into local moving *** particle swarm optimization（PSO） algorithm the pursuit particles solve these local *** function value that most close to evading particles is the local best *** global best value can be obtained when evading particle is *** show that pursuit-evasion solving based on PSO has better time performance,and with capture action areas increasing the capture time increases linearly.