Pseudo minimum translational distance between convex polyhedra(I) - Definition and properties

被引：0
|
作者：
Zhu, XY [2 ]
Ding, H
Xiong, YL
机构：
[1] Huazhong Univ Sci & Technol, Sch Mech Sci & Engn, Wuhan 430074, Peoples R China
[2] Southeast Univ, Dept Mech Engn, Nanjing 210096, Peoples R China
来源：
SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES | 2001年 / 44卷 / 02期
关键词：
pseudo minimum translational distance; convex polyhedra; differentiability;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
Based on the concept of gauge function, the pseudo minimum translational distance (PMTD) between two convex objects is defined in this paper. PMTD not only provides a measure of the clearance between two separating objects, but also quantifies the penetration of two objects intersecting each other. It is proved that the PMTD is differentiable almost everywhere w.r.t. the configuration variable of the objects. Algorithms for calculating PMTD and its derivative are also presented.
引用
收藏
页码：216 / U2
页数：11
相关论文
共 30 条
  • [1] Pseudo minimum translational distance between convex polyhedra (I)Definition and properties
    Zhu Xiangyang
    Ding Han
    Xiong Youlun
    [J]. Science in China Series E: Technolgical Science, 2001, 44 (2): : 216 - 224
  • [2] Pseudo minimum translational distance between convex polyhedra(Ⅰ)——Definition and properties
    朱向阳
    丁汉
    熊有伦
    [J]. Science China Technological Sciences, 2001, (02) : 216 - 224
  • [3] Pseudo minimum translational distance between convex polyhedra (Ⅱ)——Robot collision-free path planning
    朱向阳
    丁汉
    熊有伦
    [J]. Science China Technological Sciences, 2001, (04) : 337 - 344
  • [4] Pseudo minimum translational distance between convex polyhedra (II) - Robot collision-free path planning
    Zhu, XY
    Ding, H
    Xiong, YL
    [J]. SCIENCE IN CHINA SERIES E-TECHNOLOGICAL SCIENCES, 2001, 44 (04): : 337 - 344
  • [5] Pseudo minimum translational distance between convex polyhedra (II)Robot collision-free path planning
    Xiangyang Zhu
    Han Ding
    Youlun Xiong
    [J]. Science in China Series E: Technological Sciences, 2001, 44 : 337 - 344
  • [6] Minimum distance between the faces of two convex polyhedra: A sufficient condition
    Llanas, B
    De Sevilla, MF
    Feliu, V
    [J]. JOURNAL OF GLOBAL OPTIMIZATION, 2003, 26 (04) : 361 - 385
  • [7] Minimum Distance Between the Faces of Two Convex Polyhedra: A Sufficient Condition
    B. Llanas
    M. Fernandez De Sevilla
    V. Feliu
    [J]. Journal of Global Optimization, 2003, 26 : 361 - 385
  • [8] Estimate of minimum distance between convex polyhedra based on enclosed ellipsoids
    Shiang, SP
    Liu, JS
    Chien, YR
    [J]. 2000 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2000), VOLS 1-3, PROCEEDINGS, 2000, : 739 - 744
  • [9] An algorithm on collision detection by computing the minimum distance between two convex polyhedra
    Jin, Hanjun
    Wang, Yanlin
    Wang, Xiaorong
    Fu, Jia
    [J]. WCICA 2006: SIXTH WORLD CONGRESS ON INTELLIGENT CONTROL AND AUTOMATION, VOLS 1-12, CONFERENCE PROCEEDINGS, 2006, : 304 - 304
  • [10] Algorithm research for computing the minimum distance between two convex polyhedra in collision detection
    Jin, Hanjun
    Li, Zhaohui
    Wang, Yanlin
    Wang, Qiong
    [J]. Wuhan Ligong Daxue Xuebao (Jiaotong Kexue Yu Gongcheng Ban)/Journal of Wuhan University of Technology (Transportation Science and Engineering), 2006, 30 (02): : 300 - 302
123