— 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...
— This paper studies consensus seeking over noisy networks with time-varying noise statistics. Stochastic approximation type algorithms can ensure consensus in mean square and wi...
— The Tunnel-MILP algorithm is a three stage path planning method for 2-D environments that relies on the identification of a sequence of convex polygons to form an obstacle fre...
Michael P. Vitus, Steven Lake Waslander, Claire J....
— A new congestion control protocol is presented, analyzed and experimentally evaluated. It consists of the standard inner-loop ACK-clock and a novel outer-loop adjusting the win...
— We describe a distributed algorithm for solving the rendezvous problem based on consensus protocols. We extend our previous work by considering the case when the evolution of t...
— A considerable amount of research has been done on the use of logarithmic quantizers for networked feedback control systems. However, most results are developed for the case of...
Daniel Ferreira Coutinho, Minyue Fu, Carlos E. de ...
— This paper presents a method for controlling formations of mobile robots. In particular, the problem of maintaining so-called “persistent formations” while moving the forma...
Brian Stephen Smith, Jiuguang Wang, Magnus Egerste...
— In this paper we consider state estimation carried over a sensor network. A fusion center forms a local multi-hop tree of sensors and gateways and fuses the data into a state e...
Ling Shi, Karl Henrik Johansson, Richard M. Murray
— In the average consensus a set of linear systems has to be driven to the same final state which corresponds to the average of their initial states. This contribution presents ...