| http://dbpedia.org/ontology/abstract
|
The problem of Multi-Agent Path Finding (M … The problem of Multi-Agent Path Finding (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 objective function, usually defined as the number of time steps until all agents reach their goal cells. MAPF is the multi-agent generalization of the pathfinding problem, and it is closely related to the shortest path problem in the context of graph theory. Several algorithms have been proposed to solve the MAPF problem. Due to its complexity, it happens that optimal approaches are infeasible on big environments and with a high number of agents. However, given the applications in which MAPF is involved such as automated warehouses and airport management, it is important to reach a trade-off between the efficiency of the solution and its effectiveness.ncy of the solution and its effectiveness.
|
| http://dbpedia.org/ontology/thumbnail
|
http://commons.wikimedia.org/wiki/Special:FilePath/Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png?width=300 +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://mapf.info/index.php/Main/HomePage +
|
| http://dbpedia.org/ontology/wikiPageID
|
58554329
|
| http://dbpedia.org/ontology/wikiPageLength
|
22303
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1123071130
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/File:Types_of_agents%27_conflicts_in_a_grid_environment.png +
, http://dbpedia.org/resource/Optimization_problem +
, http://dbpedia.org/resource/Multi-agent_system +
, http://dbpedia.org/resource/Graph_%28discrete_mathematics%29 +
, http://dbpedia.org/resource/Category:Multi-agent_systems +
, http://dbpedia.org/resource/Machine_learning +
, http://dbpedia.org/resource/Service_robot +
, http://dbpedia.org/resource/Mixed_integer_programming +
, http://dbpedia.org/resource/Automated_warehouse +
, http://dbpedia.org/resource/NP-hardness +
, http://dbpedia.org/resource/SAT_solver +
, http://dbpedia.org/resource/Constraint_programming +
, http://dbpedia.org/resource/Planar_graph +
, http://dbpedia.org/resource/Optimal +
, http://dbpedia.org/resource/Category:Artificial_intelligence +
, http://dbpedia.org/resource/A%2A_search_algorithm +
, http://dbpedia.org/resource/Shortest_path_problem +
, http://dbpedia.org/resource/Pathfinding +
, http://dbpedia.org/resource/Graph_theory +
, http://dbpedia.org/resource/Multi-agent_planning +
, http://dbpedia.org/resource/File:Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Multi-agent_systems +
, http://dbpedia.org/resource/Category:Artificial_intelligence +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Multi-agent_pathfinding?oldid=1123071130&ns=0 +
|
| http://xmlns.com/foaf/0.1/depiction
|
http://commons.wikimedia.org/wiki/Special:FilePath/Types_of_agents%27_conflicts_in_a_grid_environment.png +
, http://commons.wikimedia.org/wiki/Special:FilePath/Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Multi-agent_pathfinding +
|
| owl:sameAs |
http://dbpedia.org/resource/Multi-agent_pathfinding +
, https://global.dbpedia.org/id/GPRgL +
, http://www.wikidata.org/entity/Q112842184 +
|
| rdfs:comment |
The problem of Multi-Agent Path Finding (M … The problem of Multi-Agent Path Finding (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 objective function, usually defined as the number of time steps until all agents reach their goal cells. MAPF is the multi-agent generalization of the pathfinding problem, and it is closely related to the shortest path problem in the context of graph theory.th problem in the context of graph theory.
|
| rdfs:label |
Multi-agent pathfinding
|
