.png){kind=icon}
返回
Efficient Cell Labelling and Path Non-existence Computation using C-obstacle Query
.png){kind=icon}
PRE
AI
DOI：10.1177/0278364908099216.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
f 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.
Keyword:
Cell decomposition
cell labelling
penetration depth
path non-existence
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
2.4K
被引数:
1.5W
机构
引用论文
A survey of global configuration-space mapping techniques for a single robot in a static environment
PREAI
分享收藏
Fuzzy-controlled Localized Route-repair (FLRR) for On-demand Routing Protocols in Mobile Ad hoc Networks移动自组织网络中按需路由协议的模糊控制本地化路由修复 (FLRR)
OAAI
OAAI分享收藏分享收藏Application of ATR-FTIR spectroscopy in quantitative analysis of deuterium in basic solutions.png)
AnalusisOAAI
AnalusisIF0
OAAI分享收藏
查看更多内容