Deformable Proximity Queries and Their Application in Mobile Manipulation Planning

@inproceedings{Gissler2009DeformablePQ,
  title={Deformable Proximity Queries and Their Application in Mobile Manipulation Planning},
  author={Marc Gissler and Christian Dornhege and Bernhard Nebel and Matthias Teschner},
  booktitle={ISVC},
  year={2009}
}
We describe a proximity query algorithm for the exact minimum distance computation between arbitrarily shaped objects. Special characteristics of the Gilbert-Johnson-Keerthi (GJK) algorithm are employed in various stages of the algorithm. In the first stage, they are used to search for sub-mesh pairs whose convex hulls do not intersect. In the case of an intersection, they guide a recursive decomposition. Finally, they are used to derive lower and upper distance bounds in non-intersecting cases… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 31 references

Real-world robot navigation amongst deformable obstacles

2009 IEEE International Conference on Robotics and Automation • 2009
View 1 Excerpt

Semantic Attachments for Domain-Independent Planning Systems

Towards Service Robots for Everyday Environments • 2009
View 2 Excerpts