Controllability of Formation Systems on Special Orthogonal Groups Over Directed Graphs

Gradient flows provide a means for a networked formation system to reach and stabilize at a target configuration. However, the decentralization constraints and the geometry of the state space make the appearance of stable but undesired configurations inevitable. The presence of these undesired stabl...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on control of network systems 2021-06, Vol.8 (2), p.872-883
Main Authors: Sinner, Michael, Chen, Xudong, Pao, Lucy
Format: Article
Language:English
Subjects:
Configurations
Control-linear systems
Controllability
Controllers
Convergence
Cost function
Directed graphs
formation systems
geometric control
Gradient flow
Graph theory
Lie groups
Parameters
Satellites
Stability
Task analysis
Tuning
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Gradient flows provide a means for a networked formation system to reach and stabilize at a target configuration. However, the decentralization constraints and the geometry of the state space make the appearance of stable but undesired configurations inevitable. The presence of these undesired stable configurations precludes global convergence to the target configuration. In this article, we address the issue by considering a controlled formation system on special orthogonal groups over a directed graph. Agents of the system are tasked with stabilizing from others at target relative attitudes. The nominal dynamics of the agents are gradient flows of certain potential functions. These functions are parameter dependent, pretuned by the controller. To prevent the formation system from being trapped at an undesired configuration, we formulate and address the problem of whether the controller can steer the system from any configuration to any other configuration by retuning, on the fly, the parameters of the potential functions. We show that the answer is affirmative provided that the underlying graph is rooted with a single root node being fully actuated. We formulate the result as a main theorem and provide a complete proof of the result.
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2021.3050125