A Polynomial-Time Algorithm for Computing Shortest Paths of Bounded Curvature Amidst Moderate Obstacles (Q4818580): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1142/s0218195903001128 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148079461 / rank | |||
Normal rank | |||
Latest revision as of 10:16, 30 July 2024
scientific article; zbMATH DE number 2104281
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
