Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Convex Optimization of Bearing Formation Control of Rigid bodies on Lie Group (2309.17150v1)

Published 29 Sep 2023 in eess.SY, cs.SY, and math.OC

Abstract: In this paper, the problem of reaching formation for a network of rigid agents over a special orthogonal group is investigated by considering bearing-only constraints as the desired formation. Each agent is able to gather the measurements with respect to other agents in its own body frame. So, the agents are coordinated-free concerning a global reference frame. Attracting to the desired formation is founded on solving an optimization problem for minimizing the difference between the instantaneous bearing between agents and their desired bearing. In order to have a unique global solution, the convex optimization method is implemented. Since the rotation matrices are not convex, the method of convex relaxation of rotation matrices space is used to embed the rotation matrices on the convex hull of the Lie group. Then the control law is designed to achieve the desired bearing with minimum energy consumption. Finally, a simulation example is provided to verify the results.

Summary

We haven't generated a summary for this paper yet.