Goto

Collaborating Authors

 target formation


Collision-Free Bearing-Driven Formation Tracking for Euler-Lagrange Systems

Cheng, Haoshu, Guay, Martin, Wang, Shimin, Che, Yunhong

arXiv.org Artificial Intelligence

In this paper, we investigate the problem of tracking formations driven by bearings for heterogeneous Euler-Lagrange systems with parametric uncertainty in the presence of multiple moving leaders. To estimate the leaders' velocities and accelerations, we first design a distributed observer for the leader system, utilizing a bearing-based localization condition in place of the conventional connectivity assumption. This observer, coupled with an adaptive mechanism, enables the synthesis of a novel distributed control law that guides the formation towards the target formation, without requiring prior knowledge of the system parameters. Furthermore, we establish a sufficient condition, dependent on the initial formation configuration, that ensures collision avoidance throughout the formation evolution. The effectiveness of the proposed approach is demonstrated through a numerical example. Keywords: Bearing-based formation, distributed observer, multi-agent systems, Euler-Lagrange system1.


Formation Maneuver Control Based on the Augmented Laplacian Method

Zhou, Xinzhe, Wang, Xuyang, Duan, Xiaoming, Bai, Yuzhu, He, Jianping

arXiv.org Artificial Intelligence

-- This paper proposes a novel formation maneuver control method for both 2-D and 3-D space, which enables the formation to translate, scale, and rotate with arbitrary orientation. The core innovation is the novel design of weights in the proposed augmented Laplacian matrix. Instead of using scalars, we represent weights as matrices, which are designed based on a specified rotation axis and allow the formation to perform rotation in 3-D space. T o further improve the flexibility and scalability of the formation, the rotational axis adjustment approach and dynamic agent reconfiguration method are developed, allowing formations to rotate around arbitrary axes in 3-D space and new agents to join the formation. Theoretical analysis is provided to show that the proposed approach preserves the original configuration of the formation. The proposed method maintains the advantages of the complex Laplacian-based method, including reduced neighbor requirements and no reliance on generic or convex nominal configurations, while achieving arbitrary orientation rotations via a more simplified implementation. Simulations in both 2-D and 3-D space validate the effectiveness of the proposed method. In recent years, formation control of multi-agent systems has gained significant attention due to its wide range of applications in various fields, such as drone swarms [1], AUV formations [2], robotic cooperation [3], etc.


Distributed Formation Shape Control of Identity-less Robot Swarms

Sun, Guibin, Xu, Yang, Liu, Kexin, Lü, Jinhu

arXiv.org Artificial Intelligence

Different from most of the formation strategies where robots require unique labels to identify topological neighbors to satisfy the predefined shape constraints, we here study the problem of identity-less distributed shape formation in homogeneous swarms, which is rarely studied in the literature. The absence of identities creates a unique challenge: how to design appropriate target formations and local behaviors that are suitable for identity-less formation shape control. To address this challenge, we propose the following novel results. First, to avoid using unique identities, we propose a dynamic formation description method and solve the formation consensus of robots in a locally distributed manner. Second, to handle identity-less distributed formations, we propose a fully distributed control law for homogeneous swarms based on locally sensed information. While the existing methods are applicable to simple cases where the target formation is stationary, ours can tackle more general maneuvering formations such as translation, rotation, or even shape deformation. Both numerical simulation and flight experiment are presented to verify the effectiveness and robustness of our proposed formation strategy.

  Country:
  Genre: Research Report (0.64)

On Topological Conditions for Enabling Transient Control in Leader-follower Networks

Chen, Fei, Dimarogonas, Dimos V.

arXiv.org Artificial Intelligence

We derive necessary and sufficient conditions for leader-follower multi-agent systems such that we can further apply prescribed performance control to achieve the desired formation while satisfying certain transient constraints. A leader-follower framework is considered in the sense that a group of agents with external inputs are selected as leaders in order to drive the group of followers in a way that the entire system can achieve target formation within certain prescribed performance transient bounds. We first derive necessary conditions on the leader-follower graph topology under which the target formation together with the prescribed performance guarantees can be fulfilled. Afterwards, the derived necessary conditions are extended to necessary and sufficient conditions for leader-follower formation control under transient constraints. Finally, the proposed results are illustrated with simulation examples.


Controllability Characterizations of Leader-Based Swarm Interactions

Croix, Jean-Pierre de la (Georgia Institute of Technology) | Egerstedt, Magnus (Georgia Institute of Technology)

AAAI Conferences

In this paper, we investigate what role the network topology plays when controlling a network of mobile robots. This is a question of key importance in the emerging area of human-swarm interaction and we approach this question by letting a human user inject control signals at a single leader-node, which are then propagated throughout the network. Based on a user study, it is found that some topologies are more amenable to human control than others, which can be interpreted in terms of the rank of the controllability matrix of the underlying network dynamics, as well as, measures of node centrality on the leader of the network.