让机器人在弱网环境下可靠执行云端任务,通过智能选点请求避免中断。
Communication-Aware Robot Execution for Cloud Inference under Spatially Heterogeneous Connectivity

- 基于通信窗口动态选择最优请求位置,平衡任务进度与网络质量。
- 实验显示成功率最高,请求失败率降低40%,平均请求次数减少30%。
- 适合无线环境复杂、依赖云端推理的移动机器人部署场景。
云端基础模型使机器人突破本地算力限制,实现语义推理。在此场景下,机器人执行云端生成的当前动作基元,任务继续需在基元耗尽前获得下一结果。但在空间异质性网络条件下,当前基元决定下一结果所需时间,而无线环境决定请求提交与响应获取的位置。现有降低延迟或优化单次传输的策略无法确保请求位置既具备可靠上传条件,又留有可行的响应接收机会。为此,本文提出请求-响应窗口,量化下一云周期所需时间(包括上行传输、云端推理、下行获取及推理不确定性)。结合可用通信地图,该框架将下一请求点视为执行过程中的运动决策,选择能保证足够通信质量的提交位置,同时维持当前基元的有限支持范围。选定请求点被整合进局部规划器,引导机器人在提交前抵达该点,并在等待响应时保持足够的连接以获取后续结果。在实测的室内无线场景中,本方法在对比方法中取得最佳或并列最佳的任务成功率,请求尝试次数更少,请求失败率更低。
原文摘要 · Abstract (English)
Cloud-hosted foundation models enable robots to use semantic reasoning beyond onboard computational limits. In this setting, the robot executes a currently available primitive generated by the cloud, and continued task progress requires the next cloud result before this primitive is exhausted. This execution becomes fragile under spatially heterogeneous connectivity, because the current primitive determines when the next result is needed, whereas the wireless environment determines where the next request can be submitted and where the response can be retrieved. Strategies that reduce latency or improve individual transmissions can shorten this dependency, but they do not determine a submission location that supports reliable upload and leaves a feasible opportunity for response retrieval. To address this problem, we introduce the request--response window, which characterizes the time required for the next cloud cycle, including uplink transmission, cloud inference, downlink retrieval, and inference uncertainty. Building on this window and an available communication map, the proposed framework treats the next request point as a motion decision during ongoing primitive execution, selecting it to provide sufficient communication quality for cloud request submission while preserving progress within the finite support of the current primitive. The selected request point is incorporated into a local planner, which guides the robot toward the request point before submission and then continues task execution while maintaining sufficient connectivity for retrieving the next cloud result. Experiments in an indoor wireless scenario built from measurements show that the proposed method achieves the best or tied-best task success among the compared methods, while using fewer request attempts and producing lower request failure rates.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。