首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 32 毫秒
1.
This paper researches the output consensus problem of heterogeneous linear multi-agent systems with cooperative and antagonistic interactions. Two fixed-time state compensator control approaches, one static dynamic and the other distributed adaptive dynamic, are considered for heterogeneous systems subject to logarithmic quantization. Then, a fixed-time output regulation control protocol is constructed to cope with the problem of bipartite output consensus and adaptive fixed-time output consensus of heterogeneous systems which is fully distributed without any global information. Besides, the fully distributed adaptive algorithm is employed to calculate the system matrix of leader and it’s also effectively eliminated the harmful chattering. Finally, two simulations are carried out to testify the feasibility of theoretical results.  相似文献   

2.
This paper considers a nonsmooth constrained distributed convex optimization over multi-agent systems. Each agent in the multi-agent system only has access to the information of its objective function and constraint, and cooperatively minimizes the global objective function, which is composed of the sum of local objective functions. A novel continuous-time algorithm is proposed to solve the distributed optimization problem and effectively characterize the appropriate gain of the penalty function. It should be noted that the proposed algorithm is based on an adaptive strategy to avoid introducing the primal-dual variables and estimating the related exact penalty parameters. Additional, it is demonstrated that the state solution of the proposed algorithm achieves consensus and converges to an optimal solution of the optimization problem. Finally, numerical simulations are given and the proposed algorithm is applied to solve the optimal placement problem and energy consumption problem.  相似文献   

3.
This paper focuses on the fixed-time leader-following consensus problem for multiple Euler–Lagrange (EL) systems via non-singular terminal sliding mode control under a directed graph. Firstly, for each EL system, a local fixed-time disturbance observer is introduced to estimate the compound disturbance (including uncertain parameters and external disturbances) within a fixed time under the assumption that the disturbance is bounded. Next, a distributed fixed-time observer is designed to estimate the leader’s position and velocity, and the consensus problem is transformed into a local tracking problem by introducing such an observer. On the basis of the two types of observers designed, a novel non-singular terminal sliding surface is proposed to guarantee that the tracking errors on the sliding surface converge to zero within a fixed time. Furthermore, the presented control algorithm also ensures the fixed-time reachability of the sliding surface, while avoiding the singularity problem. Finally, the effectiveness of the proposed observers and control protocol is further verified by a numerical simulation.  相似文献   

4.
In this paper, we mainly tend to consider distributed leader-following fixed-time quantized consensus problem of nonlinear multi-agent systems via impulsive control. An appropriate quantized criterion and some novel control protocols are proposed in order to solve the problem. The protocols proposed integrates the two control strategies from the point of view of reducing communication costs and constraints, which are quantized control and impulsive control. The fixed-time quantized consensus of multi-agent is analyzed in terms of algebraic graph theory, Lyapunov theory and comparison system theory, average impulsive interval. The results show that if some sufficient conditions are met, the fixed-time consensus of multi-agent systems can be guaranteed under impulsive control with quantized relative state measurements. In addition, compared with finite-time consensus, the settling-time of fixed-time quantized consensus does not depend on the initial conditions of each agent but on the parameters of the protocol. Finally, numerical simulations are exploited to illustrate the effectiveness and performance to support our theoretical analysis.  相似文献   

5.
In this paper, fixed-time consensus tracking problems under directed interaction topologies for second-order non-linear multi-agent systems with disturbance and second-order multi-agent systems with input delay are investigated. Two continuous integral terminal sliding modes are designed, which can effectively eliminate the singularity and chattering. Correspondingly, two fixed-time distributed control protocols are proposed based on the designed continuous ITSM to ensure that the consensus tracking are achieved in fixed-time. It is shown that the upper bounds of settling time are regardless of initial conditions. The rigorous proofs are given by employing Lyapunov stability theory and fixed-time stability theory. Simulations are provided to verify the effectiveness of the theoretical results.  相似文献   

6.
In this paper, a distributed projection algorithm based on the subgradient method is presented to solve the distributed optimization problem with a constrained set over a directed multi-agent network, where the designed protocol is scaled by the left eigenvector associated with the weighted adjacency matrix. By using the property of the projection operation and nonnegative almost supermartingales, we give the convergence analysis of our algorithm and show that the optimal solution is the ultimate consensus state of all agents to be reached. A numerical simulation for a specific optimization problem is given to verify the effectiveness of our algorithm.  相似文献   

7.
This study investigates the distributed fault-tolerant output regulation for heterogeneous linear multi-agent systems in the presence of actuator faults. For the systems which are not the neighbors of exosystem, the distributed fixed-time observer is put forward to observe the state of exosystem. Note that it is dependent on the global information of network topology. To address this issue, the fully distributed adaptive fixed-time observer is further proposed. It can estimate not only the state of exosystem, but also the system matrix of exosystem. Based on the proposed observer, a novel fault-tolerant controller is developed to compensate for actuator faults. Moreover, it is proven that the proposed controller is effective to address the fault-tolerant output regulation problem by the Lyapunov stability theory. Finally, two illustrative examples are given to illustrate the feasibility of the main theoretical findings.  相似文献   

8.
In recent years, distributed algorithms have been increasingly used to solve the economic dispatch (ED) problem of multi-energy systems (MES) due to the advantages of high flexibility, strong robustness, and privacy. However, the MES based on the distributed optimization architecture must bear higher cyber-attack risks, so as to maintain the safe and stable operation of MES. To address this issue, an event-triggered fully distributed algorithm is proposed to solve the ED problem, which can effectively mitigate the communication burden. On this basis, an attack resilient strategy against false data injection (FDI) attacks is implemented in the proposed fully distributed algorithm, which can eliminate incorrect measurement of incremental cost and power generation data caused by cyber-attacks. In addition, a reputation value protocol embedded in the proposed attack resilient strategy is designed to effectively reduce the potential of direct isolation of the node. Finally, case studies are given in this paper to validate the effectiveness of the proposed distributed control scheme on a 9-bus MES.  相似文献   

9.
《Journal of The Franklin Institute》2022,359(17):10267-10280
This paper investigates the distributed prescribed- time optimization for time-varying objective functions. As opposed to the state-of-the-art in this field, our protocol is developed upon the methodology of time-domain transformation, based on which original prescribed-time problem is simplified as uniformly bounded counterpart in new spatiotemporal coordinate. Compared with the finite- and fixed-time works, the settling time of both consensus and optimization is independent of initial states as well as other parameters and therefore can be completely prespecified. Besides, the selection of parameters is free of any global information, which implies its feasibility in even fully distributed scenarios. Finally, a simulation is performed on cooperative hunting problem to validate the effectiveness of theoretical results.  相似文献   

10.
In this paper, we study the fixed-time consensus problem for multi-agent systems with structurally balanced signed graph. A new class of fixed-time nonlinear consensus protocols is designed by employing the neighbor’s information. By using Lyapunov stability method, states of all agents can be guaranteed to reach agreement in a fixed time under our presented protocols, and the consensus values are the same in modulus but different in sign. Moreover, it is shown that the settling time is not dependent on the initial conditions, and it makes a good convenience to estimate the convergence time by just knowing the graph topology and the information flow of the multi-agent systems. Finally, two numerical examples are given to demonstrate the effectiveness of the proposed consensus protocols.  相似文献   

11.
In this paper, a distributed consensus algorithm for multi-mobile robot systems (MMRSs) with communication delays is proposed based on the Udwadia-Kalaba (UK) approach. The key feature of the proposed algorithm is that the consensus requirement is configured as a second-order constraint, and then a concise and explicit equation of motion for the constrained mechanical systems is formulated. Furthermore, the necessary and sufficient conditions for achieving the consensus of MMRSs with or without communication delays are developed under the network topology possessing a directed spanning tree. Finally, some numerical simulations are performed to verify the validity of the proposed consensus algorithm.  相似文献   

12.
In this paper, a protocol is proposed for fixed-time consensus of the high-order chained-form multi-agent systems subject to non-holonomic constraints. By employing the backstepping structure and a power integrator, the distributed fixed-time protocol is designed to guarantee that system states reach consensus before a fixed time. The fixed settling time can be calculated explicitly, and it is independent of initial conditions. The proposed protocol is applied to multi-agent wheeled mobile robots to support the theoretical result.  相似文献   

13.
In this paper, a finite-horizon H∞ consensus control problem is studied for multi-agent systems under the limited energy constraint. Due to the limited energy, only a part of agents can use high energy to transmit information infallibly, and the remaining agents are randomly allocated low energy with several levels, which may lead to packet loss in some sense. Different levels result in different packet dropout probability. The purpose of this paper is to design a probability-dependent controller such that, for all probabilistic energy allocation and packet dropout, the H∞ consensus performance can be guaranteed for multi-agent systems over a finite horizon. To this end, a stochastic and high-availability energy allocation method is first presented via stratified multi-objective optimization methods and stochastic analysis methods. Based on this novel allocation, a H∞ consensus controller depending on the varying energy allocation is established. Furthermore, in terms of the probability information of both energy allocation and packet dropout, important results are obtained to guarantee the desired performance of the designed probability-dependent controller, and the controller are explicitly parameterized by means of the solutions to a set of linear matrix inequalities. Finally, a simulation example is utilized to illustrate the usefulness of the proposed controller design method.  相似文献   

14.
The design of fixed-time scaled consensus protocol for multi-agent systems with input delay is developed in this article. First, by virtue of Artstein model reduction method, the time-delay system is converted into a delay-free one. Then, two novel controllers are designed such that the fixed-time scaled consensus of multi-agent systems can be realized for the undirected and directed topology, respectively. Sufficient conditions are derived to guarantee that all agents converge to the assigned ratios instead of the same value under any bounded input delay. Besides, an explicit estimate can be given for the uniform convergence time independent of the initial conditions. Moreover, it is proved that the convergence value of the system is not affected by the initial states of agents any more, but only related to initial states of the virtual agents set in advance. Finally, numerical simulations are given to demonstrate the feasibility of the proposed algorithms.  相似文献   

15.
In a multi-agent framework, distributed optimization problems are generally described as the minimization of a global objective function, where each agent can get information only from a neighborhood defined by a network topology. To solve the problem, this work presents an information-constrained strategy based on population dynamics, where payoff functions and tasks are assigned to each node in a connected graph. We prove that the so-called distributed replicator equation (DRE) converges to an optimal global outcome by means of the local-information exchange subject to the topological constraints of the graph. To show the application of the proposed strategy, we implement the DRE to solve an economic dispatch problem with distributed generation. We also present some simulation results to illustrate the theoretic optimality and stability of the equilibrium points and the effects of typical network topologies on the convergence rate of the algorithm.  相似文献   

16.
率失真优化技术在视频优化编码中起着重要的作用，广泛地应用于宏块模式决策，优化量化等编码模块中。本文将率失真优化编码与码率控制结合起来进行研究，通过对率失真关系的分析，提出了基于率失真优化的复杂度可分级码率控制算法，并根据缓冲区操作模型的位分配约束条件调整码率控制的位分配过程，从而使得该算法能够在达到码率控制的同时也能取得较高的编码效率，并能保证缓冲区不会发生溢出，然后结合场景变换、图像内容分类等主观质量问题研究，提出一种恒定质量码率控制编码算法。  相似文献   

17.
This paper is concerned with a consensus problem of a class of second-order multi-agent systems with nonuniform time-delays. A distributed consensus algorithm is adopted to drive all agents to reach consensus and move together with a constant velocity. By a frequency domain approach, an upper bound on the maximum of the time-delays that can be tolerated is given for the consensus of the system.  相似文献   

18.
In distributed and cooperative systems, the network structure is determinant to the success of the strategy adopted to solve complex tasks. Those systems are primarily governed by consensus protocols whose convergence is intrinsically dependent on the network topology. Most of the consensus algorithms deal with continuous values and perform average-based strategies to reach cohesion over the exchanged information. However, many problems demand distributed consensus over countable values, that cannot be handled by traditional protocols. In such a context, this work presents an approach based on semidefinite programming to design the optimal weights of a network adjacency matrix, in order to control the convergence of a distributed random consensus protocol for variables at the discrete-space domain, based on the voter model. As a second contribution, this work uses Markov theory and the biological inspiration of epidemics to find out a dynamical spreading model that can predict the information diffusion over this discrete consensus protocol. Also, convergence properties and equilibrium points of the proposed model are presented regarding the network topology. Finally, extensive numerical simulations evaluate the effectiveness of the proposed consensus algorithm, its spreading model, and the approach for optimal weight design.  相似文献   

19.
《Journal of The Franklin Institute》2021,358(18):10004-10028
In this paper, the consensus problem is considered for multi-agent systems with input constraint under directed graphs, including leaderless and leader-following cases. Different from existing related works, the distinct feature of this paper is that both the amplitude and rate of the agents’ input are ensured in the given ranges. For the leaderless case, the saturation control strategy is designed and employed for multi-agent systems consensus with the aid of a novel saturation function. For the leader-following case, the saturation-function-based distributed observer as well as the observer-based saturation controller are proposed to achieve consensus. Finally, simulation results show the effectiveness of the designed methods.  相似文献   

20.
Task assignment, the core problem of Spatial Crowdsourcing (SC), is often modeled as an optimization problem with multiple constraints, and the quality and efficiency of its solution determines how well the SC system works. Fairness is a critical aspect of task assignment that affects worker participation and satisfaction. Although the existing studies on SC have noticed the fairness problem, they mainly focus on fairness at the individual level rather than at the group level. However, differences among groups in certain attributes (e.g. race, gender, age) can easily lead to discrimination in task assignment, which triggers ethical issues and even deteriorates the quality of the SC system. Therefore, we study the problem of task assignment with group fairness for SC. According to the principle of fair budget allocation, we define a well-designed constraint that can be considered in the task assignment problem of SC systems, resulting in assignment with group fairness. We mainly consider the task assignment problem in a common One-to-One SC system (O2-SC), and our goal is to maximize the quality of the task assignment while satisfying group fairness and other constraints such as budget and spatial constraints. Specifically, we first give the formal definition of task assignment with group fairness constraint for O2-SC. Then, we prove that it is essentially an NP-hard combinatorial optimization problem. Next, we provide a novel fast algorithm with theoretical guarantees to solve it. Finally, we conduct extensive experiments using both synthetic and real datasets. The experimental results show that the proposed constraint can significantly improve the group fairness level of algorithms, even for a completely random algorithm. The results also show that our algorithm can efficiently and effectively complete the task assignment of SC systems while ensuring group fairness.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号