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

面向在线路径规划的通信感知地图压缩

Communication-Aware Map Compression for Online Path-Planning

Georgia Institute of Technology(佐治亚理工学院);University of North Carolina at Charlotte(北卡罗来纳大学夏洛特分校)

Evangelos Psomiadis, Dipankar Maity, Panagiotis Tsiotras

AI总结:

针对移动机器人在线路径规划中的地图信息通信问题,提出由路径引导、权衡分辨率与通信成本的顺序压缩框架,并通过凸优化解码器和编码器实现约50%的平均信息减量。

摘要:

本文解决用于移动机器人路径规划的最优压缩信息通信问题。在此背景下,移动机器人压缩其当前局部地图,以协助另一台机器人在未知环境中到达目标。我们提出一个框架,该框架以机器人的路径为引导,通过权衡地图分辨率与通信成本,顺序选择最优压缩方式。我们的方法在接近真实的场景中具有可处理性,并且不需要先验环境知识。我们设计了一种新颖的解码器,该解码器利用压缩信息,通过带线性约束的凸优化来估计未知环境;同时设计了一个编码器,利用该解码器选择最优压缩。数值仿真在一张大型接近真实地图和一张迷宫地图中进行,并与两种替代方法进行比较。结果证实了我们框架在协助机器人到达目标方面的有效性:在保持令人满意性能的同时,传输的信息量平均减少约50%。

英文摘要:

This paper addresses the problem of the communication of optimally compressed information for mobile robot path-planning. In this context, mobile robots compress their current local maps to assist another robot in reaching a target in an unknown environment. We propose a framework that sequentially selects the optimal compression, guided by the robot's path, by balancing the map resolution and communication cost. Our approach is tractable in close-to-real scenarios and does not necessitate prior environment knowledge. We design a novel decoder that leverages compressed information to estimate the unknown environment via convex optimization with linear constraints and an encoder that utilizes the decoder to select the optimal compression. Numerical simulations are conducted in a large close-to-real map and a maze map and compared with two alternative approaches. The results confirm the effectiveness of our framework in assisting the robot reach its target by reducing transmitted information, on average, by approximately 50% while maintaining satisfactory performance.

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

↑