Title :
A PSO solution for pursuit-evasion problem of randomly mobile agents
Author :
Fan Jiancong ; Ruan Jiuhong ; Liang Yongquan ; Tang Leiyu
Author_Institution :
Coll. of Inf. Sci. & Eng., Shandong Univ. of Sci. & Technol., Qingdao, China
Abstract :
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.
Keywords :
mobile agents; particle swarm optimisation; evading particle moving trajectory; particle swarm optimization algorithm; pursuit-evasion problem; random mobile intelligent agent; Algorithm design and analysis; Educational institutions; Information science; Intelligent agent; Mobile agents; Particle swarm optimization; Probability; Protocols; Pursuit algorithms; Tree data structures; mobile Agent; particle swarm optimization; pursuit-evasion problem;
Conference_Titel :
Control and Decision Conference, 2009. CCDC '09. Chinese
Conference_Location :
Guilin
Print_ISBN :
978-1-4244-2722-2
Electronic_ISBN :
978-1-4244-2723-9
DOI :
10.1109/CCDC.2009.5192696