{"version":"1.0","type":"link","title":"Multi-agent pathfinding - Newikis","description":"The problem of Multi-Agent Pathfinding (MAPF) is an instance of multi-agent planning and consists in the computation of collision-free paths for a group of agents from their location to an assigned target. It is an optimization problem, since the aim is to find those paths that optimize a given…","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://upload.wikimedia.org/wikipedia/commons/c/c3/Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png","thumbnail_width":884,"thumbnail_height":886}