返回
A Triangulation-Based Coverage Path Planning
DOI:10.1109/TSMC.2018.2806840.png)
摘要
En 中文
In this paper, we present an approach to local coverage path (CP) planning for a circular mobile sensor. Our family of algorithms provides completed and overlapped coverage control, curvature and path length control, localization, choice of observer's placement based on sensing range, and first-order differentiable CP. Our family of algorithms begins by partitioning the target region (TR) into several regular triangulations (RTs). Based on the size of the RT and the sensing range, the number and location of observers are determined for all RT. All observers found are then used as waypoints (WPs) to generate baseline CP with the Traveling Salesman Problem's nearest neighbor algorithm. The proposed algorithm solved the problems of how to design a differentiable and collision-free CP for all sensing range, limited and sufficient, while providing completed coverage control, overlapped coverage control, curvature and path length control, localization, collision avoidance, and the choice of observer's placement based on sensing range and the environment. The main technical contributions of the proposed approach is to provide a holistic solution that segments any TR, uses triangulation to determine the observation WPs and then compute the smooth and collision-free CP. Computer simulations are provided to validate the effectiveness and correctness of our algorithms.
Keyword:
Robot sensing systems
Observers
Planning
Partitioning algorithms
Collision avoidance
Half-plane
internal and external tangent
nonholonomic
triangulation
visible polygon (VP)
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Nano-sized LaMnO3 powders prepared by spray pyrolysis from spray solution containing citric acid从含柠檬酸的喷雾溶液中通过喷雾热解制备纳米LaMnO3粉末
A new approach to functionalize multi-walled carbon nanotubes by the use of functional polymers
Polymer
IF0


