Topological complexity and efficiency of motion planning algorithms

DOI10.4171/rmi/1039zbMath1412.55002arXiv1607.00703OpenAlexW3104523862WikidataQ128840427 ScholiaQ128840427MaRDI QIDQ1725561

Xianqiang Yang

Publication date: 14 February 2019

Published in: Revista Matemática Iberoamericana (Search for Journal in Brave)

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

zbMATH Keywords

geodesicscut locustopological complexitymotion planning algorithm

Mathematics Subject Classification ID

Lyusternik-Shnirel'man category of a space, topological complexity à la Farber, topological robotics (topological aspects) (55M30) Geodesics in global differential geometry (53C22) Artificial intelligence for robotics (68T40)

Related Items (4)

Geodesic complexity via fibered decompositions of cut loci ⋮ Geodesic complexity of homogeneous Riemannian manifolds ⋮ Geodesic complexity of motion planning ⋮ Homotopic distance and generalized motion planning

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Invitation to topological robotics
• Topological complexity is a fibrewise L-S category
• Topological complexity of motion planning
• Instabilities of robot motion
• Riemannian Geometry
• Riemannian geometry

This page was built for publication: Topological complexity and efficiency of motion planning algorithms