An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:49, 30 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algorithm for computing a convex and simple path of bounded curvature in a simple polygon |
scientific article |
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