Conflict-based search for optimal multi-agent pathfinding (Q2343829): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Planning as heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized best-first search strategies and the optimality of A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: On multiple moving objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Partial Expansion A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Distributed Motion Planning with Safety Guarantees under Second-Order Dynamics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Understanding planning tasks. Domain complexity and heuristic decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first iterative-deepening: An optimal admissible tree search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-based search for optimal multi-agent pathfinding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The increasing cost tree search for optimal multi-agent pathfinding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3093656 / rank
 
Normal rank

Revision as of 00:59, 10 July 2024

scientific article
Language Label Description Also known as
English
Conflict-based search for optimal multi-agent pathfinding
scientific article

    Statements

    Identifiers