طراحی کنترل یادگیری تکراری بهینه برای سیستم های چند عامله ردیابی اجماع
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|27712||2014||10 صفحه PDF||سفارش دهید||محاسبه نشده|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Systems & Control Letters, Volume 69, July 2014, Pages 80–89
Under a repeatable operation environment, this paper proposes an iterative learning control scheme that can be applied to multi-agent systems to perform consensus tracking under the fixed communication topology. The agent dynamics are modeled by time-varying nonlinear equations which satisfy the global Lipschitz continuous condition. In addition, the desired consensus trajectory is only accessible to a subset of the followers. By using the concept of the graph dependent matrix norm, the convergence conditions can be specified at the agent level, which depend on a set of eigenvalues that are associated with the communication topology. The results are first derived for homogeneous agent systems and then extended to heterogeneous systems. Next, optimal controller gain design methods are proposed in the sense that the λλ-norm of tracking error converges at the fastest rate, which imposes a tightest bounding function for the actual tracking error in the λλ-norm analysis framework. In the end, an illustrative example of a group of heterogeneous agents is provided to demonstrate the effectiveness of the proposed design methods.
In the past decade, multi-agent systems have attracted considerable attention from many researchers of various backgrounds due to their potential applications and cross-disciplinary nature. Consensus is an important class of multi-agent systems coordination problems. According to , in networks of agents (or dynamic systems), consensus means to reach an agreement regarding certain quantities of interest that are associated with the agents. In a consensus realization, the control action of an agent only depends on the information received or measured from its neighborhood. Since the control law is a kind of distributed algorithm, it is more robust and scalable compared to centralized control algorithms. Consensus algorithm is a very simple local coordination rule which can result in very complex and useful behaviors at the group level. For instance, it is widely observed that by adopting such a strategy, a school of fish can improve the chance of survival under the sea . Many interesting coordination problems have been formulated and solved under the framework of consensus, e.g., distributed sensor fusion , satellite alignment problem , multi-agent formation , synchronization of coupled oscillators , and optimal dispatch in power systems . To solve a consensus problem, the communication among agents is one of the indispensable components. In the early stage, the communication graph is assumed to be fixed. However, a consensus algorithm that is insensitive to topology variations, is more desired since many practical conditions can be modeled as time-varying communication, for example, asynchronous updating, communication link failures and creations. By using the set-valued Lyapunov theory, consensus over time-varying communication is investigated in . In ,  and , consensus over random networks or stochastically switching graph is considered. It is shown the almost sure consensus can be achieved in such kind of probabilistic settings. Many standard communication assumptions used in the literature and consensus results are summarized in . Iterative learning control (ILC) is a matured intelligent learning control strategy, which fully utilizes the past control experience to improve the tracking performance in the current iteration. The current control signal is usually synthesized by the past control signals and correction terms which consist of tracking errors in the past and/or current iterations. It mimics the human learning process that skills can be improved by repetition. ILC is developed for control tasks that repeat in a fixed and finite-time interval, and requires only the system gradient bound instead of accurate system model. Most practical plants only have nominal models instead of the accurate models, that makes ILC have great potential for applications in practice. For example, X–YX–Y table, chemical batch reactors, robotic manipulators. ILC was initially proposed in 1984 , and has been widely explored since then , ,  and . The main motivation of this work is to address many practical coordination problems that are repeatable or require periodic executions, such as the trajectory keeping in satellite formation problem considered in . Since the satellites orbiting the earth is a periodic task, from an operational point of view, it is useful for a group of satellites maneuvering in certain shape of formation. Thus, this problem can be well formulated in the framework of ILC. The idea of using ILC for multi-agent coordination first appears in , where multi-agent formation control problem is studied for a group of global Lipschitz nonlinear systems, in which the communication graph is identical to the formation structure. When the tree-like formation is considered, the perfect formation control can be achieved. In , by incorporating with high-order internal model ILC, an iteratively switching formation problem is formulated and solved in the same framework. The communication graphs are supposed to be direct spanning trees as well. Ref.  is dedicated to improving the control performance in . The formation structure can be independent of the communication topology, and time-varying communication is assumed in . The convergence condition is specified at the group level by a matrix norm inequality, and the learning gain can be designed by solving a set of linear matrix inequalities (LMIs). It is not clear under what condition the set of LMIs admits a solution, and it is the lack of insight how the communication topologies relate to the convergence condition. In , the idea of terminal ILC  is brought into the consensus problem. A finite-time consensus problem is formulated for discrete-time linear systems in ILC framework. It is shown that all the agents reach consensus at the terminal time as iteration number goes to infinity. In , the authors extend the terminal consensus problem in their previous work to track a time-varying reference trajectory over the entire finite-time interval. A unified ILC algorithm is developed for both discrete-time and continuous-time linear agents. Necessary and sufficient conditions in the form of spectral radius are derived to ensure the convergence properties. As mentioned before, communication is very important in multi-agent coordination. Fixed communication is assumed in all the above mentioned ILC works except , in which the communication is a connected graph at every time instance. A preliminary analysis of ILC algorithm over iteration-varying communication is reported in . It shows that consensus tracking can be achieved if the union graph over a fixed number of iterations contains a spanning tree. In this work, we study the consensus tracking problem for a group of time-varying nonlinear dynamic agents, where the nonlinear terms satisfy the global Lipschitz continuous condition. The communication graph is assumed to be fixed. In comparison with the current literature, the main challenges and contributions of this work are summarized below: (1) in , the convergence condition for continuous-time agents is derived based on the result in 2-dimensional system theory [25, Theorem 1], which is only valid for linear systems. By adoption of a graph dependent matrix norm and λλ-norm analysis, we are able to obtain the results for global Lipschitz nonlinear systems; (2) in , the convergence condition is specified at the group level in the form of a matrix norm inequality, and learning gain is designed by solving a set of LMIs. Nevertheless, owing to the graph dependent matrix norm, the convergence condition is expressed at the individual agent level in the form of spectral radius inequalities in our work, which are related to the eigenvalues associated with the communication graph. It shows that these eigenvalues play crucial roles in the convergence condition. In addition, the results are more general than the matrix norm inequality since the spectral radius of a matrix is less or equal to its matrix norm; (3) by using the graph dependent matrix norm and λλ-norm analysis, the learning controller design can be extended to heterogeneous systems. However, the methods in  and  are not directly applicable to heterogeneous systems; (4) the obtained convergence condition motivates us to consider optimal learning gain designs which can impose the tightest bounding functions for the actual tracking errors. A preliminary version of this work is published in . This paper is organized as follows. In Section 2, notations, basic terminologies in algebraic graph theory, and some useful results are introduced. Next, the consensus tracking problem for heterogeneous agents is formulated. Then, ILC control laws are developed in Section 3, for both homogeneous and heterogeneous agents, where the convergence condition is analyzed rigorously. Next, optimal learning design methods are proposed in Section 4, where optimal designs for undirected and directed graphs are explored respectively. Then, an illustrative example for heterogeneous agents under fixed directed graph is given in Section 5 to demonstrate the efficacy of the proposed algorithms. Finally, we conclude the paper in Section 6.
نتیجه گیری انگلیسی
In this work, a consensus tracking problem is formulated for a group of global Lipschitz nonlinear systems. A distributed D-type ILC control law is studied for the consensus tracking problem for both homogeneous and heterogeneous systems. By adoption of a graph dependent matrix norm, the convergence condition is specified at the agent level, which makes the learning gain design decoupled from other agents’ dynamics. In addition, optimal learning gain design methods are developed for both undirected and directed graphs, in the sense that the λλ-norm of the tracking error decays at the fastest rate, which imposes a tightest bounding function for the actual tracking error. A consensus tracking example for heterogeneous agent systems under directed graph is given to demonstrate the effectiveness of the developed design methods.