Asset Details
Do you wish to reserve the book?
Consensus and coordination on groups SO(3) and S3 over constant and state-dependent communication graphs
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
Consensus and coordination on groups SO(3) and S3 over constant and state-dependent communication graphs
Do you wish to request the book?
Consensus and coordination on groups SO(3) and S3 over constant and state-dependent communication graphs
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
Journal Article
Consensus and coordination on groups SO(3) and S3 over constant and state-dependent communication graphs
2021
Overview
We address several problems of coordination and consensus on and 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 multi-agent system. We point out main differences in convergence of algorithms on the two groups. We discuss advantages and effects of representing 3D rotations by quaternions and applications to the coordinated motion in space. In some situations (and depending on the concrete problem and goals) it is advantageous to run algorithms on and map trajectories onto via the double cover map , instead of working directly on .
Publisher
Taylor & Francis Ltd,Taylor & Francis Group
