Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning

DOI10.1007/BF02916684zbMath1229.52016OpenAlexW1514436758MaRDI QIDQ866230

Han Ding, Xiangyang Zhu, YouLun Xiong

Publication date: 20 February 2007

Published in: Science in China. Series E (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02916684

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cites Work

• Pseudo minimum translational distance between convex polyhedra. I. Definition and properties
• Constructing roadmaps of semi-algebraic sets. I: Completeness
• Robot motion planning with uncertainty in control and sensing
• Robot collision-free path planning utilizing gauge function
• Spatial Planning: A Configuration Space Approach