This paper solves the rendezvous problem for a network of underactuated rigid bodies such as quadrotor helicopters. A control strategy is presented that makes the centres of mass of the vehicles converge to an arbitrarily small neighborhood of one another. The convergence is global, and each vehicle can compute its own control input using only an on-board camera and a three-axis rate gyroscope. No global positioning system is required, nor any information about the vehicles' attitudes.
Typical coordination problems include attitude synchronization, rendezvous, flocking, and formation control. For networks of single or double-integrator systems, the rendezvous problem is referred to as consensus or agreement , and it has been investigated by many researchers, for instance @cite_34 @cite_8 @cite_2 @cite_14 @cite_12 @cite_22 @cite_5 @cite_30 .
@cite_30 @cite_14 @cite_22 @cite_8 @cite_2 @cite_5 @cite_34 @cite_12
2024571424 2025713377 2070842753 2030056867
Two related problems are treated in continuous time. First, the state agreement problem is studied for coupled nonlinear differential equations. The vector fields can switch within a finite family. Associated to each vector field is a directed graph based in a natural way on the interaction structure of the subsystems. Generalizing the work of Moreau, under the assumption that the vector fields satisfy a certain subtangentiality condition, it is proved that asymptotic state agreement is achieved if and only if the dynamic interaction digraph has the property of being sufficiently connected over time. The proof uses nonsmooth analysis. Second, the rendezvous problem for kinematic point-mass mobile robots is studied when the robots’ fields of view have a fixed radius. The circumcenter control law of Ando e [IEEE Trans. Robotics Automation, 15 (1999), pp. 818-828] is shown to solve the problem. The rendezvous problem is a kind of state agreement problem, but the interaction structure is state dependent. The consensus problem is at the heart of solutions related to the development of modern reliable distributed systems. This paper studies necessary and sufficient conditions under which fault-tolerant consensus become solvable in dynamic systems and self-organizing networks. Those conditions are related to the synchrony requirements of the environment, to the connectivity of the knowledge graph constructed by the nodes in order to communicate with their peers, as well as to the knowledge about global parameters in the system, such as, the total number of participants and the maximum number of node crashes. This paper addresses the connectedness issue in multiagent coordination, i.e., the problem of ensuring that a group of mobile agents stays connected while achieving some performance objective. In particular, we study the rendezvous and the formation control problems over dynamic interaction graphs, and by adding appropriate weights to the edges in the graphs, we guarantee that the graphs stay connected. In this paper, distributed cooperative attitude synchronization and tracking problems are considered for multiple rigid bodies with attitudes represented by modified rodriguez parameters. Two distributed control laws are proposed and analyzed. The first control law applies a passivity approach for distributed attitude synchronization. The control law guarantees attitude synchronization without the requirement for absolute angular velocity measurements and relative angular velocity measurements between neighboring rigid bodies. The second control law incorporates a time-varying reference attitude, where the reference attitude is allowed to be available to only a subset of the group members under general directed information exchange. The control law guarantees that all rigid bodies track the time-varying reference attitude as long as a virtual leader whose attitude is the time-varying reference attitude has a directed path to all other rigid bodies in the group. Simulation results are presented to demonstrate the effectiveness of the two control laws.