Visibility-based multi-agent deployment in orthogonal environments

  • Ganguli A
  • Cortés J
  • Bullo F
  • 21


    Mendeley users who have this article in their library.
  • 27


    Citations of this article.


This paper presents algorithms for the deployment of
mobile agents with line-of-sight sensing and
communication capabilities in simply connected orthogonal
environments. A simply connected orthogonal environment
is a polygon without holes whose sides are either
parallel or perpendicular to each other. The main
objective is to achieve full visibility of the
environment. The agents are assumed to have access to a
local memory and their operation is partially
asynchronous. We propose methods based on incrementally
partitioning the environment while deploying the
agents. Novel contributions of this work include the
design of distributed algorithms to achieve the following
tasks: (i) complete coverage of simply connected
orthogonal environments; and (ii) complete coverage of
simply connected orthogonal environments such that the
final configuration of agents forms a network connected
via line-of-sight. In each case, we prove the remarkable
fact that the number of agents sufficient to complete the
task with the proposed algorithms are identical to the
ones obtained if the entire environment was known a
priori. A final contribution of the paper is the
characterization of the robustness properties of the
algorithms to agent failures in the case of deployment
with connectivity constraints.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Get full text


  • Anurag Ganguli

  • Jorge Cortés

  • Francesco Bullo

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free