An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for computing a convex and simple path of bounded curvature in a simple polygon |
scientific article; zbMATH DE number 1807914
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for computing a convex and simple path of bounded curvature in a simple polygon |
scientific article; zbMATH DE number 1807914 |
Statements
An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (English)
0 references
25 September 2002
0 references
collision-free path planning problem
0 references
point robot
0 references
0.9124438762664796
0 references
0.8835371136665344
0 references
0.8830435276031494
0 references
0.8687901496887207
0 references
