Seong-Ho Kwon

Seong-Ho Kwon, Hyo-Sung Ahn

This paper discusses generalized weak rigidity theory, and aims to apply the theory to formation control problems with a gradient flow law. The generalized weak rigidity theory is utilized in order that desired formations are characterized by a general set of pure inter-agent distances and angles. As the first result of its applications, the paper provides analysis of locally exponential stability for formation systems with pure distance/angle constraints in the $2$- and $3$-dimensional spaces. Then, as the second result, if there are three agents in the $2$-dimensional space, almost globally exponential stability for formation systems is ensured. Through numerical simulations, the validity of analyses is illustrated.

Seong-Ho Kwon, Minh Hoang Trinh, Koog-Hwan Oh et al.

In this paper, we introduce new concepts of weak rigidity matrix and infinitesimal weak rigidity for planar frameworks. The weak rigidity matrix is used to directly check if a framework is infinitesimally weakly rigid while previous work can check a weak rigidity of a framework indirectly. An infinitesimal weak rigidity framework can be uniquely determined up to a translation and a rotation (and a scaling also when the framework does not include any edge) by its inter-neighbor distances and angles. We apply the new concepts to a three-agent formation control problem with a gradient control law, and prove instability of the control system at any incorrect equilibrium point and convergence to a desired target formation. Also, we propose a modified Henneberg construction, which is a technique to generate minimally rigid (or weakly rigid) graphs. Finally, we extend the concept of the weak rigidity in R^2 to the concept in R^3.

Hyo-Sung Ahn, Kevin L. Moore, Seong-Ho Kwon et al.

This paper presents conditions for establishing topological controllability in undirected networks of diffusively coupled agents. Specifically, controllability is considered based on the signs of the edges (negative, positive or zero). Our approach differs from well-known structural controllability conditions for linear systems or consensus networks, where controllability conditions are based on edge connectivity (i.e., zero or nonzero edges). Our results first provide a process for merging controllable graphs into a larger controllable graph. Then, based on this process, we provide a graph decomposition process for evaluating the topological controllability of a given network.