Algorithmresearch
Conflict-based search
Also called CBS.
Optimal multi-agent pathfinding by a two-level search over path constraints that resolve conflicts.
Optimal multi-agent pathfinding by a two-level search over path constraints that resolve conflicts.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag DBEXMS Edit this page History Report an error