Get all the updates for this publication
Other
On computing a distance measure for path planningPublished in Publ by IEEE, Piscataway, NJ, United States
1993
Volume: 1
Pages: 554 - 559
Let A and B be two objects such that A ICTN B DNEQ 0). We define a measure to characterize the penetration between A and B. We present fast algorithms for computing the measure for planar and polyhedral objects. We demonstrate how the measure can be used in collision detection for path planning.
Topics: Measure (physics) (65)%65% related to the paper, Transverse measure (60)%60% related to the paper, Intersection (57)%57% related to the paper, Collision detection (54)%54% related to the paper and Motion planning (53)%53% related to the paper
View more info for "On computing a distance measure for path planning"
Content may be subject to copyright.
About the journal
| Journal | Data powered by TypesetProceedings - IEEE International Conference on Robotics and Automation |
|---|---|
| Publisher | Data powered by TypesetPubl by IEEE, Piscataway, NJ, United States |
| ISSN | 10504729 |
| Open Access | No |
Authors (1)
Krishnamurthy Sridharan- A parallel algorithm, architecture and FPGA realization for high speed determination of the complete visibility graph for convex objects
- A comparative study on the performance of differently treated plain carbon steel gears
- Carbon nanotube FET-based low-delay and low-power multi-digit adder designs
- Hardware-efficient prediction-correction-based generalized-voronoi-diagram construction and FPGA implementation
