arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.01435cs.CVcs.RO
收藏

一种新的基于聚类的无人机建筑巡检视点规划方法

A New Clustering-based View Planning Method for Building Inspection with Drone

School of Control Science and Engineering, Shandong University(山东大学控制科学与工程学院)

Yongshuai Zheng, Guoliang Liu, Yan Ding, Guohui Tian

AI总结:

本文提出一种基于聚类的两步视点规划方法,结合谱聚类、局部势场法和超启发式算法求解建筑表面覆盖问题,在减少视点数量的同时提高覆盖率。

摘要:

随着无人机技术的快速发展,配备视觉传感器的无人机在建筑巡检与监控中的应用引起了广泛关注。视点规划旨在为视觉相关任务寻找一组近最优视点,以实现视觉覆盖目标。本文提出了一种新的基于聚类的两步计算方法,该方法结合谱聚类、局部势场法和超启发式算法,以寻找近最优视点来覆盖目标建筑表面。在第一步中,所提方法基于谱聚类生成候选视点,并基于我们新提出的局部势场法对候选视点位置进行修正。在第二步中,该优化问题被转化为集合覆盖问题(Set Covering Problem,SCP),并使用我们提出的超启发式算法求解最优视点子集。实验结果表明,所提方法能够以更少的视点获得更好的解,并实现更高的覆盖率。

英文摘要:

With the rapid development of drone technology, the application of drones equipped with visual sensors for building inspection and surveillance has attracted much attention. View planning aims to find a set of near-optimal viewpoints for vision-related tasks to achieve the vision coverage goal. This paper proposes a new clustering-based two-step computational method using spectral clustering, local potential field method, and hyper-heuristic algorithm to find near-optimal views to cover the target building surface. In the first step, the proposed method generates candidate viewpoints based on spectral clustering and corrects the positions of candidate viewpoints based on our newly proposed local potential field method. In the second step, the optimization problem is converted into a Set Covering Problem (SCP), and the optimal viewpoint subset is solved using our proposed hyper-heuristic algorithm. Experimental results show that the proposed method is able to obtain better solutions with fewer viewpoints and higher coverage.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑