Pseudo minimum translational distance between convex polyhedra. I. Definition and properties

MaRDI QIDQ866227zbMATH OpenFDO

Authors Xiangyang Zhu, Han Ding, YouLun Xiong

Publication date 20 February 2007

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

Mathematics Subject Classification ID

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

Recommendations

• Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning
• scientific article; zbMATH DE number 1174699
• Minimum distance collision-free path planning for industrial robots with a prismatic joint
• Robot collision-free path planning utilizing gauge function
• scientific article; zbMATH DE number 1497130

Cites work

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

Cited in

(3)

• Genetic algorithms in bidisciplinary (aerodynamics/electromagnetism) optimization
• Pseudo minimum translational distance between convex polyhedra. I. Definition and properties
• Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning

This page was built for publication: Pseudo minimum translational distance between convex polyhedra. I. Definition and properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q866227)