Robot motion planning, weights of cohomology classes, and cohomology operations
From MaRDI portal
Publication:3522336
Abstract: The complexity of algorithms solving the motion planning problem is measured by a homotopy invariant TC(X) of the configuration space X of the system. Previously known lower bounds for TC(X) use the structure of the cohomology algebra of X. In this paper we show how cohomology operations can be used to sharpen these lower bounds for TC(X). As an application of this technique we calculate explicitly the topological complexity of various lens spaces. The results of the paper were inspired by the work of E. Fadell and S. Husseini on weights of cohomology classes appearing in the classical lower bounds for the Lusternik - Schnirelmann category. In the appendix to this paper we give a very short proof of a generalized version of their result.
Recommendations
Cites work
- scientific article; zbMATH DE number 1973373 (Why is no real title available?)
- scientific article; zbMATH DE number 2005648 (Why is no real title available?)
- scientific article; zbMATH DE number 2103273 (Why is no real title available?)
- scientific article; zbMATH DE number 796953 (Why is no real title available?)
- scientific article; zbMATH DE number 5250983 (Why is no real title available?)
- scientific article; zbMATH DE number 3235051 (Why is no real title available?)
- scientific article; zbMATH DE number 3246969 (Why is no real title available?)
- BP-theoretic instabilities to the motion planning problem in 4-torsion lens spaces
- Instabilities of robot motion
- On category weight and its applications
- Topological complexity of motion planning
- Topological robotics in lens spaces
- Topology of robot motion planning
Cited in
(32)- The higher topological complexity in digital images
- Pseudo centre and its applications
- Different types of topological complexity based on higher homotopic distance
- Q-topological complexity
- Existence results for closed Finsler geodesics via spherical complexities
- On the topological complexity of manifolds with abelian fundamental group
- Digital topological complexity numbers
- A lower bound for higher topological complexity of real projective space
- Topological complexity and the homotopy cofibre of the diagonal map
- Geodesic complexity via fibered decompositions of cut loci
- Higher topological complexity and its symmetrization
- Homotopic distance between maps
- Topological complexity of configuration spaces
- Spherical complexities with applications to closed geodesics
- Relative sectional category revisited
- A nonlinear Lazarev-Lieb theorem: \(L^2\)-orthogonality via motion planning
- Topological complexity of symplectic manifolds
- MOTION PLANNING IN SPACES WITH SMALL FUNDAMENTAL GROUPS
- Topological complexity of \(S^{3}/Q_{8}\) as fibrewise L-S category
- Lusternik-Schnirelmann theory to topological complexity from \(A_{\infty}\)-view point
- Computing with the \textsf{TC}-canonical class
- Motion planning in real projective spaces
- Group actions and higher topological complexity of lens spaces
- On LS-category and topological complexity of some fiber bundles and Dold manifolds
- Symmetric topological complexity of projective and Lens spaces
- Maps of degree one, LS category and higher topological complexities
- Topological complexity, fibrations and symmetry
- An upper bound for topological complexity
- Biequivariant maps on spheres and topological complexity of lens spaces
- Contiguity distance between simplicial maps
- On the topological complexity of aspherical spaces
- Topological complexity of classical configuration spaces and related objects
This page was built for publication: Robot motion planning, weights of cohomology classes, and cohomology operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3522336)
