PDM (product data management) is one kind of techniques based on software and database, which integrates information and process related to products. But it is not enough to perform the complication of PDM in enterpri...PDM (product data management) is one kind of techniques based on software and database, which integrates information and process related to products. But it is not enough to perform the complication of PDM in enterprises. Then the mechanism to harmonize all kinds of information and process is needed. The paper introduces a novel approach to implement the intelligent monitor of PDM based on MAS (multi agent system). It carries out the management of information and process by MC (monitor center). The paper first puts forward the architecture of the whole system, then defines the structure of MC and its interoperation mode.展开更多
Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated.In order to design effective consensus tracking protocols for a more general class of ...Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated.In order to design effective consensus tracking protocols for a more general class of networks,which are aimed at ensuring that the concerned states of agents converge to a constant or time-varying reference state,new consensus tracking protocols with a constant and time-varying reference state are proposed,respectively.Particularly,by contrast with spanning tree,an improved condition of switching interaction topology is presented.And then,convergence analysis of two consensus tracking protocols is provided by Lyapunov stability theory.Moreover,consensus tracking protocol with a time-varying reference state is extended to achieve the formation control.By introducing formation structure set,each agent can gain its individual desired trajectory.Finally,several simulations are worked out to illustrate the effectiveness of theoretical results.The test results show that the states of agents can converge to a desired constant or time-varying reference state.In addition,by selecting appropriate structure set,agents can maintain the expected formation under random switching interaction topologies.展开更多
Consensus problems for discrete-time multi-agent systems were focused on.In order to design effective consensus protocols,which were aimed at ensuring that the concerned states of agents converged to a common value,a ...Consensus problems for discrete-time multi-agent systems were focused on.In order to design effective consensus protocols,which were aimed at ensuring that the concerned states of agents converged to a common value,a new consensus protocol for general discrete-time multi-agent system was proposed based on Lyapunov stability theory.For discrete-time multi-agent systems with desired trajectory,trajectory tracking and formation control problems were studied.The main idea of trajectory tracking problems was to design trajectory controller such that each agent tracked desired trajectory.For a type of formation problem with fixed formation structure,the formation structure set was introduced.According to the formation structure set,each agent can track its individual desired trajectory.Finally,simulations were provided to demonstrate the effectiveness of the theoretical results.The numerical results show that the states of agents converge to zero with consensus protocol,which is said to achieve a consensus asymptotically.In addition,through designing appropriate trajectory controllers,the simulation results show that agents converge to the desired trajectory asymptotically and can form different formations.展开更多
In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control sc...In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control scheme is constructed recursively by the backstepping method, graph theory,neural networks(NNs) and the dynamic surface control(DSC)approach. The key advantage of the proposed control strategy is that, by the DSC technique, it avoids "explosion of complexity"problem along with the increase of the degree of individual agents and thus the computational burden of the scheme can be drastically reduced. Moreover, there is no requirement for prior knowledge about system parameters of individual agents and uncertain dynamics by employing NNs approximation technology.We then further show that, in theory, the designed control policy guarantees the consensus errors to be cooperatively semi-globally uniformly ultimately bounded(CSUUB). Finally, two examples are presented to validate the effectiveness of the proposed control strategy.展开更多
Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus...Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus algorithm. A novel distributed control model is proposed for the multi-agent system to form the anticipated formation as well as achieve obstacle avoidance. Based on the consensus algorithm, a distributed control function consisting of three terms (formation control term, velocity matching term, and obstacle avoidance term) is presented. By establishing a novel formation control matrix, a formation control term is constructed such that the agents can converge to consensus and reach the anticipated formation. A new obstacle avoidance function is developed by using the modified potential field approach to make sure that obstacle avoidance can be achieved whether the obstacle is in a dynamic state or a stationary state. A velocity matching term is also put forward to guarantee that the velocities of all agents converge to the same value. Furthermore, stability of the control model is proven. Simulation results are provided to demonstrate the effectiveness of the proposed control.展开更多
This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different ...This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.展开更多
This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed c...This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent's own information and its neighbors' partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.展开更多
Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus o...Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.展开更多
文摘PDM (product data management) is one kind of techniques based on software and database, which integrates information and process related to products. But it is not enough to perform the complication of PDM in enterprises. Then the mechanism to harmonize all kinds of information and process is needed. The paper introduces a novel approach to implement the intelligent monitor of PDM based on MAS (multi agent system). It carries out the management of information and process by MC (monitor center). The paper first puts forward the architecture of the whole system, then defines the structure of MC and its interoperation mode.
基金Projects(61075065,60774045) supported by the National Natural Science Foundation of ChinaProject supported by the Graduate Degree Thesis Innovation Foundation of Central South University,China
文摘Consensus tracking control problems for single-integrator dynamics of multi-agent systems with switching topology are investigated.In order to design effective consensus tracking protocols for a more general class of networks,which are aimed at ensuring that the concerned states of agents converge to a constant or time-varying reference state,new consensus tracking protocols with a constant and time-varying reference state are proposed,respectively.Particularly,by contrast with spanning tree,an improved condition of switching interaction topology is presented.And then,convergence analysis of two consensus tracking protocols is provided by Lyapunov stability theory.Moreover,consensus tracking protocol with a time-varying reference state is extended to achieve the formation control.By introducing formation structure set,each agent can gain its individual desired trajectory.Finally,several simulations are worked out to illustrate the effectiveness of theoretical results.The test results show that the states of agents can converge to a desired constant or time-varying reference state.In addition,by selecting appropriate structure set,agents can maintain the expected formation under random switching interaction topologies.
基金Supported by National Basic Research Program of China (973 Program) (2010CB731800), Key Project of Natural Science Fouudation of China (60934003), National Natural Science Foundation of China (61074065, 60974018), Natural Science Foundation of Hebei Province(F2012203119), and the Science Foundation of Yanshan University for the Excellent Ph. D. Students (201204) The authors thank Chen Cai-Lian of the Shanghai Jiao Tong University for her comments on English polishing and problem formulation.
基金Projects(60474029,60774045,60604005) supported by the National Natural Science Foundation of ChinaProject supported by the Graduate Degree Thesis Innovation Foundation of Central South University,China
文摘Consensus problems for discrete-time multi-agent systems were focused on.In order to design effective consensus protocols,which were aimed at ensuring that the concerned states of agents converged to a common value,a new consensus protocol for general discrete-time multi-agent system was proposed based on Lyapunov stability theory.For discrete-time multi-agent systems with desired trajectory,trajectory tracking and formation control problems were studied.The main idea of trajectory tracking problems was to design trajectory controller such that each agent tracked desired trajectory.For a type of formation problem with fixed formation structure,the formation structure set was introduced.According to the formation structure set,each agent can track its individual desired trajectory.Finally,simulations were provided to demonstrate the effectiveness of the theoretical results.The numerical results show that the states of agents converge to zero with consensus protocol,which is said to achieve a consensus asymptotically.In addition,through designing appropriate trajectory controllers,the simulation results show that agents converge to the desired trajectory asymptotically and can form different formations.
基金supported in part by the National Natural Science Foundation of Chin(61503194,61533010,61374055)the Ph.D.Programs Foundation of Ministry of Education of China(20110142110036)+6 种基金the Natural Science Foundation o Jiangsu Province(BK20131381,BK20140877)China Postdoctoral Scienc Foundation(2015M571788)Jiangsu Planned Projects for Postdoctoral Re search Funds(1402066B)the Foundation of the Key Laboratory of Marin Dynamic Simulation and Control for the Ministry of Transport(DMU)(DMU MSCKLT2016005)Jiangsu Government Scholarship for Overseas Studie(2017-037)the Key University Natural Science Research Project of Jiangsu Province(17KJA120003)the Scientific Foundation of Nanjing University of Posts and Telecommunications(NUPTSF)(NY214076)
文摘In this paper, we consider a consensus tracking problem of a class of networked multi-agent systems(MASs)in non-affine pure-feedback form under a directed topology. A distributed adaptive tracking consensus control scheme is constructed recursively by the backstepping method, graph theory,neural networks(NNs) and the dynamic surface control(DSC)approach. The key advantage of the proposed control strategy is that, by the DSC technique, it avoids "explosion of complexity"problem along with the increase of the degree of individual agents and thus the computational burden of the scheme can be drastically reduced. Moreover, there is no requirement for prior knowledge about system parameters of individual agents and uncertain dynamics by employing NNs approximation technology.We then further show that, in theory, the designed control policy guarantees the consensus errors to be cooperatively semi-globally uniformly ultimately bounded(CSUUB). Finally, two examples are presented to validate the effectiveness of the proposed control strategy.
基金Supported by National Natural Science Foundation of China (61079001, 61273006), National High Technology Research and Development Program of China (863 Program) (2011AA110301), and Specialized Research Fund for the Doctoral Program of Higher Education of China (20111103110017)
基金supported by the National High Technology Research and Development Program of China(Grant No.2011AA040103)the Research Foundationof Shanghai Institute of Technology,China(Grant No.B504)
文摘Formation control and obstacle avoidance for multi-agent systems have attracted more and more attention. In this paper, the problems of formation control and obstacle avoidance are investigated by means of a consensus algorithm. A novel distributed control model is proposed for the multi-agent system to form the anticipated formation as well as achieve obstacle avoidance. Based on the consensus algorithm, a distributed control function consisting of three terms (formation control term, velocity matching term, and obstacle avoidance term) is presented. By establishing a novel formation control matrix, a formation control term is constructed such that the agents can converge to consensus and reach the anticipated formation. A new obstacle avoidance function is developed by using the modified potential field approach to make sure that obstacle avoidance can be achieved whether the obstacle is in a dynamic state or a stationary state. A velocity matching term is also put forward to guarantee that the velocities of all agents converge to the same value. Furthermore, stability of the control model is proven. Simulation results are provided to demonstrate the effectiveness of the proposed control.
基金Project supported by the National Natural Science Foundation of China (Grant No. 70571059)
文摘This paper investigates the cluster consensus problem for second-order multi-agent systems by applying the pinning control method to a small collection of the agents. Consensus is attained independently for different agent clusters according to the community structure generated by the group partition of the underlying graph and sufficient conditions for both cluster and general consensus are obtained by using results from algebraic graph theory and the LaSalle Invariance Principle. Finally, some simple simulations are presented to illustrate the technique.
基金supported by the National Natural Science Foundation of China(No.60674050,60736022,10972002,60774089,60704039)
文摘This paper studies the consensus problems for a group of agents with switching topology and time-varying communication delays, where the dynamics of agents is modeled as a high-order integrator. A linear distributed consensus protocol is proposed, which only depends on the agent's own information and its neighbors' partial information. By introducing a decomposition of the state vector and performing a state space transformation, the closed-loop dynamics of the multi-agent system is converted into two decoupled subsystems. Based on the decoupled subsystems, some sufficient conditions for the convergence to consensus are established, which provide the upper bounds on the admissible communication delays. Also, the explicit expression of the consensus state is derived. Moreover, the results on the consensus seeking of the group of high-order agents have been extended to a network of agents with dynamics modeled as a completely controllable linear time-invariant system. It is proved that the convergence to consensus of this network is equivalent to that of the group of high-order agents. Finally, some numerical examples are given to demonstrate the effectiveness of the main results.
基金supported by Institute of Information & communications Technology Planning & Evaluation (IITP) grant funded by the Korea government(MSIT) (No.RS-2022-00155885, Artificial Intelligence Convergence Innovation Human Resources Development (Hanyang University ERICA))supported by the National Natural Science Foundation of China under Grant No. 61971264the National Natural Science Foundation of China/Research Grants Council Collaborative Research Scheme under Grant No. 62261160390
文摘Due to the fading characteristics of wireless channels and the burstiness of data traffic,how to deal with congestion in Ad-hoc networks with effective algorithms is still open and challenging.In this paper,we focus on enabling congestion control to minimize network transmission delays through flexible power control.To effectively solve the congestion problem,we propose a distributed cross-layer scheduling algorithm,which is empowered by graph-based multi-agent deep reinforcement learning.The transmit power is adaptively adjusted in real-time by our algorithm based only on local information(i.e.,channel state information and queue length)and local communication(i.e.,information exchanged with neighbors).Moreover,the training complexity of the algorithm is low due to the regional cooperation based on the graph attention network.In the evaluation,we show that our algorithm can reduce the transmission delay of data flow under severe signal interference and drastically changing channel states,and demonstrate the adaptability and stability in different topologies.The method is general and can be extended to various types of topologies.