{"type":"ScholarlyArticle","title":"A Scalable Approach to Chasing Multiple Moving Targets with Multiple Agents","authors":[{"name":"Fan Xie","slug":"fan-xie","given":"Fan","family":"Xie","affiliation":"Google Canada; IBM Research"},{"name":"Adi Botea","slug":"adi-botea","given":"Adi","family":"Botea","affiliation":"IBM Research , Ireland"},{"name":"Akihiro Kishimoto","slug":"akihiro-kishimoto","given":"Akihiro","family":"Kishimoto","affiliation":"IBM Research , Ireland"}],"abstract":"Chasing multiple mobile targets with multiple agents is important in several applications, such as computer games and police chasing scenarios. Existing approaches can compute optimal policies. However, they have a limited scalability, as they implement expensive minimax searches. We introduce a sub-optimal but scalable approach that assigns individual agents to individual targets and that can dynamically re-compute such assignments. We provide a theoretical analysis, including upper bounds on the number of time steps required to solve an instance. In a detailed empirical evaluation on grid maps, our algorithm scales up very convincingly beyond the limits of previous methods. On small problems, where a comparison to a minimax approach is possible, the results demonstrate a good solution quality for our method.","doi":"10.24963/ijcai.2017/624","url":"https://ijcai.org/proceedings/2017/624","pdf":"https://ijcai.org/proceedings/2017/0624.pdf","markdown":"https://ijcai.org/proceedings/2017/624.md","bibtex":"https://ijcai.org/proceedings/2017/bibtex/624","volume":{"slug":"2017","title":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2017","url":"https://ijcai.org/proceedings/2017/","year":2017,"location":"Melbourne, Australia","dates":"19-25 August 2017","editors":"Carles Sierra","isbn":"978-0-9992411-0-3","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2017"},"section":"Planning and Scheduling","track":"Main track","number":624,"pages":{"first":4470,"last":4476},"keywords":["Planning and Scheduling: Search in Planning and Scheduling","Agent-based and Multi-agent Systems: Multi-agent Planning","Combinatorial & Heuristic Search: Heuristic Search"],"videos":[],"references":[{"position":1,"raw":"[Baier et al., 2014] Jorge A. Baier, Adi Botea, Daniel Hara- bor, and Carlos Hernández. A Fast Algorithm for Catch- ing a Prey Quickly in Known and Partially Known Game Maps. IEEE Transactions on Computational Intelligence and AI in Games, 7(2):193-199, 2014.","title":"A Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps","authors":"Jorge A Baier, Adi Botea, Daniel Harabor, Carlos Hernández","year":"2014","venue":"IEEE Transactions on Computational Intelligence and AI in Games","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Botea et al., 2013] Adi Botea, Jorge A. Baier, Daniel Hara- bor, and Carlos Hernández. Moving Target Search with Compressed Path Databases. In Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, ICAPS, 2013.","title":"Moving Target Search with Compressed Path Databases","authors":"Adi Botea, Jorge A Baier, Daniel Harabor, Carlos Hernández","year":"2013","venue":"Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Botea, 2011] Adi Botea. Ultra-Fast Optimal Pathfinding without Runtime Search. In Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE, pages 122-127, 2011.","title":"Ultra-Fast Optimal Pathfinding without Runtime Search","authors":"Adi Botea","year":"2011","venue":"Proceedings of the Seventh AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, AIIDE","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Burkard et al., 2009] R.E. Burkard, M. Dell'Amico, and S. Martello. Assignment Problems. SIAM e-books. Soci- ety for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), 2009.","title":"Assignment Problems. SIAM e-books","authors":"R E Burkard, M Dell'amico, S Martello","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Edmonds and Karp, 1972] Jack Edmonds and Richard M. Karp. Theoretical Improvements in Algorithmic Effi- ciency for Network Flow Problems. J. ACM, 19(2):248- 264, 1972.","title":"Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems","authors":"Karp ; ] Jack Edmonds, Richard M Edmonds, Karp","year":"1972","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Goldenberg et al., 2003] Mark Goldenberg, Alexander Ko- varsky, Xiaomeng Wu, and Jonathan Schaeffer. Multiple Agents Moving Target Search. In Proceedings of the Eigh- teenth International Joint Conference on Artificial Intelli- gence, IJCAI, pages 1536-1538, 2003.","title":"Multiple Agents Moving Target Search","authors":"Mark Goldenberg, Alexander Kovarsky, Xiaomeng Wu, Jonathan Schaeffer","year":"2003","venue":"Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2003/264"},{"position":7,"raw":"[Hahn and MacGillivray, 2006] Gea Hahn and Gary MacGillivray. A Note on k-Cop, l-Robber Games on Graphs. Discrete Mathematics, 306(19-20):2492-2497, 2006.","title":"A Note on k-Cop, l-Robber Games on Graphs","authors":"Macgillivray Hahn, Gea Hahn, Gary Macgillivray","year":"2006","venue":"Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Hopcroft and Karp, 1973] John E. Hopcroft and Richard M. Karp. An n 5/2 Algorithm for Maximum Matchings in Bi- partite Graphs. SIAM Journal on Computing, 2(4):225- 231, 1973.","title":"An n 5/2 Algorithm for Maximum Matchings in Bipartite Graphs","authors":"John E Hopcroft, Richard M Karp","year":"1973","venue":"SIAM Journal on Computing","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Isaza et al., 2008] Alejandro Isaza, Jieshan Lu, Vadim Bu- litko, and Russell Greiner. A Cover-Based Approach to Multi-Agent Moving Target Pursuit. In Proceedings of the Fourth Artificial Intelligence and Interactive Digital En- tertainment Conference, AIIDE, pages 54-59, 2008.","title":"A Cover-Based Approach to Multi-Agent Moving Target Pursuit","authors":"Alejandro Isaza, Jieshan Lu, Vadim Bulitko, Russell Greiner","year":"2008","venue":"Proceedings of the Fourth Artificial Intelligence and Interactive Digital Entertainment Conference, AIIDE","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Ishida and Korf, 1991] Toru Ishida and Richard E. Korf. Moving Target Search. In Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI, pages 204-210, 1991.","title":"Moving Target Search","authors":"Korf ; ] Toru Ishida, Richard E Ishida, Korf","year":"1991","venue":"Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Koenig et al., 2007] Sven Koenig, Maxim Likhachev, and Xiaoxun Sun. Speeding up Moving-Target Search. In Pro- ceedings of the 6th International Joint Conference on Au- tonomous Agents and Multiagent Systems, AAMAS, 2007.","title":"Speeding up Moving-Target Search","authors":"Sven Koenig, Maxim Likhachev, Xiaoxun Sun","year":"2007","venue":"Proceedings of the 6th International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Moldenhauer and Sturtevant, 2009a] C. Moldenhauer and N.R. Sturtevant. Evaluating Strategies for Running from the Cops. Proceedings of the International Joint Con- ference on Artificial Intelligence, IJCAI, pages 584-589, 2009.","title":"Evaluating Strategies for Running from the Cops","authors":"Sturtevant Moldenhauer, C Moldenhauer, N R Sturtevant","year":"2009","venue":"Proceedings of the International Joint Conference on Artificial Intelligence, IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2009/103"},{"position":13,"raw":"[Moldenhauer and Sturtevant, 2009b] Carsten Moldenhauer and Nathan R. Sturtevant. Optimal Solutions for Moving Target Search. In Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Sys- tems, AAMAS, pages 1249-1250, 2009.","title":"Optimal Solutions for Moving Target Search","authors":"Sturtevant Moldenhauer, Carsten Moldenhauer, Nathan R Sturtevant","year":"2009","venue":"Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems, AAMAS","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Munkres, 1957] James Munkres. Algorithms for the As- signment and Transportation Problems. Journal of the So- ciety for Industrial and Applied Mathematics, 5(1):32-38, 1957.","title":"Algorithms for the Assignment and Transportation Problems","authors":"James Munkres","year":"1957","venue":"Journal of the Society for Industrial and Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Nussbaum and Yörükc ¸ü, 2015] Doron Nussbaum and Alper Yörükc ¸ü. Moving Target Search with Subgoal Graphs. In Proceedings of the International Conference on Automated Planning and Scheduling, ICAPS, pages 179-187, 2015.","title":"Moving Target Search with Subgoal Graphs","authors":"Doron Nussbaum, Alper Yörükc ¸ü","year":"2015","venue":"Proceedings of the International Conference on Automated Planning and Scheduling, ICAPS","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Sturtevant, 2012] N. Sturtevant. Benchmarks for Grid- Based Pathfinding. Transactions on Computational Intel- ligence and AI in Games, 4(2):144-148, 2012.","title":"Benchmarks for Grid-Based Pathfinding","authors":"N Sturtevant","year":"2012","venue":"Transactions on Computational Intelligence and AI in Games","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Sun et al., 2010] Xiaoxun Sun, William Yeoh, and Sven Koenig. Moving Target D* Lite. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, AAMAS, pages 67-74, 2010.","title":"Moving Target D* Lite","authors":"Sun","year":"2010","venue":"Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, AAMAS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Sun et al., 2012] Xiaoxun Sun, William Yeoh, Tansel Uras, and Sven Koenig. Incremental ARA*: An Incremen- tal Anytime Search Algorithm for Moving-Target Search. In Proceedings of the Twenty-Second International Con- ference on Automated Planning and Scheduling, ICAPS, pages 243-251, 2012.","title":"Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search","authors":"Sun","year":"2012","venue":"Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Vidal et al., 2002] Rene Vidal, Omid Shakernia, H Jin Kim, David Hyunchul Shim, and Shankar Sastry. Probabilis- tic Pursuit-Evasion Games: Theory, Implementation, and Experimental Evaluation. Robotics and Automation, IEEE Transactions on, 18(5):662-669, 2002.","title":"Probabilistic Pursuit-Evasion Games: Theory, Implementation, and Experimental Evaluation","authors":"Rene Vidal, Omid Shakernia, Jin Kim, David Hyunchul Shim, Shankar Sastry","year":"2002","venue":"Robotics and Automation","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Vieira et al., 2008] M.A.M. Vieira, R. Govindan, and G.S. Sukhatme. Optimal Policy in Discrete Pursuit-Evasion Games. Technical Report 08-900, Department of Com- puter Science, University of Southern California, 2008.","title":"Optimal Policy in Discrete Pursuit-Evasion Games","authors":"M A M Vieira, R Govindan, G S Sukhatme","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Vieira et al., 2009] Marcos A. M. Vieira, Ramesh Govin- dan, and Gaurav S. Sukhatme. Scalable and Practical Pursuit-Evasion. In Second International Conference on Robot Communication and Coordination, ROBOCOMM, March 2009.","title":"Scalable and Practical Pursuit-Evasion","authors":"Marcos A M Vieira, Ramesh Govindan, Gaurav S Sukhatme","year":"2009","venue":"Second International Conference on Robot Communication and Coordination","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Xie et al., 2015] Fan Xie, Adi Botea, and Akihiro Kishi- moto. Heuristic-Aided Compressed Distance Databases. In AAAI-15 Workshop on Planning, Search, and Optimiza- tion (PlanSOpt-15), 2015.","title":"Heuristic-Aided Compressed Distance Databases","authors":"Fan Xie, Adi Botea, Akihiro Kishimoto","year":"2015","venue":"AAAI-15 Workshop on Planning, Search, and Optimization (PlanSOpt-15","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}