An algorithm for computing a convex and simple path of bounded curvature in a simple polygon (Q699767): Difference between revisions
From MaRDI portal
Removed claims |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Subir Kumar Ghosh / rank | |||
Normal rank | |||
| Property / author | |||
| Property / author: Telikepalli Kavitha / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s00453-002-0950-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1519400727 / rank | |||
Normal rank | |||
Latest revision as of 03:19, 20 March 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
