Efficient distance computation using best ellipsoid fit

IEEE International Symposium on Intelligent Control - Proceedings

Volumn 1992-August, Issue , 1992, Pages 360-365

  Rimon, E ^a   Boyd, S P ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; GEOMETRY; INTELLIGENT CONTROL;

DISTANCE COMPUTATION; EIGENVALUE PROBLEM; GENERALIZED DISTANCES; GEOMETRICAL COMPLEXITY; MINIMUM VOLUME ELLIPSOIDS; POLYHEDRAL REPRESENTATION; SURROUNDING ENVIRONMENT; SYMMETRIC MATRICES;

ROBOTS;

EID: 85029832972     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIC.1992.225116     Document Type: Conference Paper

References (22)

1. C. Bajaj and M. Kim. Generation of configuration space obstacles: Moving algebraic surfaces. The International Journal of Robotics Research, 9(1):92-112, February 1990.
2. J. E. Bobrow. A direct minimization approach for obtaining the distance between convex polyhedra. The International Journal of Robotics Research, 8(3):65-76. June 1989.
3. S.P. Boyd and C.H. Barratt. Linear Controller Design. Prentice Hall. NJ, 1991.
4. J. F. Canny. The. complexity of robot motion planning. MIT Press, Cambridge, MA. 1988.
5. J.R. Dooley and J.M. McCarthy. Parametrized descriptions of the joint space obstacles for a 2r closed chain robot. In IEEE International Conference on Robotics and Automation, pages 1536-1541. Cincinnati. OH. May 1990.
6. W. Gander. Least squares with a quadratic constraint. Numerische Mathe-matik. 36:291-307, 1981.
7. W. Gander, G.H. Golub, and U. Matt. A constrained eigenvalue problem. Linear Algebra and its Applications, pages 815-839, 1989
8. E. Gilbert, and I). W. Johnson. Distance functions and their application to robot path planning in the presence of obstacles. IEEE Journal of Robotics and Automation, R.A-1( 1):21-30, March 1985.
9. E.G. Gilbert and C-P Foo. Computing the distance between general convex objects in three-dimensional space. IEEE Transactions on Robotics and Automation. 6( 1):53-61. Feb 1990.
10. F. John. Ex t renin m problems with inequalities as subsidiary conditions (1948). In J. Moser. editor, Fritz John Collected Papers, chapter Vol 2, pages 543-560. Birkhauser. Boston, 1985.
11. O. Khatib. Real time obstacle avoidance for manipulators and mobile robots. The International Journal of Robotics Research, 5(l):90-99, Spring 1986.
12. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, 1990.
13. J. Lengyel, M. Reichert, B.R. Donald, and D.P. Greenberg. Real-time robot motion planning using rasterizing computer graphics hardware. In ACM SIG-GRAPH, pages 327-335, Las-Vegas. July 1990.
14. J. Levin. A parametric algorithm for drawing pictures of solid objects composed of quadratic surfaces. Communications of the ACM, 19(10):555-563, Oct 1976.
15. M. C. Lin and J.F. Canny. A fast algorithm for incremental distance calculation. In IEEE International Conference on Robotics and Automation, pages 1008-1014, Sacramento, CA, April 1991.
16. R. R. Martin and P.C-Stephenson. Containment algorithm for objects in rectangular boxes. In Theory and Practice of Geometric Modeling, pages 307-325. Springer Verlag, New York, 1989.
17. Y.E. Nesterov and A.S. Nemirovsky. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. Springer Verlag, New York, 1992.
18. A. P. Pentland. Perceptual organization and the representation of natural form. In Readings in Computer Vision, pages 680-699. M. Kaufmann Publishers, Los Altos, CA, 1987.
19. M.J. Post. Minimum spanning ellipsoids. In ACM Symposium on Theory of Computing, pages 108-116. Washington, D.C. April 1984.
20. W.1I. Press. [J.P. Flaiinery. S.A. Teukolsky. and W.T. Vetterling. Xumencal Recipe in C. Cambridge University Press. NY. 1988.
21. E. Rimon and S.P. Boyd. Efficient distance computation using best ellipsoid fit. Technical report. Information Systems Laboratory, Stanford University, Dec 1991.
22. S. Sclaroff and A. Pentland. Generalized implicit functions for computer graphics. In ACM SIGGRAPIL pages 247-250. Las Vegas, July 1991.