Saved in:
Bibliographic Details
Main Authors: Zhang, Runyu, Ma, Haitong, Li, Na
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2404.05995
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866914745875955712
author Zhang, Runyu
Ma, Haitong
Li, Na
author_facet Zhang, Runyu
Ma, Haitong
Li, Na
contents This paper studies the multi-agent coverage control (MAC) problem where agents must dynamically learn an unknown density function while performing coverage tasks. Unlike many current theoretical frameworks that concentrate solely on the regret occurring at specific targeted sensory locations, our approach additionally considers the regret caused by transient behavior - the path from one location and another. We propose the multi-agent coverage control with the doubling trick (MAC-DT) algorithm and demonstrate that it achieves (approximated) regret of $\widetilde{O}(\sqrt{T})$ even when accounting for the transient behavior. Our result is also supported by numerical experiments, showcasing that the proposed algorithm manages to match or even outperform the baseline algorithms in simulation environments. We also show how our algorithm can be modified to handle safety constraints and further implement the algorithm on a real-robotic testbed.
format Preprint
id arxiv_https___arxiv_org_abs_2404_05995
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Multi-Agent Coverage Control with Transient Behavior Consideration
Zhang, Runyu
Ma, Haitong
Li, Na
Optimization and Control
This paper studies the multi-agent coverage control (MAC) problem where agents must dynamically learn an unknown density function while performing coverage tasks. Unlike many current theoretical frameworks that concentrate solely on the regret occurring at specific targeted sensory locations, our approach additionally considers the regret caused by transient behavior - the path from one location and another. We propose the multi-agent coverage control with the doubling trick (MAC-DT) algorithm and demonstrate that it achieves (approximated) regret of $\widetilde{O}(\sqrt{T})$ even when accounting for the transient behavior. Our result is also supported by numerical experiments, showcasing that the proposed algorithm manages to match or even outperform the baseline algorithms in simulation environments. We also show how our algorithm can be modified to handle safety constraints and further implement the algorithm on a real-robotic testbed.
title Multi-Agent Coverage Control with Transient Behavior Consideration
topic Optimization and Control
url https://arxiv.org/abs/2404.05995