The thesis deals with the problem of finding plans for set of agents, where coordination of plans plays a significant role. An example of such a problem could be collisio-free multi-agent path finding used to coordinate movement of a set of mobile robots, for example, in warehouses.
Seznam odborné literatury
Roni Stern, Nathan R. Sturtevant, Ariel Felner, Sven Koenig, Hang Ma, Thayne T. Walker, Jiaoyang Li, Dor Atzmon, Liron Cohen, T. K. Satish Kumar, Roman Barták, Eli Boyarski: Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks. SOCS 2019: 151-159