A Cover-Based Approach to Multi-Agent Moving Target Pursuit

Alejandro Isaza, Jieshan Lu, Vadim Bulitko, Russell Greiner · Artificial Intelligence and Interactive Digital Entertainment Conference · 2008

Explore this paper's citation graph

Summary

This work defines cover set and presents an algorithm that uses cover to coordinate multiple pursuers, and compares the effectiveness of this algorithm against several classic and state-of-the-art pursuit algorithms, along several performance measures.

Type: article
Published: 2008-10-22
Cited by: 35
References: 18
Access: Open access
DOI: https://doi.org/10.1609/aiide.v4i1.18672
OpenAlex: https://openalex.org/W155439275
Semantic Scholar: https://api.semanticscholar.org/CorpusID:16411974

Keywords

Cover (algebra), Computer science, Position (finance), Graph, Set (abstract data type)

References

New Approaches To Moving Target SearchStart Melax — 1993
Moving Target SearchToru Ishida, Richard E. Korf — 1991
4th International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2005), July 25-29, 2005, Utrecht, The NetherlandsFrank Dignum, Virginia Dignum, Sven Koenig — 2005
Baldur's GateE.V. Clark — 1970
Real-time search for learning autonomous agentsToru Ishida — 1997
Multiple Agents Moving Target SearchChang Wang, Sridhar Mahadevan — 2009
A Formal Basis for the Heuristic Determination of Minimum Cost PathsPeter Hart, Nils J. Nilsson, Bertram Raphael — 1968
Real-Time Heuristic SearchRichard E. Korf — 1990
Dynamic Control in Real-Time Heuristic SearchVadim Bulitko, Mitja Luštrek, Jonathan Schaeffer — 2008
Speeding up moving-target searchSven Koenig, Maxim Likhachev, Xiaoxun Sun — 2007
Partial Pathfinding Using Map Abstraction and RefinementNathan Sturtevant, Michael Buro — 2005
D*liteSven Koenig, Maxim Likhachev — 2002
Adaptive ASven Koenig, Maxim Likhachev — 2005
State Abstraction for Real-time Moving Target Pursuit : A Pilot StudyV. Bulitko, Nathan R Sturtevant — 2006

Cited by

Graph Searching and Related ProblemsAnthony Bonato, Boting Yang — 2013
The Game of Cops and Robbers on GraphsAnthony Bonato, Richard J. Nowakowski — 2011
Evaluating Strategies for Running from the CopsCarsten Moldenhauer, Nathan Sturtevant — 2009
The optimal capture time of the one-cop-moves gameBoting Yang, William Hamilton — 2015
Meyniel’s conjecture on the cop number: A surveyWilliam Baird, Anthony Bonato — 2013
Cops and Robbers is EXPTIME-completeWilliam B. Kinnersley — 2013
Moving-Target Pursuit Algorithm Using Improved Tracking StrategyMingliang Xu, Zhigeng Pan, Hongxing Lu — 2010
Incremental Search-Based Path Planning for Moving Target SearchXiaoxun Sun — 2013
Learning to intercept opponents in first person shooter gamesBulent Tastan, Yuan Chang, Gita Sukthankar — 2012
Visibility Induction for Discretized Pursuit-Evasion GamesAhmed Abdelrazek, Hazem El-Alfy — 2012
Effect of Latency on Pursuit ProblemsWilliam P. Birmingham, Shane Rose, Gregory Miller — 2012
Optimal solutions for moving target searchCarsten Moldenhauer, Nathan Sturtevant — 2009
Linguistic geometry approach for solving the Cops and Robber problem in grid environmentsAlireza Maddahi, Ellips Masehian — 2017
A Scalable Approach to Chasing Multiple Moving Targets with Multiple AgentsFan Xie, Adi Botea, Akihiro Kishimoto — 2017
Learning multi-agent pursuit of a moving targetJieshan Lu — 2009
Scalable cooperative multi-agent pathfinding with tractability and completeness guaranteesKo-Hsin Wang — 2012
The one-cop-moves game on planar graphsZiyuan Gao, Boting Yang — 2017
Domination and Identification Games in Graphs. (Jeux de Domination et d'Identification dans les Graphes)Fionn Mc Inerney — 2019
Receding Horizon Optimization Method for Solving the Cops and Robbers Problems in a Complex Environment with ObstaclesQiang Zhu, Kexin Wang, Zhijiang Shao — 2020
Multiple Pursuers TrailMax Algorithm for Dynamic EnvironmentsAzizkhon Afzalov, Ahmad Lotfi, Benjamin Inden — 2021

A Cover-Based Approach to Multi-Agent Moving Target Pursuit

Summary

Keywords

References

Cited by

Related papers