Spatial Formation Control

In this thesis, we study robust spatial formation control from several aspects. First, we study robust adaptive attitude synchronization for a network of rigid body agents using various attitude error functions defined on SO(3). Our results are particularly useful for networks with large initial attitude difference. We devise an adaptive geometric approach to cope with situations where the inertia matrices are not available for measurement. We use the Frobenius norm as a measure for the difference between the actual values of inertia matrices and their estimated values, to construct the individual adaptive laws of the agents. Compared to the previous methods for synchronization on SO(3) such as those which are based on quaternions, our proposed approach does not contain any attitude representation ambiguity. As the final part of our studies from the attitude synchronization aspect, we analyze robustness to external disturbances and unmodeled dynamics, and propose a method to attenuate such effects. Simulation results illustrate the effectiveness of the proposed approach. In the next part of the thesis, we study the distributed localization of the extremum point of unknown quadratic functions representing various physical or artificial signal potential fields. It is assumed that the value of such functions can be measured at each instant. Using high pass filtering of the measured signals, a linear parametric model is obtained for system identification. For design purposes, we add a consensus term to modify the identification subsystem. Next, we analyze the exponential convergence of the proposed estimation scheme using algebraic graph theory. In addition, we derive a distributed identifiability condition and use it for the construction of distributed extremum seeking control laws. In particular, we show that for a network of connected agents, if each agent contains a portion of the dithering signals, it is still possible to drive the system states to the extremum point provided that the distributed identifiability condition is satisfied. In the final part of this research, several robust control problems for general linear time invariant multi-agent systems are studied. We consider the robust consensus problem in the presence of unknown Lipschitz nonlinearities and polytopic uncertainties in the model of each agent. Next, this problem is solved in the presence of external disturbances. A set of control laws is proposed for the network to attain the consensus task and under the zero initial condition, achieves the desired H-infinity performance. We show that by implementing the modified versions of these control laws, it is possible to perform two-time scales formation control

Newton-Raphson Consensus for Distributed Convex Optimization

We address the problem of distributed uncon- strained convex optimization under separability assumptions, i.e., the framework where each agent of a network is endowed with a local private multidimensional convex cost, is subject to communication constraints, and wants to collaborate to compute the minimizer of the sum of the local costs. We propose a design methodology that combines average consensus algorithms and separation of time-scales ideas. This strategy is proved, under suitable hypotheses, to be globally convergent to the true minimizer. Intuitively, the procedure lets the agents distributedly compute and sequentially update an approximated Newton- Raphson direction by means of suitable average consensus ratios. We show with numerical simulations that the speed of convergence of this strategy is comparable with alternative optimization strategies such as the Alternating Direction Method of Multipliers. Finally, we propose some alternative strategies which trade-off communication and computational requirements with convergence speed.Comment: 18 pages, preprint with proof

Accelerated Consensus via Min-Sum Splitting

We apply the Min-Sum message-passing protocol to solve the consensus problem in distributed optimization. We show that while the ordinary Min-Sum algorithm does not converge, a modified version of it known as Splitting yields convergence to the problem solution. We prove that a proper choice of the tuning parameters allows Min-Sum Splitting to yield subdiffusive accelerated convergence rates, matching the rates obtained by shift-register methods. The acceleration scheme embodied by Min-Sum Splitting for the consensus problem bears similarities with lifted Markov chains techniques and with multi-step first order methods in convex optimization