Underwater sensor nodes will find applications in oceanographic data collection, pollution monitoring, o#shore exploration, disaster prevention, assisted navigation and tactical surveillance applications. Moreover, unmanned or autonomous underwater vehicles (UUVs, AUVs), equipped with sensors, will enable the exploration of natural undersea resources and gathering of scientific data in collaborative monitoring missions. Underwater acoustic networking is the enabling technology for these applications. Underwater networks consist of a variable number of sensors and vehicles that are deployed to perform collaborative monitoring tasks over a given area. In this

Submitted to the IEEE Transactions on Automatic Control Technical Report CIT-CDS 2004-005 In this paper, we present a theoretical framework for design and analysis of distributed flocking algorithms. Two cases of flocking in free-space and presence of multiple obstacles are considered. We present three flocking algorithms: two for free-flocking 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 lattice-shape objects called α-lattices. We use a multi-species framework for construction of collective potentials that consist of flock-members, or α-agents, and virtual agents associated with α-agents called β- and γ-agents. We show that the tracking/migration problem for flocks can be solved using an algorithm with a peer-to-peer architecture. Each node (or macro-agent) of this peer-to-peer network is the aggregation of all three species of agents. The implication of this fact is that “flocks

Networked Control Systems (NCSs) are spatially distributed systems for which the communication between sensors, actuators, and controllers is supported by a shared communication network. In this paper we review several recent results on estimation, analysis, and controller synthesis for NCSs. The results surveyed address channel limitations in terms of packet-rates, sampling, network delay and packet dropouts. The results are presented in a tutorial fashion, comparing alternative methodologies. I.

This paper addresses the design of mobile sensor networks for optimal data collection. The development is strongly motivated by the application to adaptive ocean sampling for an autonomous ocean observing and prediction system. A performance metric, used to derive optimal paths for the network of mobile sensors, defines the optimal data set as one which minimizes error in a model estimate of the sampled field. Feedback control laws are presented that stably coordinate sensors on structured tracks that have been optimized over a minimal set of parameters. Optimal, closed-loop solutions are computed in a number of low-dimensional cases to illustrate the methodology. Robustness of the performance to the influence of a steady flow field on relatively slow-moving mobile sensors is also explored.

Abstract—Operations with multiple autonomous underwater vehicles (AUVs) have a variety of underwater applications. For example, a coordinated group of vehicles with environmental sensors can perform adaptive ocean sampling at the appropriate spatial and temporal scales. We describe a methodology for cooperative control of multiple vehicles based on virtual bodies and artificial potentials (VBAP). This methodology allows for adaptable formation control and can be used for missions such as gradient climbing and feature tracking in an uncertain environment. We discuss our implementation on a fleet of autonomous underwater gliders and present results from sea trials in Monterey Bay in August, 2003. These at-sea demonstrations were performed as part of the Autonomous Ocean Sampling Network (AOSN) II project. Index Terms—Adaptive sampling, autonomous underwater vehicles (AUVs), cooperative control, formations, gradient climbing, underwater gliders. I.

Abstract. This paper presents coordination algorithms for groups of mobile agents performing deployment and coverage tasks. As an important modeling constraint, we assume that each mobile agent has a limited sensing/communication radius. Based on the geometry of Voronoi partitions and proximity graphs, we analyze a class of aggregate objective functions and propose coverage algorithms in continuous and discrete time. These algorithms have convergence guarantees and are spatially distributed with respect to appropriate proximity graphs. Numerical simulations illustrate the results.

Abstract — This paper presents a control strategy that allows a group of mobile robots to position themselves to optimize the measurement of sensory information in the environment. The robots use sensed information to estimate a function indicating the relative importance of different areas in the environment. Their estimate is then used to drive the network to a desirable placement configuration using a computationally simple decentralized control law. We formulate the problem, provide a practical control solution, and present the results of numerical simulations. We then discuss experiments carried out on a swarm of mobile robots. I.

In this paper we present strategies for adaptive sampling

Abstract — A decentralized, adaptive control law is presented to drive a network of mobile robots to a near-optimal sensing configuration. The control law is adaptive in that it integrates sensor measurements to provide a converging estimate of the distribution of sensory information in the environment. It is decentralized in that it requires only information local to each robot. A Lyapunov-type proof is used to show that the control law causes the network to converge to a near-optimal sensing configuration, and the controller is demonstrated in numerical simulations. This technique suggests a broader application of adaptive control methodologies to decentralized control problems in unknown dynamical environments. I.

We prove a convergent strategy for a group of mobile sensors to generate contour plots, i.e., to automatically detect and track level curves of a scalar field in the plane. The group can consist of as few as four mobile sensors, where each sensor can take only a single measurement at a time. The shape of the formation of mobile sensors is determined to minimize the least mean square error in the estimates of the scalar field and its gradient. The algorithm to generate a contour plot is based on feedback control laws for each sensor platform. The control laws serve two purposes: to guarantee that the center of the formation moves along one level curve at unit speed; and to stabilize the shape of the formation. We prove that both goals can be achieved asymptotically. We show simulation results that illustrate the performance of the control laws in noisy environments. 1.