Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58682808, #quickstatements; #temporary_batch_1711565664090
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Optimal Parallel Cooperative Path-Finding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / 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: Planning as satisfiability: parallel plans and algorithms for plan search / rank
 
Normal rank
Property / cites work
 
Property / cites work: SAT race 2015 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Encodings to Translate Finite CSPs into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2712822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / 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: Q3624124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative and core-guided maxsat solving: a survey and assessment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Control for Cooperative Manipulation and Transportation with Aerial Robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bridging constraint satisfaction and Boolean satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdimensional expansion for multirobot path planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards Robust CNF Encodings of Cardinality Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph puzzles, homotopy, and the alternating group / rank
 
Normal rank
Property / cites work
 
Property / cites work: Push and Rotate: a Complete Multi-agent Pathfinding Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compiling finite linear CSP into SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOLVING ABSTRACT COOPERATIVE PATH-FINDING IN DENSELY POPULATED ENVIRONMENTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5593816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4473043 / rank
 
Normal rank

Revision as of 22:18, 14 July 2024

scientific article
Language Label Description Also known as
English
Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems
scientific article

    Statements

    Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (English)
    0 references
    0 references
    11 January 2018
    0 references
    cooperative path-finding (CPF)
    0 references
    propositional satisfiability (SAT)
    0 references
    time-expanded graphs
    0 references
    makespan-optimality
    0 references
    multi-robot path planning
    0 references
    multi-agent pathfinding
    0 references
    pebble motion on graphs
    0 references
    operator decomposition/independence detection
    0 references
    conflict-based search
    0 references
    increasing cost tree search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers