We solve output- and state-consensus problems for multi-agent high-order systems in feedback form. We consider systems interconnected over arbitrary (connected) undirected-topology networks as well as directed spanning-trees and directed cycles. We assume that the systems may be subject to multiple restrictions in the form of output or state constraints, such as limited-range measurements, physical limitations, etc. In addition, we suppose that the systems may be subject to external disturbances. Under these conditions, we present a control framework and a formal analysis that establishes robust stability in the input-to-state sense. The former relies on a modified backstepping method and the latter on multi-stability theory. Finally, we apply our approach to a case-study of interest in the aerospace industry: safety-aware rendezvous control of underactuated UAVs subject to connectivity and collision-avoidance constraints.
6 April 2023 in IEEE Transactions on Automatic Control
We propose a solution to the full consensus-based formation problem for torque-controlled nonholonomic mobile robots under time-varying communication delays and without velocity measurements. Under the assumptions of static and undirected communication topologies, and smooth and bounded delays, we propose a distributed smooth, time-varying control law which achieves the goal of acquiring a global formation pattern in a common consensus point for both position and orientation. The controller is a combination of a simple Proportional-Plus-Damping scheme and a simple globally exponentially convergent velocity observer. Consensus is reached independently of all initial conditions. Realistic simulations in the Gazebo-ROS environment illustrate the effectiveness of the proposed algorithm and the robustness with respect to measurement noise, non-smooth delays and uncertain dynamics.
We solve the full-consensus problem (in position and orientation) with connectivity maintenance for multiple nonholonomic vehicles in a leader-follower configuration. We rely on a polar-coordinates based model which is more natural for the problem setting. The proposed control law is smooth (in the domain of definition) time-invariant and uses only relative measurements, making it more suited for implementation. We establish asymptotic convergence to the consensus manifold as well as connectivity maintenance using the Lyapunov’s first method and cascaded systems theory. In addition, we illustrate our theoretical contributions experimentally .
4 February 2022 in IEEE Transactions on Control Systems Technology
We address the problem of making nonholonomic vehicles, with second-order dynamics and interconnected over a bidirectional network, converge to a formation centered at a nonprespecified point on the plane with a nonprespecified common orientation. We assume that only the Cartesian position of the center of mass of each vehicle and its orientation are available for measurement, but not the velocities. In addition, we assume that the interconnections are affected by time-varying delays. Our control method consists in designing a set of second-order systems that are interconnected with the robots’ dynamics through virtual springs and transmit their own coordinates to achieve consensus. This and the virtual elastic couplings with the vehicles make the latter achieve consensus too. To the best of our knowledge, output-feedback consensus control of underactuated nonholonomic vehicles has been little studied, all the less in the presence of delays.
1 December 2023 in IEEE Transactions on Control of Network Systems
We propose an approach for simultaneous topology identification and synchronization of a complex dynamical network with directed interconnections that relies on the edge-agreement framework and on adaptive-control approaches by design of an auxiliary synchronizing network. Our method guarantees the identification of the unknown directed topology without the need for verifying the Linear Independence Conditions normally required by previous works in the literature. Furthermore, it also guarantees that the complex network reaches synchronization as determined by the internal dynamics of the system. Under our identification algorithm we provide strong stability results for the estimation errors in the form of uniform semiglobal practical asymptotic stability of the estimation errors. Finally, we demonstrate the effectiveness of our approach with a numerical example.
10 August 2020 in International Journal of Control
We address the consensus problem, with guarantee of connectivity maintenance, for multiagent systems of first and second order, communicating over a connected, undirected graph with proximity constraints. Our approach relies on so-called barrier Lyapunov functions, which encode the distance constraints between pairs of agents. Beyond the consensus algorithms, our primary contribution is to provide strict barrier Lyapunov functions, i.e., positive definite and with negative definite derivative in the agreement subspace. Thus, uniform asymptotic stability of the consensus manifold and the maintenance of the connectivity are guaranteed. Furthermore, with the said barrier functions, we demonstrate the robustness of consensus protocols by establishing global input-to-state stability.