Elementary operations for rigidity restoration and persistence analysis of multi‐agent system.

This work focuses on the construction of rigid formation from non‐rigid ones in the two‐dimensional space. Analogously to operations of Henneberg sequence aiming to guarantee the minimal rigidity of formation, two new operations are introduced, allowing one to sequentially build any rigid graph by connecting non‐rigid ones. A systematic construction sequence is developed based on proposed operations, and is shown to be able to restore rigidity by introducing minimum number of new edges during the construction process. Further applications of the proposed operations are also presented, one of which is successfully employed in the problem of persistence analysis of directed graphs, and can verify the persistence of a given graph with a speed two times faster comparing with existing solution. [ABSTRACT FROM AUTHOR]