Abstract: We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event ...
Abstract— We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event ...
Aug 14, 2017 · Abstract— We consider the optimal coverage problem where a multi-agent network is deployed in an environment with.
This work first shows that the objective function is monotone submodular, a class of functions for which a simple greedy algorithm is known to be within ...
We consider optimal coverage problems for a multi-agent network aiming to maximize a joint event detection probability in an environment with obstacles. The ...
We consider the optimal coverage problem where a multi-agent network is deployed in an environment with obstacles to maximize a joint event detection ...
A Submodularity-Based Approach for Multi-Agent Optimal Coverage Problems Proc. of 56th IEEE Conference on Decision and Control, pp. 4082-4087, 2017.
We consider optimal coverage problems for a multi-agent network aiming to maximize a joint event detection probability in an environment with obstacles.
We consider optimal coverage problems for a multi-agent network aiming to maximize a joint event detection probability in an environment with obstacles.
People also ask
What is multi-agent optimization?
What is multi-agent approach?
A new performance bound that does not require any additional assumptions and is both practical and computationally inexpensive is proposed.