Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 김영준 | * |
dc.date.accessioned | 2016-11-30T02:11:30Z | - |
dc.date.available | 2016-11-30T02:11:30Z | - |
dc.date.issued | 2008 | * |
dc.identifier.issn | 0278-3649 | * |
dc.identifier.other | OAK-5226 | * |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/232907 | - |
dc.description.abstract | We present a simple algorithm to check for path non-existence for a low-degree-of-freedom (DOF) robot among static obstacles. Our algorithm is based on approximate cell decomposition of configuration space or C-space. We use C-obstacle cell query to check whether a cell lies entirely inside the C-obstacle region. This reduces the path non-existence problem to checking whether a path exists through the set of all cells that do not lie entirely inside the C-obstacle region. We present a simple and efficient algorithm to perform C-obstacle cell query using generalized penetration depth computation. Our algorithm is simple to implement and we demonstrate its performance on three-DOF and four-DOF robots. © 2008 SAGE Publications. | * |
dc.language | English | * |
dc.title | Efficient cell labelling and path non-existence computation using C-obstacle query | * |
dc.type | Conference Paper | * |
dc.relation.issue | 41590 | * |
dc.relation.volume | 27 | * |
dc.relation.index | SCI | * |
dc.relation.index | SCIE | * |
dc.relation.index | SCOPUS | * |
dc.relation.startpage | 1246 | * |
dc.relation.lastpage | 1257 | * |
dc.relation.journaltitle | International Journal of Robotics Research | * |
dc.identifier.doi | 10.1177/0278364908099216 | * |
dc.identifier.wosid | WOS:000261095700006 | * |
dc.identifier.scopusid | 2-s2.0-57249105452 | * |
dc.author.google | Zhang L. | * |
dc.author.google | Kim Y.J. | * |
dc.author.google | Manocha D. | * |
dc.contributor.scopusid | 김영준(56223507100) | * |
dc.date.modifydate | 20240322133440 | * |