Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (Q1688718)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6824754
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems |
scientific article; zbMATH DE number 6824754 |
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
0.8292955756187439
0 references
0.7949990630149841
0 references
0.7363137602806091
0 references
0.7212987542152405
0 references
