Deep and Decentralized Multi-Agent Coverage of a Target with Unknown Distribution
This paper proposes a new architecture for multi-agent systems to cover an unknowingly distributed fast, safely, and decentralizedly. The inter-agent communication is organized by a directed graph with fixed topology, and we model agent coordination as a decentralized leader-follower problem with time-varying communication weights. Given this problem setting, we first present a method for converting communication graph into a neural network, where an agent can be represented by a unique node of the communication graph but multiple neurons of the corresponding neural network. We then apply a mass-cetric strategy to train time-varying communication weights of the neural network in a decentralized fashion which in turn implies that the observation zone of every follower agent is independently assigned by the follower based on positions of in-neighbors. By training the neural network, we can ensure safe and decentralized multi-agent coordination of coverage control. Despite the target is unknown to the agent team, we provide a proof for convergence of the proposed multi-agent coverage method.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On Mobile Ad Hoc Networks for Coverage of Partially Observable Worlds
This paper addresses the movement and placement of mobile agents to establish a communication network in initially unknown environments. We cast the problem in a computational-geometric framework by relating the coverage…
Decentralized Reinforcement Learning for Multi-Target Search and Detection by a Team of Drones
Targets search and detection encompasses a variety of decision problems such as coverage, surveillance, search, observing and pursuit-evasion along with others. In this paper we develop a multi-agent deep reinforcement l…
Deep Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)A Spatially Informed Gaussian Process UCB Method for Decentralized Coverage Control
We present a novel decentralized algorithm for coverage control in unknown spatial environments modeled by Gaussian Processes (GPs). To trade-off between exploration and exploitation, each agent autonomously determines i…
Gaussian ProcessesDecentralized Gaussian Filters for Cooperative Self-localization and Multi-target Tracking
Scalable and decentralized algorithms for Cooperative Self-localization (CS) of agents, and Multi-Target Tracking (MTT) are important in many applications. In this work, we address the problem of Simultaneous Cooperative…
Heterogeneous Multi-Agent Reinforcement Learning for Unknown Environment Mapping
Reinforcement learning in heterogeneous multi-agent scenarios is important for real-world applications but presents challenges beyond those seen in homogeneous settings and simple benchmarks. In this work, we present an …
Multi-agent Reinforcement Learningreinforcement-learningReinforcement LearningReinforcement Learning (RL)+1