Results 1  10
of
1,159
Consensus Problems in Networks of Agents with Switching Topology and TimeDelays
, 2003
"... In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader ..."
Abstract

Cited by 1105 (20 self)
 Add to MetaCart
(Show Context)
In this paper, we discuss consensus problems for a network of dynamic agents with fixed and switching topologies. We analyze three cases: i) networks with switching topology and no timedelays, ii) networks with fixed topology and communication timedelays, and iii) maxconsensus problems (or leader determination) for groups of discretetime agents. In each case, we introduce a linear/nonlinear consensus protocol and provide convergence analysis for the proposed distributed algorithm. Moreover, we establish a connection between the Fiedler eigenvalue of the information flow in a network (i.e. algebraic connectivity of the network) and the negotiation speed (or performance) of the corresponding agreement protocol. It turns out that balanced digraphs play an important role in addressing averageconsensus problems. We introduce disagreement functions that play the role of Lyapunov functions in convergence analysis of consensus protocols. A distinctive feature of this work is to address consensus problems for networks with directed information flow. We provide analytical tools that rely on algebraic graph theory, matrix theory, and control theory. Simulations are provided that demonstrate the effectiveness of our theoretical results.
Flocking for MultiAgent Dynamic Systems: Algorithms and Theory
, 2006
"... In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in freespace and presence of multiple obstacles are considered. We present three flocking algorithms: two for freeflocking and one for constrained flocking. A compre ..."
Abstract

Cited by 432 (2 self)
 Add to MetaCart
In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in freespace and presence of multiple obstacles are considered. We present three flocking algorithms: two for freeflocking and one for constrained flocking. A comprehensive analysis of the first two algorithms is provided. We demonstrate the first algorithm embodies all three rules of Reynolds. This is a formal approach to extraction of interaction rules that lead to the emergence of collective behavior. We show that the first algorithm generically leads to regular fragmentation, whereas the second and third algorithms both lead to flocking. A systematic method is provided for construction of cost functions (or collective potentials) for flocking. These collective potentials penalize deviation from a class of latticeshape objects called αlattices. We use a multispecies framework for construction of collective potentials that consist of flockmembers, or αagents, and virtual agents associated with αagents called β and γagents. We show that migration of flocks can be performed using a peertopeer network of agents, i.e. “flocks need no leaders.” A “universal” definition of flocking for particle systems with similarities to Lyapunov stability is given. Several simulation results are provided that demonstrate performing 2D and 3D flocking, split/rejoin maneuver, and squeezing maneuver for hundreds of agents using the proposed algorithms.
On the Minimum Node Degree and Connectivity of a Wireless Multihop Network
 ACM MobiHoc
, 2002
"... This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform distri ..."
Abstract

Cited by 318 (4 self)
 Add to MetaCart
This paper investigates two fundamental characteristics of a wireless multihop network: its minimum node degree and its k–connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions — a random uniform distribution of the nodes and a simple link model — we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k–connected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a k–connected network. We also investigate these questions by various simulations and thereby verify our analytical expressions. Finally, the impact of mobility is discussed. The results of this paper are of practical value for researchers in this area, e.g., if they set the parameters in a network–level simulation of a mobile ad hoc network or if they design a wireless sensor network. Categories and Subject Descriptors C.2 [Computercommunication networks]: Network architecture and design—wireless communication, network communications, network topology; G.2.2 [Discrete mathematics]: Graph theory; F.2.2 [Probability and statistics]: Stochastic processes
Models of Random Regular Graphs
 IN SURVEYS IN COMBINATORICS
, 1999
"... In a previous paper we showed that a random 4regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random dregular g ..."
Abstract

Cited by 215 (33 self)
 Add to MetaCart
In a previous paper we showed that a random 4regular graph asymptotically almost surely (a.a.s.) has chromatic number 3. Here we extend the method to show that a random 6regular graph asymptotically almost surely (a.a.s.) has chromatic number 4 and that the chromatic number of a random dregular graph for other d between 5 and 10 inclusive is a.a.s. restricted to a range of two integer values: {3, 4} for d = 5, {4, 5} for d = 7, 8, 9, and {5, 6} for d = 10. The proof uses efficient algorithms which a.a.s. colour these random graphs using the number of colours specified by the upper bound. These algorithms are analysed using the differential equation method, including an analysis of certain systems of differential equations with discontinuous right hand sides.
On graph kernels: Hardness results and efficient alternatives
 IN: CONFERENCE ON LEARNING THEORY
, 2003
"... As most ‘realworld’ data is structured, research in kernel methods has begun investigating kernels for various kinds of structured data. One of the most widely used tools for modeling structured data are graphs. An interesting and important challenge is thus to investigate kernels on instances tha ..."
Abstract

Cited by 182 (6 self)
 Add to MetaCart
(Show Context)
As most ‘realworld’ data is structured, research in kernel methods has begun investigating kernels for various kinds of structured data. One of the most widely used tools for modeling structured data are graphs. An interesting and important challenge is thus to investigate kernels on instances that are represented by graphs. So far, only very specific graphs such as trees and strings have been considered. This paper investigates kernels on labeled directed graphs with general structure. It is shown that computing a strictly positive definite graph kernel is at least as hard as solving the graph isomorphism problem. It is also shown that computing an inner product in a feature space indexed by all possible graphs, where each feature counts the number of subgraphs isomorphic to that graph, is NPhard. On the other hand, inner products in an alternative feature space, based on walks in the graph, can be computed in polynomial time. Such kernels are defined in this paper.
Agreement over random networks
 IEEE Trans. Autom. Control
, 2005
"... Abstract—We consider the agreement problem over random information networks. In a randomnetwork, the existence of an information channel between a pair of units at each time instance is probabilistic and independent of other channels; hence, the topology of the network varies over time. In such a f ..."
Abstract

Cited by 165 (3 self)
 Add to MetaCart
Abstract—We consider the agreement problem over random information networks. In a randomnetwork, the existence of an information channel between a pair of units at each time instance is probabilistic and independent of other channels; hence, the topology of the network varies over time. In such a framework, we address the asymptotic agreement for the networked units via notions from stochastic stability. Furthermore, we delineate on the rate of convergence as it relates to the algebraic connectivity of random graphs. Index Terms—Agreement problem, networked systems, random graphs, stochastic stability, supermartingales. I.
The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, Surveys in combinatorics 2005, London
 Math. Soc. Lecture Note Ser.,
, 2005
"... ..."
Distibuted cooperative control of multiple vehicle formations using structural potential functions
 THE 15TH IFAC WORLD CONGRESS
, 2002
"... In this paper, we propose a framework for formation stabilization of multiple autonomous vehicles in a distributed fashion. Each vehicle is assumed to have simple dynamics, i.e. a doubleintegrator, with a directed (or an undirected) information flow over the formation graph of the vehicles. Our go ..."
Abstract

Cited by 134 (9 self)
 Add to MetaCart
(Show Context)
In this paper, we propose a framework for formation stabilization of multiple autonomous vehicles in a distributed fashion. Each vehicle is assumed to have simple dynamics, i.e. a doubleintegrator, with a directed (or an undirected) information flow over the formation graph of the vehicles. Our goal is to find a distributed control law (with an efficient computational cost) for each vehicle that makes use of limited information regarding the state of other vehicles. Here, the key idea in formation stabilization is the use of natural potential functions obtained from structural constraints of a desired formation in a way that leads to a collisionfree, distributed, and bounded state feedback law for each vehicle.
Joint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks
 In Proc. IEEE INFOCOM
, 2005
"... Abstract—We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix, we formulate resource allocation in the network as a utility maximization problem with constraints that arise from content ..."
Abstract

Cited by 120 (4 self)
 Add to MetaCart
(Show Context)
Abstract—We present a model for the joint design of congestion control and media access control (MAC) for ad hoc wireless networks. Using contention graph and contention matrix, we formulate resource allocation in the network as a utility maximization problem with constraints that arise from contention for channel access. We present two algorithms that are not only distributed spatially, but more interestingly, they decompose vertically into two protocol layers where TCP and MAC jointly solve the system problem. The first is a primal algorithm where the MAC layer at the links generates congestion (contention) prices based on local aggregate source rates, and TCP sources adjust their rates based on the aggregate prices in their paths. The second is a dual subgradient algorithm where the MAC subalgorithm is implemented through scheduling linklayer flows according to the congestion prices of the links. Global convergence properties of these algorithms are proved. This is a preliminary step towards a systematic approach to jointly design TCP congestion control algorithms and MAC algorithms, not only to improve performance, but more importantly, to make their interaction more transparent.