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

zbMATH Open1229.52015MaRDI QIDQ866227FDOQ866227

Authors: Xiangyang Zhu, Han Ding, YouLun Xiong 

Publication date: 20 February 2007

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

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

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)

Cites Work

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

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)