1,255 research outputs found

    Second-Order Consensus of Networked Mechanical Systems With Communication Delays

    Full text link
    In this paper, we consider the second-order consensus problem for networked mechanical systems subjected to nonuniform communication delays, and the mechanical systems are assumed to interact on a general directed topology. We propose an adaptive controller plus a distributed velocity observer to realize the objective of second-order consensus. It is shown that both the positions and velocities of the mechanical agents synchronize, and furthermore, the velocities of the mechanical agents converge to the scaled weighted average value of their initial ones. We further demonstrate that the proposed second-order consensus scheme can be used to solve the leader-follower synchronization problem with a constant-velocity leader and under constant communication delays. Simulation results are provided to illustrate the performance of the proposed adaptive controllers.Comment: 16 pages, 5 figures, submitted to IEEE Transactions on Automatic Contro

    COORDINATION OF LEADER-FOLLOWER MULTI-AGENT SYSTEM WITH TIME-VARYING OBJECTIVE FUNCTION

    Get PDF
    This thesis aims to introduce a new framework for the distributed control of multi-agent systems with adjustable swarm control objectives. Our goal is twofold: 1) to provide an overview to how time-varying objectives in the control of autonomous systems may be applied to the distributed control of multi-agent systems with variable autonomy level, and 2) to introduce a framework to incorporate the proposed concept to fundamental swarm behaviors such as aggregation and leader tracking. Leader-follower multi-agent systems are considered in this study, and a general form of time-dependent artificial potential function is proposed to describe the varying objectives of the system in the case of complete information exchange. Using Lyapunov methods, the stability and boundedness of the agents\u27 trajectories under single order and higher order dynamics are analyzed. Illustrative numerical simulations are presented to demonstrate the validity of our results. Then, we extend these results for multi-agent systems with limited information exchange and switching communication topology. The first steps of the realization of an experimental framework have been made with the ultimate goal of verifying the simulation results in practice

    Adaptive Network Dynamics and Evolution of Leadership in Collective Migration

    Full text link
    The evolution of leadership in migratory populations depends not only on costs and benefits of leadership investments but also on the opportunities for individuals to rely on cues from others through social interactions. We derive an analytically tractable adaptive dynamic network model of collective migration with fast timescale migration dynamics and slow timescale adaptive dynamics of individual leadership investment and social interaction. For large populations, our analysis of bifurcations with respect to investment cost explains the observed hysteretic effect associated with recovery of migration in fragmented environments. Further, we show a minimum connectivity threshold above which there is evolutionary branching into leader and follower populations. For small populations, we show how the topology of the underlying social interaction network influences the emergence and location of leaders in the adaptive system. Our model and analysis can describe other adaptive network dynamics involving collective tracking or collective learning of a noisy, unknown signal, and likewise can inform the design of robotic networks where agents use decentralized strategies that balance direct environmental measurements with agent interactions.Comment: Submitted to Physica D: Nonlinear Phenomen

    Fully distributed consensus for high-order strict-feedback nonlinear multiagent systems with switched topologies

    Get PDF
    summary:This paper studies the distributed consensus problem of high-order strict-feedback nonlinear multiagent systems. By employing the adaptive backstepping technique and switched system theory, a novel protocol is proposed for MASs with switched topologies. Global information such as the number of agents and communication topology is not used. In addition, the communication topology between agents can be switched between possible topologies at any time. Based on the Lyapunov function method, the proposed adaptive protocol guarantees the complete consensus of multiagent systems without restricting the dwell time of the switched signal. Finally, two numerical examples are provided to illustrate the effectiveness and advantages of the given protocol

    Partial containment control over signed graphs

    Get PDF
    In this paper, we deal with the containment control problem in presence of antagonistic interactions. In particular, we focus on the cases in which it is not possible to contain the entire network due to a constrained number of control signals. In this scenario, we study the problem of selecting the nodes where control signals have to be injected to maximize the number of contained nodes. Leveraging graph condensations, we find a suboptimal and computationally efficient solution to this problem, which can be implemented by solving an integer linear problem. The effectiveness of the selection strategy is illustrated through representative simulations.Comment: 6 pages, 3 figures, accepted for presentation at the 2019 European Control Conference (ECC19), Naples, Ital

    Static consensus in passifiable linear networks

    Get PDF
    Sufficient conditions of consensus (synchronization) in networks described by digraphs and consisting of identical determenistic SIMO systems are derived. Identical and nonidentical control gains (positive arc weights) are considered. Connection between admissible digraphs and nonsmooth hypersurfaces (sufficient gain boundary) is established. Necessary and sufficient conditions for static consensus by output feedback in networks consisting of certain class of double integrators are rediscovered. Scalability for circle digraph in terms of gain magnitudes is studied. Examples and results of numerical simulations are presented.Comment: 13 pages, 5 figure
    • …
    corecore