Consensus and coordination on groups SO(3) and S3 over constant and state-dependent communication graphs
We address several problems of coordination and consensus on $ SO(3) $ and $ S^3 $ that can be formulated as minimization problems on these Lie groups. Then, gradient descent methods for minimization of the corresponding functions provide distributed algorithms for coordination and consensus in a mu...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2021-01-01
|
| Series: | Automatika |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1080/00051144.2020.1863544 |