arXiv subjects

Daniel Zelazo

Publications and source records attributed to Daniel Zelazo.

54 records · Page 3Linked to original sources

arXiv2018

Analysis and Synthesis of MIMO Multi-Agent Systems Using Network Optimization

This work studies analysis and synthesis problems for diffusively coupled multi-agent systems. We focus on networks comprised of multi-input multi-output nonlinear systems that posses a property we term maximal equilibrium-independent cyclically monotonone passivity (MEICMP), which is an extension of recent passivity results. We demonstrate that networks comprised of MEICMP systems are related to a pair of dual network optimization problems. In particular, we show that the steady-state behavior of the multi-agent system correspond to the minimizers of appropriately defined network optimization problems. Exploiting this connection between the dynamic networked system and static optimization problems, we propose a synthesis procedure for designing the coupling controllers in the network to achieve a desired output state for the network. We provide detailed examples of dynamical networked systems satisfying these properties and demonstrate the results for a network of damped planar oscillators.

math.OC↗

arXiv2018

Bearing Rigidity Theory and its Applications for Control and Estimation of Network Systems: Life Beyond Distance Rigidity

The problem of distributed control and estimation for multi-agent systems with limited sensing capabilities is a practical challenge motivated by incomplete and imperfect sensing. This article addresses an important case where each agent in a network can only sense the relative bearings to their nearest neighbors. The study of this topic is motivated mainly by the rapid development of bearing-only sensors such as optical cameras or sensor arrays. This article provides a tutorial review on this topic focusing on the problems of formation control and network localization. A key component of this review is a presentation of the recently developed bearing rigidity theory, which defines a necessary architectural feature of multi-agent systems aiming to solve these two problems. This article presents a high-level summary of recently developed algorithms solving these problems, various simulation examples, and discussions pointing to the relevant literature and important remaining challenges in this area.

eess.SY↗

arXiv2018

Pointing consensus for rooted out-branching graphs

Given a network of multiple agents, the pointing consensus problem asks all agents to point toward a common target. This paper proposes a simple method to solve the pointing consensus problem in the plane. In our formulation, each agent does not know its own position, but has information about its own heading vector expressed in a common coordinate frame and some desired relative angles to the neighbors. By exchanging the heading vectors via a communication network described by a rooted out-branching graph and controlling the angle between the heading vectors, we show that all agents' heading vectors asymptotically point towards the same target for almost all initial conditions. Simulations are provided to validate the effectiveness of the proposed method.

math.OC↗

arXiv2017

Laman Graphs are Generically Bearing Rigid in Arbitrary Dimensions

This paper addresses the problem of constructing bearing rigid networks in arbitrary dimensions. We first show that the bearing rigidity of a network is a generic property that is critically determined by the underlying graph of the network. A new notion termed generic bearing rigidity is defined for graphs. If the underlying graph of a network is generically bearing rigid, then the network is bearing rigid for almost all configurations; otherwise, the network is not bearing rigid for any configuration. As a result, the key to construct bearing rigid networks is to construct generically bearing rigid graphs. The main contribution of this paper is to prove that Laman graphs, which can be generated by the Henneberg construction, are generically bearing rigid in arbitrary dimensions. As a consequence, if the underlying graph of a network is Laman, the network is bearing rigid for almost all configurations in arbitrary dimensions.

eess.SY↗

arXiv2017

On Certain Properties of Convex Functions

This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an affine subspace.

math.OC↗

arXiv2016

Fekete points, formation control, and the balancing problem

We study formation control problems. Our approach is to let a group of systems maximize their pairwise distances whilst bringing them all to a given submanifold, determining the shape of the formation. The algorithm we propose allows to initialize the positions of the individual systems in the ambient space of the given submanifold but brings them to the desired formation asymptotically in a stable fashion. Our control inherently consists of a distributed component, maximizing the pairwise distances, and a decentralized component, asymptotically stabilizing the submanifold. We establish a graph-theoretical interpretation of the equilibria that our control enforces and extend our approach to systems living on the special Euclidean group. Throughout the paper, we illustrate our approach on different examples.

math.OC↗

arXiv2016

Consensus over Weighted Directed Graphs: A Robustness Perspective

The present paper investigates the robustness of the consensus protocol over weighted directed graphs using the Nyquist criterion. The limit to which a single weight can vary, while consensus among the agents can be achieved, is explicitly derived. It is shown that even with a negative weight on one of the edges, consensus may be achieved. The result obtained in this paper is applied to a directed acyclic graph and to the directed cycle graph. Graph theoretic interpretations of the limits are provided for the two cases. Simulations support the theoretical results.

eess.SY↗

arXiv2016

Localizability and Distributed Protocols for Bearing-Based Network Localization in Arbitrary Dimensions

This paper addresses the problem of bearing-based network localization, which aims to localize all the nodes in a static network given the locations of a subset of nodes termed anchors and inter-node bearings measured in a common reference frame. The contributions of the paper are twofold. Firstly, we propose necessary and sufficient conditions for network localizability with both algebraic and rigidity theoretic interpretations. The analysis of the localizability heavily relies on the recently developed bearing rigidity theory and a special matrix termed the bearing Laplacian. Secondly, we propose a linear distributed protocol for bearing-based network localization. The protocol can globally localize a network if and only if the network is localizable. The sensitivity of the protocol to constant measurement errors is also analyzed. One novelty of this work is that the localizability analysis and localization protocol are applicable to networks in arbitrary dimensional spaces.

math.OC↗

arXiv2015

Translational and Scaling Formation Maneuver Control via a Bearing-Based Approach

This paper studies distributed maneuver control of multi-agent formations in arbitrary dimensions. The objective is to control the translation and scale of the formation while maintaining the desired formation pattern. Unlike conventional approaches where the target formation is defined by relative positions or distances, we propose a novel bearing-based approach where the target formation is defined by inter-neighbor bearings. Since the bearings are invariant to the translation and scale of the formation, the bearing-based approach provides a simple solution to the problem of translational and scaling formation maneuver control. Linear formation control laws for double-integrator dynamics are proposed and the global formation stability is analyzed. This paper also studies bearing-based formation control in the presence of practical problems including input disturbances, acceleration saturation, and collision avoidance. The theoretical results are illustrated with numerical simulations.

eess.SY↗

arXiv2015

Bearing-Based Formation Stabilization with Directed Interaction Topologies

This paper studies the problem of stabilizing target formations specified by inter-neighbor bearings with relative position measurements. While the undirected case has been studied in the existing works, this paper focuses on the case where the interaction topology is directed. It is shown that a linear distributed control law, which was proposed previously for undirected cases, can still be applied to the directed case. The formation stability in the directed case, however, relies on a new notion termed bearing persistence, which describes whether or not the directed underlying graph is persistent with the bearing rigidity of a formation. If a target formation is not bearing persistent, undesired equilibriums will appear and global formation stability cannot be guaranteed. The notion of bearing persistence is defined by the bearing Laplacian matrix and illustrated by simulation examples.

eess.SY↗

arXiv2015

Bearing-Based Formation Maneuvering

This paper studies the problem of multi-agent formation maneuver control where both of the centroid and scale of a formation are required to track given velocity references while maintaining the formation shape. Unlike the conventional approaches where the target formation is defined by inter-neighbor relative positions or distances, we propose a bearing-based approach where the target formation is defined by inter-neighbor bearings. Due to the invariance of the bearings, the bearing-based approach provides a natural solution to formation scale control. We assume the dynamics of each agent as a single integrator and propose a globally stable proportional-integral formation maneuver control law. It is shown that at least two leaders are required to collaborate in order to control the centroid and scale of the formation whereas the followers are not required to have access to any global information, such as the velocities of the leaders.

eess.SY↗

arXiv2015

Bearing Rigidity and Almost Global Bearing-Only Formation Stabilization

A fundamental problem that the bearing rigidity theory studies is to determine when a framework can be uniquely determined up to a translation and a scaling factor by its inter-neighbor bearings. While many previous works focused on the bearing rigidity of two-dimensional frameworks, a first contribution of this paper is to extend these results to arbitrary dimensions. It is shown that a framework in an arbitrary dimension can be uniquely determined up to a translation and a scaling factor by the bearings if and only if the framework is infinitesimally bearing rigid. In this paper, the proposed bearing rigidity theory is further applied to the bearing-only formation stabilization problem where the target formation is defined by inter-neighbor bearings and the feedback control uses only bearing measurements. Nonlinear distributed bearing-only formation control laws are proposed for the cases with and without a global orientation. It is proved that the control laws can almost globally stabilize infinitesimally bearing rigid formations. Numerical simulations are provided to support the analysis.

eess.SY↗

arXiv2015

Bearing-Based Distributed Control and Estimation of Multi-Agent Systems

This paper studies the distributed control and estimation of multi-agent systems based on bearing information. In particular, we consider two problems: (i) the distributed control of bearing-constrained formations using relative position measurements and (ii) the distributed localization of sensor networks using bearing measurements. Both of the two problems are considered in arbitrary dimensional spaces. The analyses of the two problems rely on the recently developed bearing rigidity theory. We show that the two problems have the same mathematical formulation and can be solved by identical protocols. The proposed controller and estimator can globally solve the two problems without ambiguity. The results are supported with illustrative simulations.

eess.SY↗

arXiv2015

On the Robustness of Uncertain Consensus Networks

This work considers the robustness of uncertain consensus networks. The first set of results studies the stability properties of consensus networks with negative edge weights. We show that if either the negative weight edges form a cut in the graph, or any single negative edge weight has magnitude less than the inverse of the effective resistance between the two incident nodes, then the resulting network is unstable. These results are then applied to analyze the robustness properties of the consensus network with additive but bounded perturbations of the edge weights. It is shown that the small-gain condition is related again to cuts in the graph and effective resistance. For the single edge case, the small-gain condition is also shown to be exact. The results are then extended to consensus networks with non-linear couplings.

math.OC↗

arXiv2014

Decentralized Rigidity Maintenance Control with Range Measurements for Multi-Robot Systems

This work proposes a fully decentralized strategy for maintaining the formation rigidity of a multi-robot system using only range measurements, while still allowing the graph topology to change freely over time. In this direction, a first contribution of this work is an extension of rigidity theory to weighted frameworks and the rigidity eigenvalue, which when positive ensures the infinitesimal rigidity of the framework. We then propose a distributed algorithm for estimating a common relative position reference frame amongst a team of robots with only range measurements in addition to one agent endowed with the capability of measuring the bearing to two other agents. This first estimation step is embedded into a subsequent distributed algorithm for estimating the rigidity eigenvalue associated with the weighted framework. The estimate of the rigidity eigenvalue is finally used to generate a local control action for each agent that both maintains the rigidity property and enforces additional con- straints such as collision avoidance and sensing/communication range limits and occlusions. As an additional feature of our approach, the communication and sensing links among the robots are also left free to change over time while preserving rigidity of the whole framework. The proposed scheme is then experimentally validated with a robotic testbed consisting of 6 quadrotor UAVs operating in a cluttered environment.

eess.SY↗

arXiv2014

On the Definiteness of the Weighted Laplacian and its Connection to Effective Resistance

This work explores the definiteness of the weighted graph Laplacian matrix with negative edge weights. The definiteness of the weighted Laplacian is studied in terms of certain matrices that are related via congruent and similarity transformations. For a graph with a single negative weight edge, we show that the weighted Laplacian becomes indefinite if the magnitude of the negative weight is less than the inverse of the effective resistance between the two incident nodes. This result is extended to multiple negative weight edges. The utility of these results are demonstrated in a weighted consensus network where appropriately placed negative weight edges can induce a clustering behavior for the protocol.

math.OC↗

arXiv2013

Rigidity Theory in SE(2) for Unscaled Relative Position Estimation using only Bearing Measurements

This work considers the problem of estimating the unscaled relative positions of a multi-robot team in a common reference frame from bearing-only measurements. Each robot has access to a relative bearing measurement taken from the local body frame of the robot, and the robots have no knowledge of a common or inertial reference frame. A corresponding extension of rigidity theory is made for frameworks embedded in the \emph{special Euclidean group} $SE(2) = \mathbb{R}^2 \times \mathcal{S}^1$. We introduce definitions describing rigidity for $SE(2)$ frameworks and provide necessary and sufficient conditions for when such a framework is \emph{infinitesimally rigid} in $SE(2)$. Analogous to the rigidity matrix for point formations, we introduce the \emph{directed bearing rigidity matrix} and show that an $SE(2)$ framework is infinitesimally rigid if and only if the rank of this matrix is equal to $2|\mathcal{V}|-4$, where $|\mathcal{V}|$ is the number of agents in the ensemble. The directed bearing rigidity matrix and its properties are then used in the implementation and convergence proof of a distributed estimator to determine the {unscaled}{} relative positions in a common frame. Some simulation results are also given to support the analysis.

math.OC↗

arXiv2013

Duality and Network Theory in Passivity-based Cooperative Control

This paper presents a class of passivity-based cooperative control problems that have an explicit connection to convex network optimization problems. The new notion of maximal equilibrium independent passivity is introduced and it is shown that networks of systems possessing this property asymptotically approach the solutions of a dual pair of network optimization problems, namely an optimal potential and an optimal flow problem. This connection leads to an interpretation of the dynamic variables, such as system inputs and outputs, to variables in a network optimization framework, such as divergences and potentials, and reveals that several duality relations known in convex network optimization theory translate directly to passivity-based cooperative control problems. The presented results establish a strong and explicit connection between passivity-based cooperative control theory on the one side and network optimization theory on the other, and they provide a unifying framework for network analysis and optimal design. The results are illustrated on a nonlinear traffic dynamics model that is shown to be asymptotically clustering.

math.OC↗