Geodesic complexity of motion planning (Q2240091): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: Loki / rank | |||
Normal rank | |||
Revision as of 15:07, 28 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Geodesic complexity of motion planning |
scientific article |
Statements
Geodesic complexity of motion planning (English)
0 references
5 November 2021
0 references
In this paper, the geodesic complexity of a metric space is introduced, using the topological complexity of a topological space. It is pointed out that both of them are numerical invariants. However, the topological complexity only depends on the homotopy type, while the geodesic complexity is an invariant under isometries. Also, it is proved that in some cases they coincide but tools are developed to distinguish the two in a range of examples. Finally, the total cut locus are studied.
0 references
geodesic complexity
0 references
metric spaces
0 references
topological complexity
0 references
cut locus
0 references
topological robotics
0 references
