k-th shortest collision-free path planning (Q1092820)
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: k-th shortest collision-free path planning |
scientific article; zbMATH DE number 4020867
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | k-th shortest collision-free path planning |
scientific article; zbMATH DE number 4020867 |
Statements
k-th shortest collision-free path planning (English)
0 references
1988
0 references
A hierarchical approach is formulated for the shortest collision-free path construction problem. The new concepts of k-th neighborhood, k-th visibility graph and k-th shortest path are introduced. The proposed approach generalizes some earlier algorithms and allows for incremental improvement of the planned path.
0 references
hierarchical approach
0 references
shortest collision-free path construction problem
0 references
k-th neighborhood,
0 references
k-th visibility graph
0 references
k-th shortest path
0 references
