Angle-Constrained Formation Control under Directed Non-Triangulated Sensing Graphs (Extended Version)
Angle-constrained formation control has attracted much attention from control community due to the advantage that inter-edge angles are invariant under uniform translations, rotations, and scalings of the whole formation. However, almost all the existing angle-constrained formation control methods are limited to undirected triangulated sensing graphs. In this paper, we propose an angle-constrained formation control approach under a Leader-First Follower sensing architecture, where the sensing graph is directed and non-triangulated. Both shape stabilization and maneuver control are achieved under arbitrary initial configurations of the formation. During the formation process, the control input of each agent is based on relative positions from its neighbors measured in the local reference frame and wireless communications among agents are not required. We show that the proposed distributed formation controller ensures global exponential stability of the desired formation for an nagent system. Furthermore, it is interesting to see that the convergence rate of the whole formation is solely determined by partial specific angles within the target formation. The effectiveness of the proposed control algorithms is illustrated by carrying out experiments both in simulation environments and on real robotic platforms.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Stochastic Entanglement Configuration for Constructive Entanglement Topologies in Quantum Machine Learning with Application to Cardiac MRI
Efficient entanglement strategies are essential for advancing variational quantum circuits (VQCs) for quantum machine learning (QML). However, most current approaches use fixed entanglement topologies that are not adapti…
Quantum Machine LearningSatQNet: Satellite-assisted Quantum Network Entanglement Routing Using Directed Line Graph Neural Networks
Quantum networks are expected to become a key enabler for interconnecting quantum devices. In contrast to classical communication networks, however, information transfer in quantum networks is usually restricted to short…
Reinforcement LearningGraph Neural NetworkControl-DAG: Constrained Decoding for Non-Autoregressive Directed Acyclic T5 using Weighted Finite State Automata
The Directed Acyclic Transformer is a fast non-autoregressive (NAR) model that performs well in Neural Machine Translation. Two issues prevent its application to general Natural Language Generation (NLG) tasks: frequent …
Machine TranslationText GenerationTranslationDAVID: Influence Diagram Processing System for the Macintosh
Influence diagrams are a directed graph representation for uncertainties as probabilities. The graph distinguishes between those variables which are under the control of a decision maker (decisions, shown as rectangles) …
GCVAE: Generalized-Controllable Variational AutoEncoder
Variational autoencoders (VAEs) have recently been used for unsupervised disentanglement learning of complex density distributions. Numerous variants exist to encourage disentanglement in latent space while improving rec…
Disentanglement