Abstract
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. These bounds are utilized in a spatial subdivision scheme to achieve a twofold culling of the domain. The algorithm does not depend on spatial or temporal coherence and is, thus, specifically suited to be applied to deformable objects. Furthermore, we describe its embedding into the geometrical part of a mobile manipulation planning system. Experiments show its usability in dynamic scenarios with deformable objects as well as in complex manipulation planning scenarios.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lin, M., Gottschalk, S.: Collision detection between geometric models: a survey. In: Proc. of IMA Conference on Mathematics of Surfaces, pp. 37–56 (1998)
Schwarzer, F., Saha, M., Latombe, J.: Adaptive dynamic collision checking for single and multiple articulated robots in complex environments. IEEE Transactions on Robotics and Automation 21(3), 338–353 (2005)
Lin, M.C., Manocha, D.: 35. In: Handbook of Discrete and Computational Geometry, pp. 787–806. CRC Press, Boca Raton (2004)
Ericson, C.: Real-Time Collision Detection. Morgan Kaufmann (The Morgan Kaufmann Series in Interactive 3-D Technology) (2004)
Teschner, M., Kimmerle, S., Heidelberger, B., Zachmann, G., Raghupathi, L., Fuhrmann, A., Cani, M.-P., Faure, F., Magnenat-Thalmann, N., Strasser, W., Volino, P.: Collision detection for deformable objects. Computer Graphics Forum 24, 61–81 (2005)
Gilbert, E., Johnson, D., Keerthi, S.: A fast procedure for computing the distance between complex objects in three-dimensional space. IEEE Transactions on Robotics and Automation 4, 193–203 (1988)
Lin, M., Canny, J.: A fast algorithm for incremental distance calculation. In: IEEE Int. Conf. on Robotics and Automation, pp. 1008–1014 (1991)
Ehmann, S., Lin, M.: Accurate and fast proximity queries between polyhedra using surface decomposition. In: Computer Graphics Forum (Proc. of Eurographics 2001), vol. 20, pp. 500–510 (2001)
Quinlan, S.: Efficient distance computation between non-convex objects. In: IEEE Int. Conf. on Robotics and Automation, vol. 4, pp. 3324–3329 (1994)
Hubbard, P.: Approximating polyhedra with spheres for time-critical collision detection. ACM Transactions on Graphics 15, 179–210 (1996)
van den Bergen, G.: Efficient collision detection of complex deformable models using AABB trees. J. Graphics Tools 2, 1–13 (1997)
Klosowski, J., Held, M., Mitchell, J., Sowizral, H., Zikan, K.: Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Transactions on Visualization and Computer Graphics 4, 21–36 (1998)
Gottschalk, S., Lin, M., Manocha, D.: OBB-Tree: a hierarchical structure for rapid interference detection. In: SIGGRAPH 1996: Proc. of the 23rd annual conference on Computer graphics and interactive techniques, pp. 171–180. ACM Press, New York (1996)
Larsson, T., Akenine-Moeller, T.: Collision detection for continuously deforming bodies. In: Eurographics, pp. 325–333 (2001)
Teschner., M., Heidelberger, B., Mueller, M., Pomeranets, D., Gross, M.: Optimized spatial hashing for collision detection of deformable objects. In: Proc. Vision, Modeling, Visualization VMV 2003, Munich, Germany, pp. 47–54 (2003)
Gissler, M., Frese, U., Teschner, M.: Exact distance computation for deformable objects. In: Proc. Computer Animation and Social Agents CASA 2008, pp. 47–54 (2008)
Gissler, M., Teschner, M.: Adaptive surface decomposition for the distance computation of arbitrarily shaped objects. In: Proc. Vision, Modeling, Visualization VMV 2008, pp. 139–148 (2008)
Knott, D., Pai, D.: CInDeR: Collision and interference detection in real-time using graphics hardware. In: Proc. of Graphics Interface, pp. 73–80 (2003)
Govindaraju, N., Redon, S., Lin, M., Manocha, D.: CULLIDE: Interactive collision detection between complex models in large environments using graphics hardware. In: HWWS 2003: Proc. of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware, pp. 25–32 (2003)
Sud, A., Govindaraju, N., Gayle, R., Kabul, I., Manocha, D.: Fast proximity computation among deformable models using discrete Voronoi diagrams. ACM Trans. Graph. 25(3), 1144–1153 (2006)
Latombe, J.: Robot Motion Planning. Kluwer Academic Publishers, Dordrecht (1991)
Kavraki, L., Svestka, P., Latombe, J.-C., Overmars, M.: Probabilistic roadmaps for path planning in high-dimensional configuration spaces. IEEE Transactions on Robotics and Automation 12(4), 566–580 (1996)
Zhang, L., Kim, Y.J., Manocha, D.: C-dist: efficient distance computation for rigid and articulated models in configuration space. In: SPM 2007: Proceedings of the 2007 ACM symposium on Solid and physical modeling, pp. 159–169. ACM Press, New York (2007)
Alami, R., Laumond, J.P., Siméon, T.: Two manipulation planning algorithms. In: WAFR: Proceedings of the workshop on Algorithmic foundations of robotics, pp. 109–125. A.K. Peters, Ltd., Wellesley (1995)
Simeon, T., Cortes, J., Laumond, J., Sahbani, A.: Manipulation planning with probabilistic roadmaps. The International Journal of Robotics Research 23, 729–746 (2004)
Cambon, S., Gravot, F., Alami, R.: A robot task planner that merges symbolic and geometric reasoning. In: Proc. of ECAI, pp. 895–899 (2004)
Fabien Gravot, S.C., Alami, R.: aSyMov: A planner that deals with intricate symbolic and geometric problems. Springer Tracts in Advanced Robotics 15 (2005)
Dornhege, C., Eyerich, P., Keller, T., Trüg, S., Brenner, M., Nebel, B.: Semantic attachments for domain-independent planning systems. In: Proc. of ICAPS (2009) (to appear)
LaValle, S.M.: Planning algorithms. Cambridge University Press, Cambridge (2006)
Rodriguez, S., Lien, J.M., Amato, N.: Planning motion in completely deformable environments. In: Proc. IEEE Int. Conf. on Robotics and Automation (ICRA), pp. 2466–2471 (2006)
Frank, B., Stachniss, C., Schmedding, R., Burgard, W., Teschner, M.: Real-world robot navigation amongst deformable obstacles. In: Proc. IEEE Int. Conf. on Robotics and Automation (ICRA), pp. 1649–1654 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gissler, M., Dornhege, C., Nebel, B., Teschner, M. (2009). Deformable Proximity Queries and Their Application in Mobile Manipulation Planning. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2009. Lecture Notes in Computer Science, vol 5875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10331-5_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-10331-5_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10330-8
Online ISBN: 978-3-642-10331-5
eBook Packages: Computer ScienceComputer Science (R0)