Please use this identifier to cite or link to this item:
Title: Weak rigidity theory and its application to formation stabilization
Authors: Jing, GS 
Zhang, GF 
Lee, HWJ 
Wang, L
Keywords: Graph rigidity
Rigid formation
Multiagent systems
Matrix completion
Issue Date: 2018
Publisher: Society for Industrial and Applied Mathematics
Source: SIAM journal on control and optimization, 2018, v. 56, no. 3, p. 2248-2273 How to cite?
Journal: SIAM journal on control and optimization 
Abstract: This paper introduces the notion of weak rigidity to characterize a framework by pairwise inner products of interagent displacements. Compared to distance-based rigidity, weak rigidity requires fewer constrained edges in the graph to determine a geometric shape in an arbitrarily dimensional space. A necessary and sufficient graphical condition for infinitesimal weak rigidity of planar frameworks is derived. As an application of the proposed weak rigidity theory, a gradient-based control law and a nongradient-based control law are designed for a group of single-integrator modeled agents to stabilize a desired formation shape, respectively. Using the gradient control law, we prove that an infinitesimally weakly rigid formation is locally exponentially stable. In particular, if the number of agents is one greater than the dimension of the space, a minimally infinitesimally weakly rigid formation is almost globally asymptotically stable. In the literature of rigid formation, the sensing graph is always required to be rigid. Using the nongradient control law based on weak rigidity theory, it is not necessary for the sensing graph to be rigid for local exponential stability of the formation. A numerical simulation is performed for illustrating the effectiveness of our main results.
ISSN: 0363-0129
EISSN: 1095-7138
DOI: 10.1137/17M1122049
Appears in Collections:Journal/Magazine Article

View full-text via PolyU eLinks SFX Query
Show full item record


Citations as of Feb 14, 2019


Citations as of Feb 16, 2019

Page view(s)

Citations as of Feb 18, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.