RESUMEN
This article investigates an optimized containment control problem for multiagent systems (MASs), where all followers are subject to deferred full-state constraints. A universal nonlinear transformation is proposed for simultaneously handling the cases with and without constraints. Particularly, for the constrained case, initial values of states are flexibly managed to the midpoint between upper and lower boundaries by utilizing a state-shifting function, thus eliminating the initial restriction conditions. By deferred constraints, the state is forced to fall back into the restrictive boundaries within a preassigned time. A neural network (NN)-based reinforcement learning (RL) algorithm is executed under the identifier-critic-actor architecture, where the Hamilton-Jacobi-Bellman (HJB) equation is built in every subsystem to optimize control performance. For actor and critic NNs, updating laws are simplified, since the gradient descent method is performed based on a simple positive function rather than square of Bellman residual error. In view of the Lyapunov stability theorem and graph theory, it is proved that all signals are bounded and the outputs of followers can eventually enter into the convex hull constituted by leaders. Finally, simulations confirm the validity of the proposed approach.
RESUMEN
In this article, a new leader-following tracking control approach is investigated for stochastic multiagent systems with multibridge-hole output constraints. The multibridge-hole output constraints mean that the output of the system is constrained in some intervals and unconstrained in other intervals. The constrained and unconstrained intervals can be set arbitrarily. By designing a new shift function to construct the barrier Lyapunov function, the optimal controller is constructed by combining the backstepping technique with the adaptive dynamic programming technique. The model network is used to estimate the unknown disturbances and uncertainty terms in the system. The critic network and the actor network are constructed such that the designed controller adheres to the Bellman optimality principle and gives the optimal solution of the system. The proposed control method is versatile and compatible with various types of output constrained control problems, such as unconstrained control problems, constrained control problems, and delay constrained problems without changing the structure of the controller. Finally, some simulation results are given to verify the effectiveness of the method.
RESUMEN
In traditional leak location methods, the position of the leak point is located through the time difference of pressure change points of both ends of the pipeline. The inaccurate estimation of pressure change points leads to the wrong leak location result. To address it, adaptive dynamic programming is proposed to solve the pipeline leak location problem in this article. First, a pipeline model is proposed to describe the pressure change along pipeline, which is utilized to reflect the iterative situation of the logarithmic form of pressure change. Then, under the Bellman optimality principle, a value iteration (VI) scheme is proposed to provide the optimal sequence of the nominal parameter and obtain the pipeline leak point. Furthermore, neural networks are built as the VI scheme structure to ensure the iterative performance of the proposed method. By transforming into the dynamic optimization problem, the proposed method adopts the estimation of the logarithmic form of pressure changes of both ends of the pipeline to locate the leak point, which avoids the wrong results caused by unclear pressure change points. Thus, it could be applied for real-time leak location of long-distance pipeline. Finally, the experiment cases are given to illustrate the effectiveness of the proposed method.
