Abstract
This study aims to investigate the problem of assignment strategies for multiple agents. In multi-agent scenarios, agents compute a path towards the goal, while these goal destinations in some cases are predefined in advance. The topic of assignment strategies, where agents need to identify and assign goal destination at the initial position, before making any move, has not been studied sufficiently. This problem becomes even more challenging if the goal destinations change over the period of time. This study investigates for new approaches to the assignment strategy in order to improve the efficiencies introducing three novel approaches for multiple agents in multiple moving targets environments: twin-cost, cover-cost and weighted-cost criteria. These new methods have been tested against existing overall the best approach in the literature. Empirical analysis is performed on grid-based gaming benchmarks. The performance is measured for the successful completeness of the test runs and achieving the shortest distance travelled. The experimental results suggest that the new assignment strategy methods exhibit better results in comparison with the existing approaches, where even some individual cases improve approximately by 23% especially when the means are the same.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Fomin, F.V., Golovach, P.A., Lokshtanov, D.: Cops and robber game without recharging. Theory Comput. Syst. 50, 611–620 (2012)
Cáp, M., Novák, P., VokrÃnek, J., Pechoucek, M.: Multi-agent RRT: sampling-based cooperative pathfinding. In: International Foundation for Autonomous Agents and Multiagent Systems, pp. 1263–1264 (2013)
Li, J., Gange, G., Harabor, D., Stuckey, P.J., Ma, H., Koenig, S.: New techniques for pairwise symmetry breaking in multi-agent path finding, pp. 193–201 (2020)
Sun, X., Yeoh, W., Koenig, S.: Moving target D* Lite. In: Presented at the Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems (2010)
Ishida, T.: Moving target search with intelligence. In: Presented at the Proceedings Tenth National Conference on Artificial Intelligence (1992)
Koenig, S., Likhachev, M.: D* lite. In: Presented at the Proceedings of the National Conference on Artificial Intelligence, pp. 476–483 (2002)
Koenig, S., Likhachev, M.: Real-time adaptive A. In: 5th International Joint Conference on Autonomous Agents and Multiagent Systems, pp. 281–288 (2006)
Loh, P.K.K., Prakash, E.C.: Novel moving target search algorithms for computer gaming. Comput. Entertain. 7(27), 1–27:16 (2009)
Kolling, A., Kleiner, A., Lewis, M., Sycara, K.: Computing and executing strategies for moving target search, pp. 4246–4253 (2011)
Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding. In: 22nd IJCAI, pp. 662–667 (2011)
Sigurdson, D., Bulitko, V., Yeoh, W., Hernández, C., Koenig, S.: Multi-agent pathfinding with real-time heuristic search. In: 14th IEEE Conference on CIG, pp. 1–8 (2018)
Koenig, S., Likhachev, M., Sun, X.: Speeding up moving-target search. In: 6th International Joint Conference on Autonomous Agents and Multiagent Systems (2007)
Atzmon, D., Li, J., Felner, A., Nachmani, E., Shperberg, S., Sturtevant, N., Koenig, S.: Multi-directional heuristic search. In: Presented at the 29th International Joint Conference on Artificial Intelligence, pp. 4062–4068 (2020)
Singh, A., Krause, A., Guestrin, C., Kaiser, W., Batalin, M.: Efficient planning of informative paths for multiple robots. In: 20th IJCAI, pp. 2204–2211 (2007)
Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40–66 (2015)
Sharon, G., Stern, R., Felner, A., Sturtevant, N.: Meta-agent conflict-based search for optimal multi-agent path finding, pp. 97–104 (2012)
Afzalov, A., Lotfi, A., Aydin, M.E.: A strategic search algorithm in multi-agent and multiple target environment. In: Presented at the the 8th International Conference on Robot Intelligence Technology and Applications (RiTA) .stylefix (2020)
Xie, F., Botea, A., Kishimoto, A.: A scalable approach to chasing multiple moving targets with multiple agents. In: 26th IJCAI, Melbourne, Australia, pp. 4470–4476 (2017)
Stern, R., Sturtevant, N.R., Felner, A., Koenig, S., Ma, H., Walker, T.T., Li, J., Atzmon, D., Cohen, L., Kumar, T.K.S., Boyarski, E., Barták, R.: Multi-agent pathfinding: definitions, variants, and benchmarks. In: 12th International SoCS 2019, pp. 151–158 (2019)
Botea, A., Bouzy, B., Buro, M., Bauckhage, C., Nau, D.: Pathfinding in games. In: Presented at the Artificial and Computational Intelligence in Games (2013)
Isaza, A., Lu, J., Bulitko, V., Greiner, R.: A cover-based approach to multi-agent moving target pursuit. In: 4th Artificial Intelligence and Interactive Digital Entertainment Conference, AIIDE 2008, pp. 54–59 (2008)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Afzalov, A., He, J., Lotfi, A., Aydin, M.E. (2021). Multi-Agent Path Planning Approach Using Assignment Strategy Variations in Pursuit of Moving Targets. In: Jezic, G., Chen-Burger, J., Kusek, M., Sperka, R., Howlett, R.J., Jain, L.C. (eds) Agents and Multi-Agent Systems: Technologies and Applications 2021. Smart Innovation, Systems and Technologies, vol 241. Springer, Singapore. https://doi.org/10.1007/978-981-16-2994-5_38
Download citation
DOI: https://doi.org/10.1007/978-981-16-2994-5_38
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-16-2993-8
Online ISBN: 978-981-16-2994-5
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)