Cooperative Multi-agent Systems for the Multi-target -Coverage Problem
When multiple robots are required to collaborate in order to accomplish a specific task, they
need to be coordinated in order to operate efficiently. To allow for scalability and robustness …
need to be coordinated in order to operate efficiently. To allow for scalability and robustness …
[PDF][PDF] Modeling the Willingness to Interact in Cooperative Multi-robot Systems.
When multiple robots are required to collaborate in order to accomplish a specific task, they
need to be coordinated in order to operate efficiently. To allow for scalability and robustness …
need to be coordinated in order to operate efficiently. To allow for scalability and robustness …
A collective adaptive approach to decentralised k-coverage in multi-robot systems
We focus on the online multi-object k-coverage problem (OMOkC), where mobile robots are
required to sense a mobile target from k diverse points of view, coordinating themselves in a …
required to sense a mobile target from k diverse points of view, coordinating themselves in a …
Online multi-object k-coverage with mobile smart cameras
In this paper, we combine k-coverage with the Cooperative Multi-robot Observation of
Multiple Moving Targets problem, defining the new problem of online multi-object k …
Multiple Moving Targets problem, defining the new problem of online multi-object k …
Multi-agent coalition formation for distributed area coverage
K Cheng, P Dasgupta - … Workshops, CARE@ AI09 2009/CARE@ IAT10 …, 2011 - Springer
In the multi-robot area coverage problem, a group of mobile robots have to cover an initially
unknown environment using a sensor or coverage tool attached to each robot. Multi-robot …
unknown environment using a sensor or coverage tool attached to each robot. Multi-robot …
Exploiting submodularity to quantify near-optimality in multi-agent coverage problems
X Sun, CG Cassandras, X Meng - Automatica, 2019 - Elsevier
We consider optimal coverage problems for a multi-agent network aiming to maximize a joint
event detection probability in an environment with obstacles. The objective function of this …
event detection probability in an environment with obstacles. The objective function of this …
Distributed autonomy and trade‐offs in online multiobject k‐coverage
In this article, we explore the online multiobject k‐coverage problem in visual sensor
networks. This problem combines k‐coverage and the cooperative multirobot observation of …
networks. This problem combines k‐coverage and the cooperative multirobot observation of …
Weighted voting game based multi-robot team formation for distributed area coverage
K Cheng, P Dasgupta - Proceedings of the 3rd International Symposium …, 2010 - dl.acm.org
In the multi-robot area coverage problem, a group of mobile robots have to cover an initially
unknown environment using a sensor or coverage tool attached to each robot. Multi-robot …
unknown environment using a sensor or coverage tool attached to each robot. Multi-robot …
Collision Avoiding Max-Sum for Mobile Sensor Teams
Recent advances in technology have large teams of robots with limited computation skills
work together in order to achieve a common goal. Their personal actions need to contribute …
work together in order to achieve a common goal. Their personal actions need to contribute …
Multi-agent Cooperative Area Coverage: A Two-stage Planning Approach Based on Reinforcement Learning
G Yuan, J Xiao, J He, H Jia, Y Wang, Z Wang - Information Sciences, 2024 - Elsevier
Multi-agent area coverage aims to accomplish the complete traversal of the target area
through cooperation between agents. Focusing on the problems of low coverage efficiency …
through cooperation between agents. Focusing on the problems of low coverage efficiency …