A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles (Q4818580)
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 2104281
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles |
scientific article; zbMATH DE number 2104281 |
Statements
A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles (English)
0 references
29 September 2004
0 references
non-holonomic motion planning
0 references
curvature-constrained
0 references
shortest paths
0 references
mobile robot
0 references
computational geometry
0 references
0 references
0.8918492794036865
0 references
0.8676480054855347
0 references
0.8656194806098938
0 references
0.8554053902626038
0 references
