Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10472-017-9560-z / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10472-017-9560-Z / rank | |||
Normal rank | |||
Latest revision as of 03:40, 11 December 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
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
