Sciweavers

4865 search results - page 148 / 973
» The Complexity of Graph Connectivity
Sort
View
CDC
2008
IEEE
116views Control Systems» more  CDC 2008»
14 years 5 months ago
Effective sensing regions and connectivity of agents undergoing periodic relative motions
— Time-varying graphs are widely used to model communication and sensing in multi-agent systems such as mobile sensor networks and dynamic animal groups. Connectivity is often de...
Daniel T. Swain, Ming Cao, Naomi Ehrich Leonard
ICRA
2008
IEEE
135views Robotics» more  ICRA 2008»
14 years 5 months ago
Decentralized connectivity maintenance in mobile networks with bounded inputs
Abstract— A distributed control law that guarantees connectivity maintenance in a network of multiple mobile agents is presented. The control law respects the limited sensing cap...
Dimos V. Dimarogonas, Karl Henrik Johansson
DSN
2002
IEEE
14 years 3 months ago
An Evaluation of Connectivity in Mobile Wireless Ad Hoc Networks
We consider the following problem for wireless ad hoc networks: assume n nodes, each capable of communicating with nodes within a radius of r, are distributed in a ddimensional re...
Paolo Santi, Douglas M. Blough
ICML
2007
IEEE
14 years 11 months ago
Constructing basis functions from directed graphs for value function approximation
Basis functions derived from an undirected graph connecting nearby samples from a Markov decision process (MDP) have proven useful for approximating value functions. The success o...
Jeffrey Johns, Sridhar Mahadevan
CORR
2010
Springer
143views Education» more  CORR 2010»
13 years 11 months ago
Continuum Percolation in the Intrinsically Secure Communications Graph
The intrinsically secure communications graph (-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence...
Pedro C. Pinto, Moe Z. Win