Geodesic complexity
The notion of topological complexity was introduced by \textit{M. Farber} [Discrete Comput. Geom. 29, No. 2, 211--221 (2003; Zbl 1038.68130)]. From the introduction: ``The topological complexity of a topological space \(X\), denoted by \(TC(X)\), involves finding the smallest partition of \(X\times X\) into sets on which you can make a continuous choice of a path from \(x_0\) to \(x_1\) for all \((x_0,x_1)\in S\). In [J. Appl. Comput. Topol. 5, No. 1, 141--178 (2021; Zbl 1485.53050)], \textit{D. Recio-Mitter} had the idea of requiring that, if \(X\) is a metric space, the paths be minimal geodesics, i.e., shortest paths between their endpoints. He defined the geodesic complexity, \(GC(X)\), for a metric space \(X\) as follows. If \(X\) is a metric space, \(GC(X)\) is the smallest integer \(k\) such that there is a partition of \(X\times X\) into locally compac sets \(E_i,0\leq i\leq k\), such that for each \(i\), there is a continuous function \(\sigma_i:E_i\rightarrow P(X)\), where \(P(X)\) is the space of all paths in \(X\), and for all \((x_0,x_1)\in E_i,\sigma_i(x_0,x_1)\) is a (minimal) geodesic from \(x_0\) to \(x_1\). Each \(\sigma_i\) is called a geodesic motion planning rule (GMPR). From the abstract: ``\dots We survey many of the interesting results obtained by Recio-Mitter. Then we focus on two cases, the cube and the 2-point ordered configuration space of a star graph, with a fairly through sketch of the proof of the geodesic complexity of each. The second section after the Introduction is entitled ``Two robots moving on a star graph, and at the beginning of it, the author states: ``In this section, we present many of the main ideas in [\textit{D. M. Davis} et al., Algebr. Geom. Topol. 22, No. 2, 785--814 (2022; Zbl 1497.55005)] regarding \( GC(F_\varepsilon(G,2))\), where \(G\) is a star graph with at least four edges. The third section is entitled ``Geodesic complexity of a cube. In its opening the author states again: ``In this section, we sketch the proof from [\textit{D. M. Davis}, Tbil. Math. J. 14, No. 1, 149--162 (2021; Zbl 1494.53047)]. Finally, the article also contains 16 figures, about which the author does not specify whether they are original or have also appeared in the other three articles mentioned. For the entire collection see [Zbl 1547.55002].
- Geodesic complexity of a cube
- Geodesic complexity of homogeneous Riemannian manifolds
- Geodesic complexity of motion planning
- Geodesic complexity via fibered decompositions of cut loci
- Geodesics in the configuration spaces of two points in \(\mathbb{R}^n\)
- Geometric and topological properties of manifolds in robot motion planning
- scientific article; zbMATH DE number 2005648 (Why is no real title available?)
- Isomorphism classes of cut loci for a cube
- Metric spaces of non-positive curvature
- Star Unfolding of a Polytope with Applications
- The cut locus of a torus of revolution
- The geodesic complexity of \(n\)-dimensional Klein bottles
- Topological complexity and efficiency of motion planning algorithms
- Topological complexity of motion planning
- Topological complexity of the Klein bottle
- Two robots moving geodesically on a tree
This page was built for publication: Geodesic complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6641610)
