Christian Lageman

Yang Liu, Christian Lageman, Brian D. O. Anderson et al.

We study the approach to obtaining least squares solutions to systems of linear algebraic equations over networks by using distributed algorithms. Each node has access to one of the linear equations and holds a dynamic state. The aim for the node states is to reach a consensus as a least squares solution of the linear equations by exchanging their states with neighbors over an underlying interaction graph. A continuous-time distributed least squares solver over networks is developed in the form of the famous Arrow-Hurwicz-Uzawa flow. A necessary and sufficient condition is established on the graph Laplacian for the continuous-time distributed algorithm to give the least squares solution in the limit, with an exponentially fast convergence rate. The feasibility of different fundamental graphs is discussed including path graph, star graph, etc. Moreover, a discrete-time distributed algorithm is developed by Euler's method, converging exponentially to the least squares solution at the node states with suitable step size and graph conditions. The exponential convergence rate for both the continuous-time and discrete-time algorithms under the established conditions is confirmed by numerical examples. Finally, we investigate the performance of the proposed flow under switching networks, and surprisingly, switching networks at high switching frequencies can lead to approximate least square solvers even if all graphs in the switching signal fail to do so in the absence of structure switching.

Bomin Jiang, Zhiyong Sun, Brian D. O. Anderson et al.

Most current results on coverage control using mobile sensors require that one partitioned cell is associated with precisely one sensor. In this paper, we consider a class of coverage control problems involving higher order Voronoi partitions, motivated by applications where more than one sensor is required to monitor and cover one cell. Such applications are frequent in scenarios requiring the sensors to localize targets. We introduce a framework depending on a coverage performance function incorporating higher order Voronoi cells and then design a gradient-based controller which allows the multi-sensor system to achieve a local equilibrium in a distributed manner. The convergence properties are studied and related to Lloyd algorithm. We study also the extension to coverage of a discrete set of points. In addition, we provide a number of real world scenarios where our framework can be applied. Simulation results are also provided to show the controller performance.

Alireza Khosravian, Jochen Trumpf, Robert Mahony et al.

This paper provides a new observer design methodology for invariant systems whose state evolves on a Lie group with outputs in a collection of related homogeneous spaces and where the measurement of system input is corrupted by an unknown constant bias. The key contribution of the paper is to study the combined state and input bias estimation problem in the general setting of Lie groups, a question for which only case studies of specific Lie groups are currently available. We show that any candidate observer (with the same state space dimension as the observed system) results in non-autonomous error dynamics, except in the trivial case where the Lie-group is Abelian. This precludes the application of the standard non-linear observer design methodologies available in the literature and leads us to propose a new design methodology based on employing invariant cost functions and general gain mappings. We provide a rigorous and general stability analysis for the case where the underlying Lie group allows a faithful matrix representation. We demonstrate our theory in the example of rigid body pose estimation and show that the proposed approach unifies two competing pose observers published in prior literature.