Multitasking collision-free optimal motion planning algorithms in Euclidean spaces

DOI10.1142/S1793830920500408zbMath1465.55004arXiv1906.03239WikidataQ114071642 ScholiaQ114071642MaRDI QIDQ4965908

No author found.

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1906.03239

zbMATH Keywords

configuration spacestopological complexitysequential motion planninghigher motion planning algorithms

Mathematics Subject Classification ID

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)

Related Items (3)

Sequential parametrized motion planning and its complexity. II ⋮ SEQUENTIAL COLLISION-FREE OPTIMAL MOTION PLANNING ALGORITHMS IN PUNCTURED EUCLIDEAN SPACES ⋮ Parametrized topological complexity of collision-free motion planning in the plane

Cites Work

• Motion planning algorithms for configuration spaces
• Motion planning algorithms for configuration spaces in the higher dimensional case
• 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
• Planning Algorithms
• Configuration Spaces.

This page was built for publication: Multitasking collision-free optimal motion planning algorithms in Euclidean spaces