Pseudo minimum translational distance between convex polyhedra. I. Definition and properties
From MaRDI portal
Publication:866227
zbMath1229.52015MaRDI QIDQ866227
Han Ding, Xiangyang Zhu, YouLun Xiong
Publication date: 20 February 2007
Published in: Science in China. Series E (Search for Journal in Brave)
Computational aspects related to convexity (52B55) Automated systems (robots, etc.) in control theory (93C85) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Pseudo minimum translational distance between convex polyhedra. I. Definition and properties, Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning, Genetic algorithms in bidisciplinary (aerodynamics/electromagnetism) optimization
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