arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2003.10492cs.ROmath.OC
收藏

多机器人协调的风险感知子模块优化

Risk-Aware Submodular Optimization for Multi-Robot Coordination

Virginia Tech(弗吉尼亚理工大学);University of Pennsylvania(宾夕法尼亚大学);University of Maryland(马里兰大学)

Lifeng Zhou, Pratap Tokekar

摘要:

研究了在不确定性条件下进行组合决策时引入风险的问题。我们制定了一个离散的子模块最大化问题,选择一组使用条件风险价值(CVaR),金融分析中常用的风险度量。虽然CVaR最近已被用于机器人的线性成本函数的优化,我们采取的第一步扩展到离散子模块优化,并提供了一些积极的结果。具体来说,我们提出了顺序贪心算法,提供了一个近似保证找到最大值的CVaR成本函数下的拟阵约束。近似保证表明,我们的算法所产生的解决方案是在一个恒定的因素的最佳和一个附加项,取决于最佳。我们的分析使用了次模集函数的曲率,并证明了该算法在多项式时间内运行。这公式化了许多出现在机器人学中的组合优化问题。我们使用两个这样的问题,车辆分配的不确定性下的机动性按需和传感器的选择与失败的环境监测,作为案例研究,以证明我们的配方的功效。特别是,对于按需移动性的研究,我们提出了一个在线触发分配算法,触发一个新的分配只可能导致减少在需求位置的等待时间。通过仿真验证了序贯贪心算法和在线触发分配算法的性能。

英文摘要:

We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using Conditional-Value-at-Risk (CVaR), a risk metric commonly used in financial analysis. While CVaR has recently been used in optimization of linear cost functions in robotics, we take the first step towards extending this to discrete submodular optimization and provide several positive results. Specifically, we propose the Sequential Greedy Algorithm that provides an approximation guarantee on finding the maxima of the CVaR cost function under a matroidal constraint. The approximation guarantee shows that the solution produced by our algorithm is within a constant factor of the optimal and an additive term that depends on the optimal. Our analysis uses the curvature of the submodular set function, and proves that the algorithm runs in polynomial time. This formulates a number of combinatorial optimization problems that appear in robotics. We use two such problems, vehicle assignment under uncertainty for mobility-on-demand and sensor selection with failures for environmental monitoring, as case studies to demonstrate the efficacy of our formulation. In particular, for the mobility-on-demand study, we propose an online triggering assignment algorithm that triggers a new assignment only can potentially lead to reducing the waiting time at demand locations. We verify the performance of the Sequential Greedy Algorithm and the online triggering assignment algorithm through simulations.

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

↑