Enhancing GJK: Computing minimum and penetration distances between convex polyhedra

被引：0
|
作者：
Cameron, S
机构：
来源：
1997 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION - PROCEEDINGS, VOLS 1-4 | 1997年
关键词：
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
The problem of tracking the distance between two convex polyhedra is finding applications in many areas of robotics, including intersection detection, collision detection, and path planning. We present new results that confirm an almost-constant time complexity for an enhanced version of Gilbert, Johnson and Keerthi's algorithm, and also describe modifications to the algorithm to compute measures of penetration distance.
引用
收藏
页码：3112 / 3117
页数：6
相关论文
共 50 条
  • [31] Computing rotation distance between contacting polyhedra
    Xiao, J
    Zhang, LX
    1996 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, PROCEEDINGS, VOLS 1-4, 1996, : 791 - 797
  • [32] Fast convex minimization to detect collisions between polyhedra
    Mirolo, C
    Pagello, E
    2000 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2000), VOLS 1-3, PROCEEDINGS, 2000, : 1605 - 1610
  • [33] Extremal distances between sections of convex bodies
    Rudelson, M
    GEOMETRIC AND FUNCTIONAL ANALYSIS, 2004, 14 (05) : 1063 - 1088
  • [34] Computing the minimum distances of linear codes by the error impulse method
    Berrou, C
    Vaton, S
    ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 5 - 5
  • [35] Extremal Distances between Sections of Convex Bodies
    M. Rudelson
    Geometric & Functional Analysis GAFA, 2004, 14 : 1063 - 1088
  • [36] Computing similarity distances between rankings
    , Farzad Farnoud
    Milenkovic, Olgica
    Puleo, Gregory J.
    Su, Lili
    DISCRETE APPLIED MATHEMATICS, 2017, 232 : 157 - 175
  • [37] Computing complexity distances between algorithms
    Romaguera, S
    Sánchez-Pérez, EA
    Valero, O
    KYBERNETIKA, 2003, 39 (05) : 569 - 582
  • [38] Computing Distances between Reach Flowpipes
    Majumdar, Rupak
    Prabhu, Vinayak S.
    HSCC'16: PROCEEDINGS OF THE 19TH INTERNATIONAL CONFERENCE ON HYBRID SYSTEMS: COMPUTATION AND CONTROL, 2016, : 267 - 276
  • [39] Computing distances between partial rankings
    Bansal, Mukul S.
    Fernandez-Baca, David
    INFORMATION PROCESSING LETTERS, 2009, 109 (04) : 238 - 241
  • [40] A DIRECT MINIMIZATION APPROACH FOR OBTAINING THE DISTANCE BETWEEN CONVEX POLYHEDRA
    BOBROW, JE
    INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 1989, 8 (03): : 65 - 76
12345