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

增量分辨率符号感知下的能量约束主动探索

Energy-Constrained Active Exploration Under Incremental-Resolution Symbolic Perception

Lehigh University(理海大学);Eindhoven University of Technology(埃因霍温理工大学)

Disha Kamale, Sofie Haesaert, Cristian-Ioan Vasile

AI总结:

本文研究固定能量预算下基于增量分辨率符号感知的自主目标搜寻问题,提出一种结合自动机和MILP技术的决策框架,通过离线构建乘积图转化为奖励最大化问题并在线求解,有效实现了中等规模网格环境中的高效在线规划。

摘要:

在这项工作中,我们考虑了在遵守固定能量预算的前提下,自主探索以搜寻目标的问题。机器人配备了一个增量分辨率符号感知模块,其中对环境中目标的感知会随着机器人与目标距离的减小而改善。我们假设没有关于目标总数、它们的位置以及它们在环境中可能分布的先验信息。这项工作针对由此产生的受约束序贯决策问题,提出了一种新颖的决策框架,首先将其转化为在离线计算的乘积图上的奖励最大化问题。然后将其作为混合整数线性规划(MILP)在线求解,其中每一步都会更新关于环境的知识,结合了基于自动机和基于MILP的技术。我们通过案例研究展示了该方法的有效性,并从预期遗憾的角度进行了实证评估。此外,运行时性能表明,对于中等规模的网格环境,可以高效地进行在线规划。

英文摘要:

In this work, we consider the problem of autonomous exploration in search of targets while respecting a fixed energy budget. The robot is equipped with an incremental-resolution symbolic perception module wherein the perception of targets in the environment improves as the robot's distance from targets decreases. We assume no prior information about the total number of targets, their locations as well as their possible distribution within the environment. This work proposes a novel decision-making framework for the resulting constrained sequential decision-making problem by first converting it into a reward maximization problem on a product graph computed offline. It is then solved online as a Mixed-Integer Linear Program (MILP) where the knowledge about the environment is updated at each step, combining automata-based and MILP-based techniques. We demonstrate the efficacy of our approach with the help of a case study and present empirical evaluation in terms of expected regret. Furthermore, the runtime performance shows that online planning can be efficiently performed for moderately-sized grid environments.

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

↑