Continuous signed distance computation for polygonal robots in 3D

Youngeun Lee, Abderrahmane Kheddar, Young J. Kim

Research output: Contribution to journalConference articlepeer-review

1 Scopus citations

Abstract

We propose a novel method adaptive subdivision (AS) to evaluate the distance function for moving general polygonal models. The distance function can have a positive and a negative value, each of which corresponds to the Euclidean distance and penetration depth, respectively. In our approach, the distance between a pair of objects can be evaluated along any time interval of the object's trajectory; therefore it is called continuous, and a minimum of the continuous distance (MCD) is determined for collision avoidance. In order to compute a MCD for general polygonal models, we calculate the upper and lower bounds of the distance in the time interval and abandons the time intervals that cannot realize the MCD. We have implemented our distance evaluation method, and have experimentally validated the proposed methods to effectively and accurately find the MCDs to generate a collision-free motion for the HRP-2 humanoid robot.

Original languageEnglish
Article number8975893
Pages (from-to)5944-5950
Number of pages7
JournalProceedings - IEEE International Conference on Robotics and Automation
Volume2019-January
DOIs
StatePublished - 2019
Event2019 International Conference on Robotics and Automation, ICRA 2019 - Montreal, Canada
Duration: 20 May 201924 May 2019

Bibliographical note

Funding Information:
ACKNOWLEDGEMENT This project was supported by the National Research Foundation(NRF) in South Korea (2017R1A2B3012701).

Publisher Copyright:
© 2019 IEEE.

Fingerprint

Dive into the research topics of 'Continuous signed distance computation for polygonal robots in 3D'. Together they form a unique fingerprint.

Cite this