Parametrized topological complexity of collision-free motion planning in the plane
DOI10.1007/s10472-022-09801-6OpenAlexW3094266733MaRDI QIDQ2095547
Daniel C. Cohen, Shmuel Weinberger, Michael S. Farber
Publication date: 17 November 2022
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.09809
configuration spacestopological complexitymotion planning problemobstacle-avoiding collision-free motionparametrized topological complexity
Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Control of mechanical systems (70Q05) Discriminantal varieties and configuration spaces in algebraic topology (55R80) Sectioning fiber spaces and bundles in algebraic topology (55S40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Topological complexity of motion planning
- Topological complexity of symplectic manifolds
- Topological complexity of a map
- Combinatorial stratifications and minimality of 2-arrangements
- Topological complexity of configuration spaces
- The fundamental theorem of algebra and complexity theory
- Topological complexity of classical configuration spaces and related objects
- CONFIGURATION SPACES AND ROBOT MOTION PLANNING ALGORITHMS
- Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
- Topological complexity of the work map
- Topology of Parametrized Motion Planning Algorithms
- On topological complexity of hyperbolic groups
- Planning Algorithms
- The genus of a fiber space
- The cohomology rings of complements of subspace arrangements