arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2307.07059cs.AI
收藏

基于顶点的网络以加速路径规划算法

Vertex-based Networks to Accelerate Path Planning Algorithms

Ohio University(俄亥俄大学)

Yuanhang Zhang, Jundong Liu

AI总结:

本文提出用基于顶点的网络改进 RRT* 的采样,借助 focal loss 与掩码配置处理不平衡和性能权衡,在随机楼层地图上将速度较基线提升逾 400%。

摘要:

路径规划在各类自主应用中发挥着关键作用,而 RRT* 是该领域的领先解决方案之一。本文提出利用基于顶点的网络来增强 RRT* 的采样过程,从而实现更高效的路径规划。该方法聚焦于最优路径上的关键顶点,这些顶点提供了路径的必要但更稀疏的抽象。作者采用 focal loss 来解决相关的数据不平衡问题,并探索不同的掩码配置以确定系统性能中的实际权衡。通过在随机生成的楼层地图上进行的实验,所提解决方案展现出显著的速度提升,与基线模型相比实现了超过 400% 的增强。

英文摘要:

Path planning plays a crucial role in various autonomy applications, and RRT* is one of the leading solutions in this field. In this paper, we propose the utilization of vertex-based networks to enhance the sampling process of RRT*, leading to more efficient path planning. Our approach focuses on critical vertices along the optimal paths, which provide essential yet sparser abstractions of the paths. We employ focal loss to address the associated data imbalance issue, and explore different masking configurations to determine practical tradeoffs in system performance. Through experiments conducted on randomly generated floor maps, our solutions demonstrate significant speed improvements, achieving over a 400% enhancement compared to the baseline model.

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

↑