![](bg8.png)
gence and Interactive Digital Entertainment Confer-
ence, AIIDE, page 54 – 59.
Ishida, T. and Korf, R. E. (1991). Moving target search.
In Proceedings of the 12th International Joint Confer-
ence on Artificial Intelligence, IJCAI, volume 1, pages
204–210.
Johnson, D. and Wiles, J. (2001). Computer games with in-
telligence. In Proceedings of the 10th IEEE Interna-
tional Conference on Fuzzy Systems, volume 3, pages
1355–1358.
Kloder, S. and Hutchinson, S. (2006). Path planning for
permutation-invariant multirobot formations. IEEE
Transactions on Robotics, 22:650–665.
Li, J., Gange, G., Harabor, D., Stuckey, P. J., Ma, H.,
and Koenig, S. (2020). New techniques for pairwise
symmetry breaking in multi-agent path finding. In
Proceedings of the 13th International Symposium on
Combinatorial Search, SoCS, volume 30, pages 193–
201.
Lucas, S. M. (2008). Computational intelligence and
games: Challenges and opportunities. International
Journal of Automation and Computing, 5(1):45–57.
Ma, H. and Koenig, S. (2016). Optimal target assignment
and path finding for teams of agents. In Proceedings
of the 15th International Conference on Autonomous
Agents and Multiagent Systems, AAMAS, page 1144 –
1152.
Ma, H., Koenig, S., Ayanian, N., Cohen, L., H
¨
onig, W., Ku-
mar, T. K., Uras, T., Xu, H., Tovey, C., and Sharon,
G. (2016). Overview: Generalizations of multi-agent
path finding to real-world scenarios. In IJCAI-16
Workshop on Multi-Agent Path Finding.
Ma, H., Li, J., Kumar, T. K., and Koenig, S. (2017). Life-
long multi-agent path finding for online pickup and
delivery tasks. In Proceedings of the 16th Interna-
tional Conference on Autonomous Agents and Multia-
gent Systems, AAMAS, volume 2, pages 837–845.
Maple, C., Prakash, E., Huang, W., and Qureshi, A. N.
(2014). Taxonomy of optimisation techniques and ap-
plications. International Journal of Computer Appli-
cations in Technology, 49(3-4):251–262.
Moldenhauer, C. and Sturtevant, N. R. (2009). Optimal
solutions for moving target search. In Proceedings
of the 8th International Conference on Autonomous
Agents and Multiagent Systems, AAMAS, volume 2,
pages 1249–1250.
Russell, S. and Norvig, P. (2021). Artificial intelligence: A
modern approach (Global edition). Pearson Educa-
tion Limited, 4 edition.
Ryan, M. (2006). Multi-robot path-planning with sub-
graphs. In Proceedings of the 19th Australasian Con-
ference on Robotics and Automation, ACRA, pages 1–
8.
Sharon, G., Stern, R., Felner, A., and Sturtevant, N. (2012a).
Meta-agent conflict-based search for optimal multi-
agent path finding. In Proceedings of the 5th Inter-
national Symposium on Combinatorial Search, SoCS,
page 97 – 104.
Sharon, G., Stern, R., Felner, A., and Sturtevant, N. R.
(2012b). Conflict-based search for optimal multi-
agent path finding. In Proceedings of the 26th Na-
tional Conference on Artificial Intelligence, AAAI,
volume 1, page 563 – 569, Ontario, Canada. AAAI
Press.
Sharon, G., Stern, R., Goldenberg, M., and Felner, A.
(2011). The increasing cost tree search for optimal
multi-agent pathfinding. In Proceedings of the 22nd
International Joint Conference on Artificial Intelli-
gence, IJCAI, page 662 – 667.
Sharon, G., Stern, R., Goldenberg, M., and Felner, A.
(2013). The increasing cost tree search for opti-
mal multi-agent pathfinding. Artificial Intelligence,
195:470 – 495.
Shi, Y., Hu, B., and Huang, R. (2021). Task allocation
and path planning of many robots with motion uncer-
tainty in a warehouse environment. In 2021 IEEE In-
ternational Conference on Real-Time Computing and
Robotics, RCAR, page 776 – 781.
Standley, T. (2010). Finding optimal solutions to coopera-
tive pathfinding problems. In Proceedings of the 24th
National Conference on Artificial Intelligence, AAAI,
volume 1, page 173 – 178.
Standley, T. S. and Korf, R. E. (2011). Complete algorithms
for cooperative pathfinding problems. In Proceedings
of the 22nd International Joint Conference on Artifi-
cial Intelligence, IJCAI, page 668 – 673.
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., and Bart
´
ak, R. (2019). Multi-
agent pathfinding: Definitions, variants, and bench-
marks. In Proceedings of the 12th International Sym-
posium on Combinatorial Search, SoCS, page 151 –
158.
Tovey, C., Lagoudakis, M. G., Jain, S., and Koenig, S.
(2005). The generation of bidding rules for auction-
based robot coordination. In Multi-Robot Systems.
From Swarms to Intelligent Automata - Proceedings
from the 2005 International Workshop on Multi-Robot
Systems, volume 3, page 3 – 14.
¨
Unde
˘
ger, C¸ . (2007). Single and multi agent real-time path
search in dynamic and partially observable environ-
ments. PhD thesis, Middle East Technical University,
C¸ ankaya, Ankara, Turkey.
Vermette, J. (2011). A survey of path-finding algorithms
employing automatic hierarchical abstraction. Jour-
nal of the Association for Computing Machinery,
377:383.
Wagner, G. and Choset, H. (2015). Subdimensional expan-
sion for multirobot path planning. Artificial Intelli-
gence, 219:1–24.
Xie, F., Botea, A., and Kishimoto, A. (2017). A scalable ap-
proach to chasing multiple moving targets with mul-
tiple agents. In Proceedings of the 26th International
Joint Conference on Artificial Intelligence, IJCAI, vol-
ume 0, page 4470 – 4476.
Yannakakis, G. N. and Togelius, J. (2015). A panorama
of artificial and computational intelligence in games.
IEEE Transactions on Computational Intelligence and
AI in Games, 7:317–335.
Yu, J. and LaValle, S. M. (2016). Optimal multirobot
path planning on graphs: Complete algorithms and
effective heuristics. IEEE Transactions on Robotics,
32(5):1163–1177.
Coupled Assignment Strategy of Agents in Many Targets Environment
379