Topological complexity and efficiency of motion planning algorithms
From MaRDI portal
Abstract: We introduce a variant of Farber's topological complexity, defined for smooth compact orientable Riemannian manifolds, which takes into account only motion planners with the lowest possible "average length" of the output paths. We prove that it never differs from topological complexity by more than , thus showing that the latter invariant addresses the problem of the existence of motion planners which are "efficient".
Recommendations
- Topological complexity of the work map
- Geodesic complexity for non-geodesic spaces
- Topological complexity of motion planning
- Mini-workshop: Topological complexity and related topics. Abstracts from the mini-workshop held February 28 -- March 5, 2016
- Directed topological complexity
- Motion planning algorithms for configuration spaces in the higher dimensional case
- An upper bound for higher topological complexity and higher strongly equivariant complexity
- Topological complexity of \(H\)-spaces
- On the LS-category and topological complexity of a connected sum
- Simplicial approximation and refinement of monoidal topological complexity
Cites work
- scientific article; zbMATH DE number 52737 (Why is no real title available?)
- scientific article; zbMATH DE number 3204808 (Why is no real title available?)
- scientific article; zbMATH DE number 5250983 (Why is no real title available?)
- Instabilities of robot motion
- Invitation to topological robotics
- Riemannian Geometry
- Riemannian geometry
- Topological complexity is a fibrewise L-S category
- Topological complexity of motion planning
Cited in
(19)- Topological complexity of collision-free motion planning on surfaces
- Mini-workshop: Topological complexity and related topics. Abstracts from the mini-workshop held February 28 -- March 5, 2016
- scientific article; zbMATH DE number 3934720 (Why is no real title available?)
- Geodesic complexity of homogeneous Riemannian manifolds
- Loop topological complexity
- A noncommutative version of Farber's topological complexity
- Motion planning in tori
- Geodesic complexity via fibered decompositions of cut loci
- On the topological behaviour of motion planners
- Geodesic complexity
- Geodesic complexity of motion planning
- Geometric eccentricity and the complexity of manipulation plans
- Topological complexity of collision-free multi-tasking motion planning on orientable surfaces
- Homotopic distance and generalized motion planning
- Motion planning in polyhedral products of groups and a Fadell-Husseini approach to topological complexity
- Motion planning algorithms, topological properties and affine approximation
- On complexity and motion planning for co-rank one sub-Riemannian metrics
- The complexity of the tabulation of trajectory problems
- Geometric and topological properties of manifolds in robot motion planning
This page was built for publication: Topological complexity and efficiency of motion planning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1725561)
