scientific article; zbMATH DE number 1174699

DOI10.1002/(SICI)1097-4563(199802)15:2%3C57::AID-ROB1%3E3.0.CO;2-RzbMATH Open0909.70009MaRDI QIDQ4398017FDOQ4398017

Authors: Chong Jin Ong, Elmer G. Gilbert 

Publication date: 7 April 1999

Title of this publication is not available (Why is that?)

Recommendations

• Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning
• ROBOT PATH PLANNING BASED ON MODIFIED GREY RELATIONAL ANALYSIS
• Planning of the trajectory for the tip of redundant robotic mechanisms in the presence of obstacles
• Pseudo minimum translational distance between convex polyhedra. I. Definition and properties
• Computation of penetration between smooth convex objects in three-dimensional space

zbMATH Keywords

parallel processingoptimization problemconfiguration variablesrobot-obstacle collisionssix degrees-of-freedom robotthree-dimensional work space

Mathematics Subject Classification ID

Kinematics of mechanisms and robots (70B15) Computational methods for problems pertaining to mechanics of particles and systems (70-08)

Cited In (8)

• ROBOT PATH PLANNING BASED ON MODIFIED GREY RELATIONAL ANALYSIS
• Optimal geometric modeler for robot motion planning
• An improved trajectory planner for redundant manipulators in constrained workspace
• A comparison of algorithms for path planning of industrial robots
• Pseudo minimum translational distance between convex polyhedra. I. Definition and properties
• Pseudo minimum translational distance between convex polyhedra. II. Robot collision-free path planning
• Robot Navigation with Distance Queries
• An opportunistic global path planner

This page was built for publication:

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