Problemcore
Motion planning
Also called path planning, robot motion planning.
Find a collision-free path for a robot from a start configuration to a goal configuration.
Find a collision-free path for a robot from a start configuration to a goal configuration.
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 B8FG01 Edit this page History Report an error