333 research outputs found

    Iterative learning control for multi-agent systems with impulsive consensus tracking

    Get PDF
    In this paper, we adopt D-type and PD-type learning laws with the initial state of iteration to achieve uniform tracking problem of multi-agent systems subjected to impulsive input. For the multi-agent system with impulse, we show that all agents are driven to achieve a given asymptotical consensus as the iteration number increases via the proposed learning laws if the virtual leader has a path to any follower agent. Finally, an example is illustrated to verify the effectiveness by tracking a continuous or piecewise continuous desired trajectory

    On leaderless consensus of fractional-order nonlinear multi-agent systems via event-triggered control

    Get PDF
    The consensus problem of fractional-order multi-agent systems is investigated by eventtriggered control in this paper. Based on the graph theory and the Lyapunov functional approach, the conditions for guaranteeing the consensus are derived. Then, according to some basic theories of fractional-order differential equation and some properties of Mittag–Leffler function, the Zeno behavior could be excluded. Finally, a simulation example is given to check the effectiveness of the theoretical result

    Consensus tracking problem for linear fractional multi-agent systems with initial state error

    Get PDF
    In this paper, we discuss the consensus tracking problem by introducing two iterative learning control (ILC) protocols (namely, Dα-type and PDα-type) with initial state error for fractional-order homogenous and heterogenous multi-agent systems (MASs), respectively. The initial state of each agent is fixed at the same position away from the desired one for iterations. For both homogenous and heterogenous MASs, the Dα-type ILC rule is first designed and analyzed, and the asymptotical convergence property is carefully derived. Then, an additional P-type component is added to formulate a PDα-type ILC rule, which also guarantees the asymptotical consensus performance. Moreover, it turns out that the PDα-type ILC rule can further adjust the final performance. Two numerical examples are provided to verify the theoretical results

    Data-Driven Architecture to Increase Resilience In Multi-Agent Coordinated Missions

    Get PDF
    The rise in the use of Multi-Agent Systems (MASs) in unpredictable and changing environments has created the need for intelligent algorithms to increase their autonomy, safety and performance in the event of disturbances and threats. MASs are attractive for their flexibility, which also makes them prone to threats that may result from hardware failures (actuators, sensors, onboard computer, power source) and operational abnormal conditions (weather, GPS denied location, cyber-attacks). This dissertation presents research on a bio-inspired approach for resilience augmentation in MASs in the presence of disturbances and threats such as communication link and stealthy zero-dynamics attacks. An adaptive bio-inspired architecture is developed for distributed consensus algorithms to increase fault-tolerance in a network of multiple high-order nonlinear systems under directed fixed topologies. In similarity with the natural organisms’ ability to recognize and remember specific pathogens to generate its immunity, the immunity-based architecture consists of a Distributed Model-Reference Adaptive Control (DMRAC) with an Artificial Immune System (AIS) adaptation law integrated within a consensus protocol. Feedback linearization is used to modify the high-order nonlinear model into four decoupled linear subsystems. A stability proof of the adaptation law is conducted using Lyapunov methods and Jordan decomposition. The DMRAC is proven to be stable in the presence of external time-varying bounded disturbances and the tracking error trajectories are shown to be bounded. The effectiveness of the proposed architecture is examined through numerical simulations. The proposed controller successfully ensures that consensus is achieved among all agents while the adaptive law v simultaneously rejects the disturbances in the agent and its neighbors. The architecture also includes a health management system to detect faulty agents within the global network. Further numerical simulations successfully test and show that the Global Health Monitoring (GHM) does effectively detect faults within the network

    Exponential state estimation for competitive neural network via stochastic sampled-data control with packet losses

    Get PDF
    This paper investigates the exponential state estimation problem for competitive neural networks via stochastic sampled-data control with packet losses. Based on this strategy, a switched system model is used to describe packet dropouts for the error system. In addition, transmittal delays between neurons are also considered. Instead of the continuous measurement, the sampled measurement is used to estimate the neuron states, and a sampled-data estimator with probabilistic sampling in two sampling periods is proposed. Then the estimator is designed in terms of the solution to a set of linear matrix inequalities (LMIs), which can be solved by using available software. When the missing of control packet occurs, some sufficient conditions are obtained to guarantee that the exponentially stable of the error system by means of constructing an appropriate Lyapunov function and using the average dwell-time technique. Finally, a numerical example is given to show the effectiveness of the proposed method

    Delay-Dependent Stability Region for the Distributed Coordination of Delayed Fractional-Order Multi-Agent Systems

    Get PDF
    Delay and especially delay in the transmission of agents’ information, is one of the most important causes of disruption to achieving consensus in a multi-agent system. This paper deals with achieving consensus in delayed fractional-order multi-agent systems (FOMAS). The aim in the present note is to find the exact maximum allowable delay in a FOMAS with non-uniform delay, i.e., the case in which the interactions between agents are subject to non-identical communication time-delays. By proving a stability theorem, the results available for non-delayed networked fractional-order systems are extended for the case in which interaction links have nonequal communication time-delays. In this extension by considering a time-delay coordination algorithm, necessary and sufficient conditions on the time delays and interaction graph are presented to guarantee the coordination. In addition, the delay-dependent stability region is also obtained. Finally, the dependency of the maximum allowable delay on two parameters, the agent fractional-order and the largest eigenvalue of the graph Laplacian matrix, is exactly determined. Numerical simulation results are given to confirm the proposed methodologies

    Iterative learning control for impulsive multi-agent systems with varying trial lengths

    Get PDF
    In this paper, we introduce iterative learning control (ILC) schemes with varying trial lengths (VTL) to control impulsive multi-agent systems (I-MAS). We use domain alignment operator to characterize each tracking error to ensure that the error can completely update the control function during each iteration. Then we analyze the system’s uniform convergence to the target leader. Further, we use two local average operators to optimize the control function such that it can make full use of the iteration error. Finally, numerical examples are provided to verify the theoretical results

    Self-triggered Consensus of Multi-agent Systems with Quantized Relative State Measurements

    Full text link
    This paper addresses the consensus problem of first-order continuous-time multi-agent systems over undirected graphs. Each agent samples relative state measurements in a self-triggered fashion and transmits the sum of the measurements to its neighbors. Moreover, we use finite-level dynamic quantizers and apply the zooming-in technique. The proposed joint design method for quantization and self-triggered sampling achieves asymptotic consensus, and inter-event times are strictly positive. Sampling times are determined explicitly with iterative procedures including the computation of the Lambert WW-function. A simulation example is provided to illustrate the effectiveness of the proposed method.Comment: 29 pages, 3 figures. To appear in IET Control Theory & Application
    • …
    corecore