Potential Fields for Maintaining Connectivity of Mobile Networks

By Michael M. Zavlanos, George Pappas. 2007

372 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Mechanical Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

In Mechanical Engineering

Citations in the corpus

An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination (2012, background): “The main approach to maintaining the connectivity of a team o f agents is to define some artificial potentials (between any pair of agents) in a proper way such t hat if two agents are neighbors initially then they will always communicate with each other thereafte r [206], [219]–[228].”
Heterophilious Dynamics Enhances Consensus (2013, background): “We mention in passing the scenario of “extreme heterophily” advocated in [71, 113, 112], where distributed coordination is governed by a local influence function φ(·) which grows to infinity as it approaches the right edge of its support, in order to create an energy barrier which enforces connectiv”
Hybrid Control for Connectivity Preserving Flocking (2009, background): “In [7], network connectivity is maintained by means of potential fields that guarantee positive definiteness of the second smallest eigenvalue of the graph Laplacian matrix, while in [8] a measure of local connectedness of a network is introduced that under certain conditions is sufficient for globa”
Distributed connectivity control of mobile networks (2007, background): “Unlike centralized [4], [15], [16], or distributed open loop [5], [6] approaches to the problem, we propose a distributed feedback control framework based on a novel control decomposition.”
Decentralized estimation and control of graph connectivity in mobile sensor networks (2008, background): “The second approach in [20], [21] uses global connectivity measures such as algebraic connectivity [5].”
Graph-theoretic connectivity control of mobile robot networks (2011, methodology): “The authors of [43] conclude by providing a closed form expression for the controller in Proposition 4.”