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

Multi-robot task allocation for safe planning against stochastic hazard dynamics

ETH Zürich(苏黎世联邦理工学院);ABB Corporate Research(ABB企业研究院);EPFL(洛桑联邦理工学院)

Daniel Tihanyi, Yimeng Lu, Orcun Karaca, Maryam Kamgarpour

英文摘要:

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in several applications including safety-critical exploration, surveillance, and emergency rescue missions. Computation of a multi-robot optimal control policy is challenging not only because of the complexity of incorporating dynamic uncertainties while planning, but also because of the exponential growth in problem size as a function of number of robots. Leveraging recent works obtaining a tractable safety maximizing plan for a single robot, we propose a scalable two-stage framework to solve the problem at hand. Specifically, the problem is split into a low-level single-agent control problem and a high-level task allocation problem. The low-level problem uses an efficient approximation of stochastic reachability for a Markov decision process to derive the optimal control policy under dynamic uncertainty. The task allocation is solved using polynomial-time forward and reverse greedy heuristics and in a distributed auction-based manner. By leveraging the properties of our safety objective function, we provide provable performance bounds on the safety of the approximate solutions proposed by these two heuristics. We evaluate the theory with extensive numerical case studies.

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

↑