SEQUENTIAL COLLISION-FREE OPTIMAL MOTION PLANNING ALGORITHMS IN PUNCTURED EUCLIDEAN SPACES
DOI10.1017/S0004972720000167zbMath1454.55017arXiv1912.04741WikidataQ114117703 ScholiaQ114117703MaRDI QIDQ5138965
No author found.
Publication date: 4 December 2020
Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1912.04741
configuration spacesroboticstopological complexityhigher motion planning algorithmspunctured Euclidean spaces
Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Homotopy equivalences in algebraic topology (55P10) Discriminantal varieties and configuration spaces in algebraic topology (55R80) Artificial intelligence for robotics (68T40)
Cites Work
- Higher topological complexity and its symmetrization
- Lectures on algebraic topology.
- Topological complexity of motion planning
- On higher analogs of topological complexity
- Sequential motion planning of non-colliding particles in Euclidean spaces
- CONFIGURATION SPACES AND ROBOT MOTION PLANNING ALGORITHMS
- Multitasking collision-free optimal motion planning algorithms in Euclidean spaces
- Planning Algorithms
- Configuration Spaces.
This page was built for publication: SEQUENTIAL COLLISION-FREE OPTIMAL MOTION PLANNING ALGORITHMS IN PUNCTURED EUCLIDEAN SPACES