arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2012.12642cs.RO
收藏

通过在线拓扑和几何路径优化的自主室外扫描

Autonomous Outdoor Scanning via Online Topological and Geometric Path Optimization

Shenzhen University(深圳大学);National University of Defense Technology(国防科技大学)

Pengdi Huang, Liqiang Lin, Kai Xu, Hui Huang

摘要:

户外环境的自主3D采集带来了特殊的挑战。与室内场景不同,室内空间由清晰的边界和分隔(例如,墙壁和家具),户外环境是宽敞和无限的(想想校园)。因此,与扫描工作主要致力于发现边界表面的室内场景不同,扫描开放且无边界的区域需要主动地界定扫描区域的范围并动态地规划该区域内的遍历路径。因此,对于室外场景,我们制定了一个节能自主扫描的规划,通过机器人扫描路径的离散连续优化。离散优化通过求解在线旅行销售问题(Online TSP)来计算拓扑图,从而动态地确定扫描目标和路径。动态目标被确定为一个具有高回报的访问站点的集合。通过连接访问站点和按遍历代价加权的边,构造访问图。这个拓扑地图随着机器人的扫描而演变,通过删除过时的网站,这些网站要么被访问,要么变得没有回报,并插入新发现的网站。连续部分通过最大化沿路径扫描的信息增益,对相邻两个访问点之间的遍历路径进行几何优化。离散和连续过程交替进行,直到当前图的遍历成本超过机器人的剩余能量容量。我们的方法进行了评估与合成和现场测试,证明其有效性和优势的替代品。该项目位于http://vcc.szu.edu.cn/research/2020/Husky,代码可在https://github.com/alualu628628/Autonomous-Outdoor-Scanning-via-Online-Topological-and-Geometric-Path-Optimization上获取。

英文摘要:

Autonomous 3D acquisition of outdoor environments poses special challenges. Different from indoor scenes, where the room space is delineated by clear boundaries and separations (e.g., walls and furniture), an outdoor environment is spacious and unbounded (thinking of a campus). Therefore, unlike for indoor scenes where the scanning effort is mainly devoted to the discovery of boundary surfaces, scanning an open and unbounded area requires actively delimiting the extent of scanning region and dynamically planning a traverse path within that region. Thus, for outdoor scenes, we formulate the planning of an energy-efficient autonomous scanning through a discrete-continuous optimization of robot scanning paths. The discrete optimization computes a topological map, through solving an online traveling sales problem (Online TSP), which determines the scanning goals and paths on-the-fly. The dynamic goals are determined as a collection of visit sites with high reward of visibility-to-unknown. A visit graph is constructed via connecting the visit sites with edges weighted by traversing cost. This topological map evolves as the robot scans via deleting outdated sites that are either visited or become rewardless and inserting newly discovered ones. The continuous part optimizes the traverse paths geometrically between two neighboring visit sites via maximizing the information gain of scanning along the paths. The discrete and continuous processes alternate until the traverse cost of the current graph exceeds the remaining energy capacity of the robot. Our approach is evaluated with both synthetic and field tests, demonstrating its effectiveness and advantages over alternatives. The project is at http://vcc.szu.edu.cn/research/2020/Husky, and the codes are available at https://github.com/alualu628628/Autonomous-Outdoor-Scanning-via-Online-Topological-and-Geometric-Path-Optimization.

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

↑