This HTML5 document contains 39 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
n13http://dbpedia.org/resource/File:
foafhttp://xmlns.com/foaf/0.1/
n14https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
n7http://commons.wikimedia.org/wiki/Special:FilePath/
n10http://mapf.info/index.php/Main/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Multi-agent_pathfinding
rdfs:label
Multi-agent pathfinding
rdfs:comment
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.
foaf:depiction
n7:Types_of_agents'_conflicts_in_a_grid_environment.png n7:Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png
dcterms:subject
dbc:Artificial_intelligence dbc:Multi-agent_systems
dbo:wikiPageID
58554329
dbo:wikiPageRevisionID
1123071130
dbo:wikiPageWikiLink
dbr:Multi-agent_planning dbr:Pathfinding dbr:Service_robot dbc:Artificial_intelligence dbr:Graph_(discrete_mathematics) dbr:Multi-agent_system dbr:Optimization_problem dbr:Optimal dbr:A*_search_algorithm dbr:Planar_graph dbr:SAT_solver dbr:Constraint_programming n13:Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png dbr:Shortest_path_problem n13:Types_of_agents'_conflicts_in_a_grid_environment.png dbc:Multi-agent_systems dbr:Graph_theory dbr:NP-hardness dbr:Machine_learning dbr:Mixed_integer_programming dbr:Automated_warehouse
dbo:wikiPageExternalLink
n10:HomePage
owl:sameAs
wikidata:Q112842184 n14:GPRgL
dbp:wikiPageUsesTemplate
dbt:Short_description
dbo:thumbnail
n7:Example_of_Multi-Agent_Path_Finding_in_a_grid_environment.png?width=300
dbo:abstract
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.
prov:wasDerivedFrom
wikipedia-en:Multi-agent_pathfinding?oldid=1123071130&ns=0
dbo:wikiPageLength
22303
foaf:isPrimaryTopicOf
wikipedia-en:Multi-agent_pathfinding
Subject Item
wikipedia-en:Multi-agent_pathfinding
foaf:primaryTopic
dbr:Multi-agent_pathfinding