Obstacle Collision Detection Using Best Ellipsoid Fit

Authors:
Elon Rimon;Stephen P. Boyd
Affiliations:
Dept. of Mechanical Engineering Technion, Israel Institute of Technology;Dept. of Electrical Engineering Stanford University
Venue:
Journal of Intelligent and Robotic Systems
Year:
1997

Citing 8
Cited 13

Real-time obstacle avoidance for manipulators and mobile robots

International Journal of Robotics Research
Collision Detection for Moving Polyhedra

IEEE Transactions on Pattern Analysis and Machine Intelligence
Perceptual organization and the representation of natural form

Readings in computer vision: issues, problems, principles, and paradigms
Containment algorithms for objects in rectangular boxes

Theory and practice of geometric modeling
Curved surfaces and coherence for non-penetrating rigid body simulation

SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
CAD-Based Computer Vision: From CAD Models to Relational Graphs

IEEE Transactions on Pattern Analysis and Machine Intelligence
Minimum spanning ellipsoids

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Motion Planning with Six Degrees of Freedom

Motion Planning with Six Degrees of Freedom

Real-time Velocity Alteration Strategy for Collision-free Trajectory Planning of Two Articulated Robot Manipulators

Journal of Intelligent and Robotic Systems
A Recursive Algorithm for On-line Clustering Obstacles Cluttered in Dynamic Environments

Journal of Intelligent and Robotic Systems
3D Collision-Free Motion Based on Collision Index

Journal of Intelligent and Robotic Systems
Collision prediction for polyhedra under screw motions

SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Fast and accurate collision detection based on enclosed ellipsoid

Robotica
Neighbor list collision-driven molecular dynamics simulation for nonspherical hard particles.

Journal of Computational Physics
Efficient collision detection for moving ellipsoids using separating planes

Computing - Geometric modelling dagstuhl 2002
Using domain-specific knowledge in generalization error bounds for support vector machine learning

Decision Support Systems
Using signature sequences to classify intersection curves of two quadrics

Computer Aided Geometric Design
Oriented bounding surfaces with at most six common normals

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Simulating hard rigid bodies

Journal of Computational Physics
Proximity queries using separating bounding volumes

International Journal of Computer Applications in Technology
An algebraic approach to continuous collision detection for ellipsoids

Computer Aided Geometric Design

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper describes a method for estimating the distance between a robot and its surrounding environment using best ellipsoid fit. The method consists of the following two stages. First we approximate the detailed geometry of the robot and its environment by minimum-volume enclosing ellipsoids. The computation of these ellipsoids is a convex optimization problem, for which efficient algorithms are known. Then we compute a conservative distance estimate using an important but little known formula for the distance of a point from and n-dimensional ellipse. The computation of the distance estimate (and its gradient vector) is shown to be an eigenvalue problem, whose solution can be rapidly found using standard techniques. We also present an incremental version of the distance computation, which takes place along a continuous trajectory taken by the robot. We have implemented the proposed approach and present some preliminary results.