A vertex algorithm for collision detection

DOI10.1016/S0377-2217(98)00370-1zbMath0979.90123OpenAlexW1965375784MaRDI QIDQ1579473

M. D. S. Aliyu

Publication date: 14 September 2000

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00370-1

zbMATH Keywords

simulationnonlinear programmingpolytopeconvex hullminimum distance

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30) Automated systems (robots, etc.) in control theory (93C85)

Related Items (1)

The distance between convex sets with Minkowski sum structure: application to collision detection

Uses Software

• Matlab
• Optimization Toolbox

Cites Work

• Unnamed Item
• Exterior point algorithms for nearest points and convex quadratic programs
• Distance estimation and collision prediction for on-line robotic motion planning
• Fast collision detection in four-dimensional space
• A recursive algorithm for finding the minimum norm point in a polytope and a pair of closest points in two polytopes
• On using LP to collision detection between a manipulator arm and surrounding obstacles
• LP-Based Algorithms for Detecting the Collision of Moving Objects

This page was built for publication: A vertex algorithm for collision detection