Keerthi, SS and Sridharan, K (1991) Measures of intensity of collision between convex objects and their efficient computation. In: Proceedings of the SPIE - The International Society for Optical Engineering, 2-5 Jan. 1991, Bangalore, India, pp. 266-275.
Full text not available from this repository. (Request a copy)Abstract
class of measures for quantifying the intensity of collision between two intersecting convex, compact objects is given. A general algorithm is derived for computing these measures when the objects are convex polytopes. This algorithm has a severe time-complexity. Two special measures are singled out and shown to be fast to compute. Hence they are suitable for use in applications such as robot motion planning and VLSI layout.
| Item Type: | Conference Paper |
|---|---|
| Publisher: | IEEE |
| Additional Information: | Copyright 1991 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE. |
| Keywords: | computational complexity;planning (artificial intelligence); position control;robots |
| Department/Centre: | Division of Electrical Sciences > Computer Science & Automation |
| Date Deposited: | 16 Jan 2008 |
| Last Modified: | 12 Jan 2012 09:13 |
| URI: | http://eprints.iisc.ac.in/id/eprint/11181 |
Actions (login required)
 |
View Item |
