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


METADATA ONLY
Loading...

Date

2023

Publication Type

Conference Paper

ETH Bibliography

yes

Citations

Altmetric
METADATA ONLY

Data

Rights / License

Abstract

We address multi-robot safe mission planning in uncertain dynamic environments. This problem arises in safety-critical exploration, surveillance, and emergency rescue missions. The multi-robot optimal control problem is challenging because of the dynamic uncertainties and the exponentially increasing problem size with the number of robots. Leveraging recent works obtaining a tractable safety maximizing plan for a single robot, we propose a scalable two-stage framework. Specifically, the problem is split into a low-level single-agent 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 forward and reverse greedy heuristics and in a distributed auction-based manner. Properties of our safety objective enable provable performance bounds on the safety of the approximate solutions of the two heuristics.

Publication status

published

Editor

Book title

2023 European Control Conference (ECC)

Journal / series

Volume

Pages / Article No.

10178126

Publisher

IEEE

Event

21st European Control Conference (ECC 2023)

Edition / version

Methods

Software

Geographic location

Date collected

Date created

Subject

stochastic reachability; optimal control; task allocation; greedy algorithms; multi-robot systems

Organisational unit

Notes

Funding

Related publications and datasets