首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 46 毫秒
1.
In this paper, a distributed time-varying convex optimization problem with inequality constraints is discussed based on neurodynamic system. The goal is to minimize the sum of agents’ local time-varying objective functions subject to some time-varying inequality constraints, each of which is known only to an individual agent. Here, the optimal solution is time-varying instead of constant. Under an undirected and connected graph, a distributed continuous-time consensus algorithm is designed by using neurodynamic system, signum functions and log-barrier penalty functions. The proposed algorithm can be understood through two parts: one part is used to reach consensus and the other is used to achieve gradient descent to track the optimal solution. Theoretical studies indicate that all agents will achieve consensus and the proposed algorithm can track the optimal solution of the time-varying convex problem. Two numerical examples are provided to validate the theoretical results.  相似文献   

2.
This paper tackles a distributed hybrid affine formation control (HAFC) problem for Euler–Lagrange multi-agent systems with modelling uncertainties using full-state feedback in both time-varying and constant formation cases. First, a novel two-layer framework is adopted to define the HAFC problem. Using the property of the affine transformation, we present the sufficient and necessary conditions of achieving the affine localizability. Because only parts of the leaders and followers can access to the desired formation information and states of the dynamic leaders, respectively, we design a distributed finite-time sliding-mode estimator to acquire the desired position, velocity, and acceleration of each agent. In the sequel, combined with the integral barrier Lyapunov functions, we propose a distributed formation control law for each leader in the first layer and a distributed affine formation control protocol for each follower in the second layer respectively with bounded velocities for all agents, meanwhile the adaptive neural networks are applied to compensate the model uncertainties. The uniform ultimate boundedness of all the tracking errors can be guaranteed by Lyapunov stability theory. Finally, corresponding simulations are carried out to verify the theoretical results and demonstrate that with the proposed control approach the agents can accurately and continuously track the given references.  相似文献   

3.
In this paper, the distributed optimal consensus control of a group of Euler-Lagrange systems under input saturation is considered. The objective function is only known by each agent itself. Meanwhile it is assumed that the velocities of the systems are unknown. To solve this problem, the filters and observers are designed for each agent. The magnitudes of the control input could be guaranteed within the bounds which are given in advance. It is shown that global optimal consensus control could be achieved under the proposed bounded controllers. The states of all agents will reach a consensus which minimizes the sum of the objective functions of all agents. Simulation results illustrate the effectiveness of the control schemes.  相似文献   

4.
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.  相似文献   

5.
《Journal of The Franklin Institute》2019,356(17):10196-10215
This paper deals with the large category of convex optimization problems on the framework of second-order multi-agent systems, where each distinct agent is assigned with a local objective function, and the overall optimization problem is defined as minimizing the sum of all the local objective functions. To solve this problem, two distributed optimization algorithms are proposed, namely, a time-triggered algorithm and an event-triggered algorithm, to make all agents converge to the optimal solution of the optimization problem cooperatively. The main advantage of our algorithms is to remove unnecessary communications, and hence reduce communication costs and energy consumptions in real-time applications. Moreover, in the proposed algorithms, each agent uses only the position information from its neighbors. With the design of the Lyapunov function, the criteria about the controller parameters are derived to ensure the algorithms converge to the optimal solution. Finally, numerical examples are given to illustrate the effectiveness of the proposed algorithms.  相似文献   

6.
This paper studies the cooperative fault-tolerant formation control problem of tracking a dynamic leader for heterogeneous multiagent systems consisting of multipile unmanned aerial vehicles (UAVs) and unmanned ground vehicles (UGVs) with actuator faults under switching directed interaction topologies. Based on local neighborhood formation information, the distributed fault-tolerant formation controllers are constructed to ensure that all follower UAVs and UGVs can accomplish the demanding formation configuration in the state space and track the dynamic leader’s trajectory. By incorporating the sliding mode control and adaptive control technique, the actuator faults and unknown parameters of follower agents can be compensated. Through the theoretical analysis, it is proved that the cooperatively semiglobally uniformly ultimately boundedness of the closed-loop system is guaranteed, and the formation tracking errors converge to a small adjustable neighborhood of the origin. A simulation example is introduced to show the validity of the proposed distributed fault-tolerant formation control algorithm.  相似文献   

7.
This paper investigates the consensus tracking problem of leader-follower multi-agent systems. Different from most existing works, dynamics of all the agents are assumed completely unknown, whereas some input-output data about the agents are available. It is well known from the Willems et al. Fundamental Lemma that when inputs of a linear time-invariant (LTI) system are persistently exciting, all possible trajectories of the system can be represented in terms of a finite set of measured input-output data. Building on this idea, the present paper proposes a purely data-driven distributed consensus control policy which allows all the follower agents to track the leader agent’s trajectory. It is shown that for a linear discrete-time multi-agent system, the corresponding controller can be designed to ensure the global synchronization with local data. Even if the data are corrupted by noises, the proposed approach is still applicable under certain conditions. Numerical examples corroborate the practical merits of the theoretical results.  相似文献   

8.
李默  杨彬 《科技与管理》2011,13(6):76-79,93
为了保证工程项目组合决策流程的顺利实施,将多主体系统应用于决策流程中,构建了基于多主体的工程项目组合决策流程模型。将具有自适应能力的决策主体作为模型的核心单元,设计了决策主体的逻辑结构和行为推理算法,并将工程项目组合决策流程划分为企业战略评定、单个项目评价、项目组合选择优化、项目组合执行控制以及项目组合调整5个阶段,分析了每个阶段的具体功能。最后通过模型在某建筑企业的具体应用证明了其有效性。  相似文献   

9.
This paper studies the multi-target localization and circumnavigation problem for a networked multi-agent system using bearing-only measurements. A more general case that only some of the agents are responsible for measuring the bearing angles with respect to the targets is considered. First, a novel estimator is developed for the agents to locate the targets collaboratively, based on which the geometric center of multi-target is reconstructed by each agent. Then, an estimator-based distributed controller is proposed to steer the agents, such that they can enclose the targets along different circles centered at the geometric center of multi-target with any desired angular spacing. By using Lyapunov stability theory, graph theory and consensus algorithm, global exponential stability of the overall system is analyzed rigorously. Besides, it is proved that bounded angular velocity of each agent and collision avoidance between the target and agent can be guaranteed in the whole movement process. Finally, numerical simulations are given to corroborate the theoretical results.  相似文献   

10.
This paper investigates the cooperative surrounding control problem for networked multi-agent systems with nonlinear Lagrangian dynamics. With the consideration of the target with constant and time-varying velocity, two cooperative surrounding control algorithms with collision avoidance are proposed, in which possible collision among agents is prevented so as to achieve a more reliable and safer performance. For the case when the target has a constant velocity, a velocity observer is designed firstly for each agent. Secondly, to handle the nonlinear dynamics and avoid collisions, the neural networks and potential functions are used for the controller design. Then, the cooperative surrounding control algorithm is proposed such that all the agents surround the target with the desired relative positions. For the case when the target has a time-varying velocity, the velocity observer is designed under the assumption that the target’s partial acceleration is known for each agent. Then, the cooperative surrounding control algorithm is proposed such that the surrounding error between the target and each agent is bounded. The main difference between these two algorithms is that the former can ensure the collision avoidance among target and agents, while the latter can do so only among agents because the target’s velocity is time-varying. The Lyapunov theory is used to prove the stability of the cooperative surrounding control algorithms. The simulation illustrates the effectiveness of the theoretical results.  相似文献   

11.
This paper is concerned with the distributed H∞-consensus control problem over the finite horizon for a class of discrete time-varying multi-agent systems with random parameters. First, by utilizing the proposed information matrix, a new formula is established to calculate the weighted covariance matrix of random matrix. Next, by allowing every agent to track the average of the neighbor agents, a novel local H∞-consensus performance constraint is presented to cater to the local performance analysis. Then, by means of the proposed definition of the stochastic vector dissipativity-like over the finite horizon, a set of sufficient conditions for every agent is obtained such that the controlled outputs of the closed-loop multi-agent systems satisfy the proposed H∞-consensus performance constraint. As a result, the proposed consensus control algorithm can be executed on each agent in an indeed distributed manner. Finally, a simulation example is employed to verify the effectiveness of the proposed algorithm.  相似文献   

12.
The tracking problem of high-order nonlinear multi-agent systems (MAS) with uncertainty is solved by designing adaptive sliding mode control. During the tracking process, node failures are possible to occur, a new agent replaces the failed one. Firstly, a distributed nonsingular terminal sliding mode(NTSM) control scheme is designed for the tracking agents. A novel continuous function is designed in the NTSM to eliminate the singularity and meanwhile guarantee the estimation of finite convergence time. Secondly, the unknown uncertainties in the tracking agents are compensated by proposing an adaptive mechanism in the NTSM. The adaptive mechanism adjusts the control input through estimating the derivative bound of the unknown uncertainties dynamically. Thirdly, the tracking problem with node failures and agent replacements is further investigated. Based on the constructed impulsive-dependent Lyapunov function, it is proved that the overall system will track the target in finite time even with increase of jump errors. Finally, comparison simulations are conducted to illustrate the effectiveness of proposed adaptive nonsingular terminal sliding mode control method for tracking systems suffering node failures.  相似文献   

13.
This paper proposes a privacy-preserving consensus algorithm which enables all the agents in the directed network to eventually reach the weighted average of initial states, and while preserving the privacy of the initial state of each agent. A novel privacy-preserving scheme is proposed in our consensus algorithm where initial states are hidden in random values. We also develop detailed analysis based on our algorithm, including its convergence property and the topology condition of privacy leakages for each agent. It can be observed that final consensus point is independent of their initial values that can be arbitrary random values. Besides, when an eavesdropper exists and can intercept the data transmitted on the edges, we introduce an index to measure the privacy leakage degree of agents, and then analyze the degree of privacy leakage for each agent. Similarly, the degree for network privacy leakage is derived. Subsequently, we establish an optimization problem to find the optimal attacking strategy, and present a heuristic optimization algorithm based on the Sequential Least Squares Programming (SLSQP) to solve the proposed optimization problem. Finally, numerical experiments are designed to demonstrate the effectiveness of our algorithm.  相似文献   

14.
《Journal of The Franklin Institute》2023,360(13):10100-10126
This paper studies the distributed optimal coordinated control problem for Euler–Lagrange multi-agent systems with connectivity preservation. The aim is to force agents to achieve the optimal solution minimizing the sum of the local objective functions while guaranteeing the connectivity of the communication graph. For practical purposes, the gradient vector of the local objective function is allowed to use only at the real-time generalized position instead of at the auxiliary system state. To make the control parameters independent of the global information and guarantee the fully distributed manner of controller, the adaptive control is introduced to update the coupling weights of the relative states among neighbors. Moreover, to reduce the resource for control updates, the event-driven communication is employed for the updates of both the relative states and the gradient of the connectivity-preserving potential function. Based on the Lyapunov analysis framework, it is proved that agents can converge to the optimal solution with connectivity preservation and Zeno behavior is excluded for the two event-triggering conditions. Finally, the effectiveness of the proposed method is verified by a numerical simulation example.  相似文献   

15.
This paper investigates the finite-time cooperative circumnavigation control of multiple second-order agents, in which the agents should surround a moving target with desired formation and circular velocity based on local information. Firstly, the controller design is transformed into design control parameters such that the error system, including distance error, speed error and angle error, is finite-time consensus. The error system is viewed as a cascaded system containing two second-order subsystems, and then a distributed finite-time controller composed of two parts is delivered. The finite-time stability of the entire system is given by employing cascaded control theory. One significant advantage of the proposed controller is that it allows the agents to converge to desired trajectory in a finite time instead of asymptotically. Another merit is that the desired formation is an extensive case and unlimited, including different tracking radii and angular spacing. Furthermore, the proposed controller can be implemented by each agent in its local frame, utilizing only local information. These properties significantly extend the application scope of cooperative circumnavigation. Finally, simulations are carried out to validate the effectiveness of the proposed method.  相似文献   

16.
《Journal of The Franklin Institute》2019,356(18):11581-11604
A solution is provided in this paper for the adaptive approximate consensus problem of nonlinear multi-agent systems with unknown and non-identical control directions assuming an underlying graph topology having a spanning tree. This is achieved with the introduction of a novel variable transformation called PI consensus error transformation. The new variables include the position error of each agent from some reference trajectory chosen by him, which represents the agent’s selection for the desired swarm trajectory, along with an integral term of the weighted total displacement of the agent’s position from all neighbor positions. It is proven that if these new variables are bounded and regulated to zero, then asymptotic approximate consensus among all agents is ensured. Using classical Nussbaum gain based techniques, distributed controllers are designed to regulate the PI consensus error variables to zero and ultimately solve the approximate agreement problem. The proposed approach also allows for a specific calculation of the final consensus trajectory based on the controller parameter selection and the associated graph topology. It is shown that all agent positions converge towards a neighborhood of the weighted average of all agents reference trajectories. Simulation results verify our theoretical derivations.  相似文献   

17.
We study the consensus control of discrete-time second-order multi-agents systems with time delays and multiplicative noises, where the consensus protocol is designed by both the local relative position measurements and each agent’s absolute velocity. Due to the existence of time delays and multiplicative noises, the classical methods for deterministic models with time delays cannot work. In this paper, we apply stochastic stability theorem of discrete-time stochastic delay equations to find some explicit sufficient conditions for both mean square and almost sure consensus. It is proven that for any given noise intensities and time delays, the second-order multi-agent consensus can be achieved by choosing appropriate control gains in the relative position measurement and absolute velocity, respectively. Numerical simulation is given to demonstrate the effectiveness of the proposed protocols as well as the theoretical results.  相似文献   

18.
In this paper, we investigate the output synchronization of networked SISO nonlinear systems that can be transformed into semi-strict feedback form. Due to parameter uncertainty, the agents have heterogeneous dynamics. Combined backstepping method together with graph theory, we construct an augmented Laplacian potential function for analysis and a distributed controller is designed recursively for each agent such that its output can be synchronized to its neighbors' outputs. The distributed controller of each agent has three parts: state feedback of itself, neighborhood information transmitted through the network and adaptive parameter updaters both for itself and its neighbors. Moreover, distributed tuning function is designed to minimize the order of the parameter updater. It is proved that when the undirected graph is connected, all agents’ outputs in the network can be synchronized, i.e., cooperative output synchronization of the network is realized. Simulation results are presented to verify the effectiveness of the proposed controllers.  相似文献   

19.
A novel adaptive event-triggered control protocol is developed to investigate the tracking control problem of multi-agent systems with general linear dynamics. By introducing the event-triggered control strategy, each agent can decide when to transfer its state to its neighbors at its own triggering instants, which can greatly reduce communication burden of agents. It is shown that the “Zeno phenomenon” does not occur by verifying that there exists a positive lower bound on the inter-event time intervals of agents under the proposed adaptive event-triggered control algorithm. Finally, an example is provided to testify the effectiveness of the obtained theoretical results.  相似文献   

20.
In this paper, the subspace identification based robust fault prediction method which combines optimal track control with adaptive neural network compensation is presented for prediction the fault of unknown nonlinear system. At first, the local approximate linear model based on input-output of unknown system is obtained by subspace identification. The optimal track control is adopted for the approximate model with some unknown uncertainties and external disturbances. An adaptive RBF neural network is added to the track control in order to guarantee the robust tracking ability of the observation system. The effect of the system nonlinearity and the error caused by subspace modeling can be overcome by adaptive tuning of the weights of the RBF neural network online without any requisition of constraint or matching conditions. The stability of the designed closed-loop system is thus proved. A density function estimation method based on state forecasting is then used to judge the fault. The proposed method is applied to fault prediction of model-unknown fighter F-8II of China airforce and the simulation results show that the proposed method can not only predict the fault, but has strong robustness against uncertainties and external disturbances.  相似文献   

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

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