Topological complexity of motion planning
From MaRDI portal
Abstract: In this paper we study a notion of topological complexity for the motion planning problem. The topological complexity is a number which measures discontinuity of the process of motion planning in the configuration space X. More precisely, it is the minimal number k such that there are k different motion planning rules, each defined on an open subset of XxX, so that each rule is continuous in the source and target configurations. We use methods of algebraic topology (the Lusternik - Schnirelman theory) to study the topological complexity . We give an upper bound (in terms of the dimension of the configuration space X) and also a lower bound (in the terms of the structure of the cohomology algebra of X). We explicitly compute the topological complexity of motion planning for a number of configuration spaces: for spheres, two-dimensional surfaces, for products of spheres. In particular, we completely calculate the topological complexity of the problem of motion planning for a robot arm in the absence of obstacles.
Recommendations
Cited in
(only showing first 100 items - show all)- Symmetric topological complexity of projective and Lens spaces
- Topological complexity is a fibrewise L-S category
- Motion planning algorithms, topological properties and affine approximation
- Loop topological complexity
- Topological complexity of the Klein bottle
- Topological complexity of certain classes of \(C^\ast\)-algebras
- Mini-workshop: Topological complexity and related topics. Abstracts from the mini-workshop held February 28 -- March 5, 2016
- Effective topological complexity of spaces with symmetries
- A noncommutative version of Farber's topological complexity
- Topological complexity and efficiency of motion planning algorithms
- An upper bound for topological complexity
- Oriented robot motion planning in Riemannian manifolds
- Higher topological complexity of aspherical spaces
- Sequential motion planning algorithms in real projective spaces: an approach to their immersion dimension
- A combinatorial description of topological complexity for finite spaces
- Topological complexity of \(n\) points on a tree
- Simplicial complexity: piecewise linear motion planning in robotics
- A lower bound for higher topological complexity of real projective space
- Topological complexity and motion planning in certain real Grassmannians.
- Relative topological complexity of a pair
- Module sectional category of products
- Instabilities of robot motion
- Equivariant topological complexity
- Topological complexity of motion planning in projective product spaces
- Topological complexity and the homotopy cofibre of the diagonal map
- Geometric eccentricity and the complexity of manipulation plans
- The geodesic complexity of \(n\)-dimensional Klein bottles
- Higher dimensional simplicial complexity
- Bounds for higher topological complexity of real projective space implied by BP
- Spherical complexities with applications to closed geodesics
- On the topological complexity of Grassmann manifolds
- On the LS-category and topological complexity of projective product spaces
- On the sectional category of subgroup inclusions and Adamson cohomology theory
- Geodesic complexity for non-geodesic spaces
- Higher topological complexity of hyperbolic groups
- Sequential parametrized motion planning and its complexity
- Parametrised topological complexity of group epimorphisms
- Combinatorics of a discrete trajectory space for robot motion planning
- Homotopic distance and generalized motion planning
- Parametrized topological complexity of collision-free motion planning in the plane
- Relative LS categories and higher topological complexities of maps
- On the topological complexity of manifolds with abelian fundamental group
- On Lusternik-Schnirelmann category and topological complexity of non-k-equal manifolds
- On the topological complexity of maps
- Geodesics in the configuration spaces of two points in \(\mathbb{R}^n\)
- Parametrized topological complexity of poset-stratified spaces
- Two robots moving geodesically on a tree
- Amenable category and complexity
- Symmetric topological complexity for finite spaces and classifying spaces
- Topological complexity of symplectic manifolds
- An upper bound for higher topological complexity and higher strongly equivariant complexity
- On the unordered configuration space \(C(RP^n,2)\)
- Minimal unimodal decomposition on trees
- Linear motion planning with controlled collisions and pure planar braids
- Pseudo centre and its applications
- On LS-category and topological complexity of some fiber bundles and Dold manifolds
- Topological complexity of unordered configuration spaces of certain graphs
- On the growth of topological complexity
- Effective topological complexity of orientable-surface groups
- Simplicial fibrations
- Higher equivariant and invariant topological complexities
- Homotopic distance between functors
- Sectional category and the fixed point property
- Farber's conjecture for planar graphs
- Geodesic complexity of motion planning
- Higher homotopic distance
- On higher analogs of topological complexity
- An application of the theory of FI-algebras to graph configuration spaces
- The rational sectional category of certain universal fibrations
- Directed topological complexity of spheres
- Directed topological complexity
- Topological complexity of unordered configuration spaces of surfaces
- A short proof for \(\mathrm{tc}(K)=4\)
- Subdivisional spaces and graph braid groups
- A note on covers defining relative and sectional categories
- Topological complexity of a map
- Higher analogs of simplicial and combinatorial complexity
- Bredon cohomology and robot motion planning
- New lower bounds for the topological complexity of aspherical spaces
- A mapping theorem for topological complexity
- The higher topological complexity of complement of fiber type arrangement
- Topological complexity of some planar polygon spaces
- Relative category and monoidal topological complexity
- On the cohomology rings of tree braid groups.
- Topology of random linkages
- Joins of DGA modules and sectional category
- Embedding right-angled Artin groups into graph braid groups.
- Topological complexity of configuration spaces of fully articulated graphs and banana graphs
- Relative topological complexity and configuration spaces
- Higher topological complexities of real Grassmannians and semi-complete real flag manifolds
- On the rational topological complexity of coformal elliptic spaces
- Sequential parametrized motion planning and its complexity. II
- Simplicial and combinatorial versions of higher symmetric topological complexity
- Rational approximations of sectional category and Poincaré duality
- On the zero-divisor-cup-length of spaces of oriented isometry classes of planar polygons
- Biequivariant maps on spheres and topological complexity of lens spaces
- Topological complexity of wedges and covering maps
- STRING TOPOLOGICAL ROBOTICS
- Topological complexity of collision-free motion planning on surfaces
- Topology and motion planning algorithms in robotics
This page was built for publication: Topological complexity of motion planning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1404499)
