Univector field method-based multi-agent navigation for pursuit problem in obstacle environments

作     者：Le Pham Tuyen Hoang Huu Viet Sang Hyeok An Seung Gwan Lee Dong-Han Kim Tae Choong Chung 

作者机构：Department of Computer Science and Engineering Kyung Hee University Yongin Gyeonggi 446-701 Korea Department of Information Technology Vinh University 182-Le Duan Vinh City Nghe An 461056 Vietnam Humanitas College Kyung Hee University Yongin Gyeonggi 446-701 Korea Department of Electronics and Radio Engineering Kyung Hee University Yongin Gyeonggi 446-701 Korea 

出 版 物：《Journal of Central South University》 (中南大学学报（英文版）)

年 卷 期：2017年第24卷第4期

页      面：1002-1012页

核心收录：

学科分类：0810[工学-信息与通信工程] 12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 0806[工学-冶金工程] 081104[工学-模式识别与智能系统] 08[工学] 0805[工学-材料科学与工程（可授工学、理学学位）] 0703[理学-化学] 0835[工学-软件工程] 0811[工学-控制科学与工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：the Basic Science Research Program through the National Research Foundation of Korea (NRF-2014R1A1A2057735) the Kyung Hee University in 2016 [KHU-20160601] 

主　　题：pursuit problem predator agent prey agent univector field method multi-agent systems 

摘      要：The pursuit problem is a well-known problem in computer science. In this problem, a group of predator agents attempt to capture a prey agent in an environment with various obstacle types, partial observation, and an infinite grid-world. Predator agents are applied algorithms that use the univector field method to reach the prey agent, strategies for avoiding obstacles and strategies for cooperation between predator agents. Obstacle avoidance strategies are generalized and presented through strategies called hitting and following boundary(HFB); trapped and following shortest path(TFSP); and predicted and following shortest path(PFSP). In terms of cooperation, cooperation strategies are employed to more quickly reach and capture the prey agent. Experimental results are shown to illustrate the efficiency of the method in the pursuit problem.