A multi-agent based manufacturing execution system (MES) model is presented. It is open, modula-rized, distributed, configurable, integratable and maintainable. By analyzing the MES domain in manufacturing systems, th...A multi-agent based manufacturing execution system (MES) model is presented. It is open, modula-rized, distributed, configurable, integratable and maintainable. By analyzing the MES domain in manufacturing systems, this paper proposes a multi-agent based MES model and analyzes the partitioned functions of MES in the model using unified modeling language (UML) diagrams, and establishes the ongoing implemented MES architecture. This MES can be facilely integrated with the enterprise resource planning (ERP), the floor control system (FCS), and the other manufacturing applications.展开更多
The similarities and differences between the container terminal logistics system(CTLS)and the Harvard-architecture computer system are compared in terms of organization and architecture.The mapping relation and the mo...The similarities and differences between the container terminal logistics system(CTLS)and the Harvard-architecture computer system are compared in terms of organization and architecture.The mapping relation and the modeling framework of the CTLS are presented based on multi-agent,and the successful algorithms in the computer domain are applied to the modeling framework,such as the dynamic priority and multilevel feedback scheduling algorithm.In addition,a model and simulation on a certain quay at Shanghai harbor is built up on the AnyLogic platform to support the decision-making of terminal on service cost.It validates the feasibility and creditability of the above systematic methodology.展开更多
The objective of this paper is to investigate the consensus of the multi-agent systems w/th nonlinear coupling function and external disturbances. The disturbance includes two parts, one part is supposed to be generat...The objective of this paper is to investigate the consensus of the multi-agent systems w/th nonlinear coupling function and external disturbances. The disturbance includes two parts, one part is supposed to be generated by an exogenous system, which is not required to be neutrally stable as in the output regulation theory, the other part is the modeling uncertainty in the exogenous disturbance system. A novel composite disturbance observer based control (DOBC) and H∞ control scheme is presented so that the disturbance with the exogenous system can be estimated and compensated and the consensus of the multi-agent systems with fixed and switching graph can be reached by using Hoo control law. Simulations demonstrate the advantages of the proposed DOBC and H∞ control scheme.展开更多
Owing to the fast growth of global market,textile and apparel industries which are a typical seasonal business are facing crucial challenges from both competitors and consumers.In order to get survived,forming supply ...Owing to the fast growth of global market,textile and apparel industries which are a typical seasonal business are facing crucial challenges from both competitors and consumers.In order to get survived,forming supply chain and utilizing the emerged technology to establish a quick response system become an important common practice for enterprises in terms of cost reduction and efficiency improvement.This paper presents a multi-agent-based integrated framework for quick response in textile and apparel supply chain.By sharing information and collaborating among chain partner,the multi-agent system provides a promising computing paradigm for quick response business processes.A prototype based on the proposed framework is implemented using ZEUS toolkit.It presents how the proposed architecture is being designed to establish collaborative business environment by providing dynamic quick response processes.展开更多
In this paper,we investigate a leader-following tracking problem for multi-agent systems with boundedinputs.We propose a distributed bounded protocol for each follower to track a leader whose states may not be complet...In this paper,we investigate a leader-following tracking problem for multi-agent systems with boundedinputs.We propose a distributed bounded protocol for each follower to track a leader whose states may not be completelymeasured.We theoretically prove that each agent can follow the leader with estimable track errors.Finally,somenumerical simulations are presented to illustrate our theoretical results.展开更多
In the MAS, system goal task can be decomposed into many transactions, which will be achieved by special agents distributed in different physical space. Due to complex coupling relations among transactions, transactio...In the MAS, system goal task can be decomposed into many transactions, which will be achieved by special agents distributed in different physical space. Due to complex coupling relations among transactions, transactions may form Waiting-Circle resulting in deadlock. Concerning the problem, this paper proposes two theorems developed for Waiting-Circle detection in transaction set and ensures the implement of goal task decomposition result. Furthermore, Circle-First Search is put forward to search all of the Waiting-Circle, which prnvide the basic guideline for decomposing goal task again and eliminate Waiting-Circle.展开更多
Task allocation is a key issue of agent cooperation mechanism in Multi-Agent Systems. The important features of an agent system such as the latency of the network infrastructure, dynamic topology, and node heterogenei...Task allocation is a key issue of agent cooperation mechanism in Multi-Agent Systems. The important features of an agent system such as the latency of the network infrastructure, dynamic topology, and node heterogeneity impose new challenges on the task allocation in Multi-Agent environments. Based on the traditional parallel computing task allocation method and Ant Colony Optimization (ACO), a novel task allocation method named Collection Path Ant Colony Optimization (CPACO) is proposed to achieve global optimization and reduce processing time. The existing problems of ACO are analyzed; CPACO overcomes such problems by modifying the heuristic function and the update strategy in the Ant-Cycle Model and establishing a threedimensional path pheromone storage space. The experimental results show that CPACO consumed only 10.3% of the time taken by the Global Search Algorithm and exhibited better performance than the Forward Optimal Heuristic Algorithm.展开更多
When a child abuse situation arises, the responsible agencies and entities in charge of response should be capable of providing a fast and personalized solution for the good of the child. This need leads the authors t...When a child abuse situation arises, the responsible agencies and entities in charge of response should be capable of providing a fast and personalized solution for the good of the child. This need leads the authors to consider the formation of dynamic virtual organizations tailored to each particular abuse case. In the authors' approach the partner selection of these collaborative networks is done through a software tool that combines two technologies from the field of artificial intelligence, specifically multi-agent systems and expert systems. In addition, these partners come from the breeding environment constituted by all the agencies or individuals, either in a region or locality, which have the potential of response.展开更多
Based on the immune mechanics and multi-agent technology, a multi-agent artificial immune network (Maopt-aiNet) algorithm is introduced. Maopt-aiNet makes use of the agent ability of sensing and acting to overcome pre...Based on the immune mechanics and multi-agent technology, a multi-agent artificial immune network (Maopt-aiNet) algorithm is introduced. Maopt-aiNet makes use of the agent ability of sensing and acting to overcome premature problem, and combines the global and local search in the searching process. The performance of the proposed method is examined with 6 benchmark problems and compared with other well-known intelligent algorithms. The experiments show that Maopt-aiNet outperforms the other algorithms in these benchmark functions. Furthermore, Maopt-aiNet is applied to determine the Murphree efficiency of distillation column and satisfactory results are obtained.展开更多
In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is p...In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.展开更多
In this paper,a local-learning algorithm for multi-agent is presented based on the fact that individual agent performs local perception and local interaction under group environment.As for in-dividual-learning,agent a...In this paper,a local-learning algorithm for multi-agent is presented based on the fact that individual agent performs local perception and local interaction under group environment.As for in-dividual-learning,agent adopts greedy strategy to maximize its reward when interacting with envi-ronment.In group-learning,local interaction takes place between each two agents.A local-learning algorithm to choose and modify agents' actions is proposed to improve the traditional Q-learning algorithm,respectively in the situations of zero-sum games and general-sum games with unique equi-librium or multi-equilibrium.And this local-learning algorithm is proved to be convergent and the computation complexity is lower than the Nash-Q.Additionally,through grid-game test,it is indicated that by using this local-learning algorithm,the local behaviors of agents can spread to globe.展开更多
In these latter days software agents are used for the development and implementation of intellectual decision support systems. In order to implement intelligence in a system some or several dozen of software agents ar...In these latter days software agents are used for the development and implementation of intellectual decision support systems. In order to implement intelligence in a system some or several dozen of software agents are used and the made system becomes multi-agent. For the development of these systems a set of methodologies, i.e., the sequence of consequent steps of analysis, designing and implementation, is offered. The carried out analysis of the methodologies showed that as a rule they are limited by the spectrum of their pending problem (within the pales of the requirements of specific applied task, within the pales of the possibilities of technical implementation) or within the pales of amount of detail. The variety of methodologies is influenced by the fact that for the development of these systems the requirements and attitudes are offered by the specialists of related spheres such as software, numeral intellect engineers. In the course of the development of hardware and software appeared possibilities to implement mobile multi-agents systems, however, there is no one united mobile multi-agent systems design methodology, whereas existing systems are underdeveloped and their number is small. In this article we introduce the course of the designing of an intellectual real time multi-agent investment management decision support information system adapting and combining some methodologies where the choice to use either communicating or mobile agents is the question of rather technical implementation than methodological. In the article we introduce two ways of system implementation by JADE platform: the first one-using communicating agents, and the second one-using mobile agents.展开更多
In this paper, the authors outline a formal system for reasoning about agents' knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents' actions involve an e...In this paper, the authors outline a formal system for reasoning about agents' knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents' actions involve an exchange of information with other agents in the game. The authors' system is modeled using Coq-a formal proof management system. To the best of the authors" knowledge, there are no papers in which knowledge games are considered using a Coq proof assistant. The authors use the dynamic logic of common knowledge, where they particularly focus on the epistemic consequences of epistemic actions carried out by agents. The authors observe the changes in the system that result from such actions. Those changes that can occur in such a system that are of interest to the authors take the form of agents' knowledge about the state of the system, knowledge about other agents' knowledge, higher-order agents' knowledge and so on, up to common knowledge. Besides an axiomatic ofepistemic logic, the authors use a known axiomatization of card games that is extended with some new axioms that are required for the authors' approach. Due to a deficit in implementations grounded in theory that enable players to compute their knowledge in any state of the game, the authors show how the authors' approach can be used for these purposes.展开更多
As the ability of a single agent is limited while information and resources in multi-agent systems are distributed, cooperation is necessary for agents to accomplish a complex task. In the open and changeable environm...As the ability of a single agent is limited while information and resources in multi-agent systems are distributed, cooperation is necessary for agents to accomplish a complex task. In the open and changeable environment on the Internet, it is of great significance to research a system flexible and capable in dynamic evolution that can find a collaboration method for agents which can be used in dynamic evolution process. With such a method, agents accomplish tasks for an overall target and at the same time, the collaborative relationship of agents can be adjusted with the change of environment. A method of task decomposition and collaboration of agents by improved contract net protocol is introduced. Finally, analysis on the result of the experiments is performed to verify the improved contract net protocol can greatly increase the efficiency of communication and collaboration in multi-agent system.展开更多
In this paper, a modified multi-agent system for assembly line balancing is proposed. Each worker in the assembly line is regarded as an agent, and two neighboring agents exchange information about the allocated tasks...In this paper, a modified multi-agent system for assembly line balancing is proposed. Each worker in the assembly line is regarded as an agent, and two neighboring agents exchange information about the allocated tasks. To balance the workload, an agent with a smaller workload sends a request message to his/her neighboring agent, who has a larger workload, to exchange tasks between them. Without any centralized control mechanism, each agent behaves to achieve their goal, which is to balance the workload. A tabu list and cooling control are also incorporated. However, the effectiveness of the previous system is limited, and the system depends on problems to be solved. As such, a modified system is proposed. In the proposed system, the cycle time is used when considering the proposal of exchange of allocated tasks instead of the task time allocated to the neighboring workers. Also, in the proposed system, the length of tabu list is determined dynamically based on the current number of possible exchanges, and the best cycle time in the search with cooling at medium speed is recorded for the second search that is finished when the current cycle time reaches the recorded cycle time. The effectiveness of the modified system is investigated by solving problems for various conditions. The results show that the proposed system is effective regardless of the problems that are encountered.展开更多
文摘A multi-agent based manufacturing execution system (MES) model is presented. It is open, modula-rized, distributed, configurable, integratable and maintainable. By analyzing the MES domain in manufacturing systems, this paper proposes a multi-agent based MES model and analyzes the partitioned functions of MES in the model using unified modeling language (UML) diagrams, and establishes the ongoing implemented MES architecture. This MES can be facilely integrated with the enterprise resource planning (ERP), the floor control system (FCS), and the other manufacturing applications.
基金The National Key Technology R&D Program of China during the 11th Five-Year Plan Period(No.2006BAH02A06)
文摘The similarities and differences between the container terminal logistics system(CTLS)and the Harvard-architecture computer system are compared in terms of organization and architecture.The mapping relation and the modeling framework of the CTLS are presented based on multi-agent,and the successful algorithms in the computer domain are applied to the modeling framework,such as the dynamic priority and multilevel feedback scheduling algorithm.In addition,a model and simulation on a certain quay at Shanghai harbor is built up on the AnyLogic platform to support the decision-making of terminal on service cost.It validates the feasibility and creditability of the above systematic methodology.
基金Supported by the National Excellence Youth Science Foundation of China under Grant No.60925012the National Basic Research Science Program of China under Grant No.2012CB720000+3 种基金973 Programthe National Natural Science Foundation of China under Grant Nos.60875039,60904022,60805039,and 60774013the Science Foundation of China postdoctoral under Grant No.2011M500205the Natural Science Foundation of Shandong Province of China under Grant No.ZR2011FM017
文摘The objective of this paper is to investigate the consensus of the multi-agent systems w/th nonlinear coupling function and external disturbances. The disturbance includes two parts, one part is supposed to be generated by an exogenous system, which is not required to be neutrally stable as in the output regulation theory, the other part is the modeling uncertainty in the exogenous disturbance system. A novel composite disturbance observer based control (DOBC) and H∞ control scheme is presented so that the disturbance with the exogenous system can be estimated and compensated and the consensus of the multi-agent systems with fixed and switching graph can be reached by using Hoo control law. Simulations demonstrate the advantages of the proposed DOBC and H∞ control scheme.
基金Supported by National Natural Science Foundation of China(No.70772073)Shanghai Social Science Foundation(No.2007BZH001)Shanghai Natural Science Foundation(No.07ZR14003)
文摘Owing to the fast growth of global market,textile and apparel industries which are a typical seasonal business are facing crucial challenges from both competitors and consumers.In order to get survived,forming supply chain and utilizing the emerged technology to establish a quick response system become an important common practice for enterprises in terms of cost reduction and efficiency improvement.This paper presents a multi-agent-based integrated framework for quick response in textile and apparel supply chain.By sharing information and collaborating among chain partner,the multi-agent system provides a promising computing paradigm for quick response business processes.A prototype based on the proposed framework is implemented using ZEUS toolkit.It presents how the proposed architecture is being designed to establish collaborative business environment by providing dynamic quick response processes.
基金Supported by the National Science Foundation of China under Grant Nos.10702023,10832006,and 60704041the Research Fund for the Doctoral Program of Higher Education under Grant No.20070487090
文摘In this paper,we investigate a leader-following tracking problem for multi-agent systems with boundedinputs.We propose a distributed bounded protocol for each follower to track a leader whose states may not be completelymeasured.We theoretically prove that each agent can follow the leader with estimable track errors.Finally,somenumerical simulations are presented to illustrate our theoretical results.
基金Sponsored by the High-Tech Research and Development Program of China (Grant No. 2001AA412210)Spaceflight Support Technology Fund Project (Grant No. 2001-HT-HGDO1)
文摘In the MAS, system goal task can be decomposed into many transactions, which will be achieved by special agents distributed in different physical space. Due to complex coupling relations among transactions, transactions may form Waiting-Circle resulting in deadlock. Concerning the problem, this paper proposes two theorems developed for Waiting-Circle detection in transaction set and ensures the implement of goal task decomposition result. Furthermore, Circle-First Search is put forward to search all of the Waiting-Circle, which prnvide the basic guideline for decomposing goal task again and eliminate Waiting-Circle.
基金supported by National Natural Science Foundation of China under Grant No.61170117Major National Science and Technology Programs under Grant No.2010ZX07102006+3 种基金National Key Technology R&D Program under Grant No.2012BAH25B02the National 973 Program of China under Grant No.2011CB505402the Guangdong Province University-Industry Cooperation under Grant No.2011A090200008the Scientific Research Foundation, Returned Overseas Chinese Scholars, State Education Ministry
文摘Task allocation is a key issue of agent cooperation mechanism in Multi-Agent Systems. The important features of an agent system such as the latency of the network infrastructure, dynamic topology, and node heterogeneity impose new challenges on the task allocation in Multi-Agent environments. Based on the traditional parallel computing task allocation method and Ant Colony Optimization (ACO), a novel task allocation method named Collection Path Ant Colony Optimization (CPACO) is proposed to achieve global optimization and reduce processing time. The existing problems of ACO are analyzed; CPACO overcomes such problems by modifying the heuristic function and the update strategy in the Ant-Cycle Model and establishing a threedimensional path pheromone storage space. The experimental results show that CPACO consumed only 10.3% of the time taken by the Global Search Algorithm and exhibited better performance than the Forward Optimal Heuristic Algorithm.
文摘When a child abuse situation arises, the responsible agencies and entities in charge of response should be capable of providing a fast and personalized solution for the good of the child. This need leads the authors to consider the formation of dynamic virtual organizations tailored to each particular abuse case. In the authors' approach the partner selection of these collaborative networks is done through a software tool that combines two technologies from the field of artificial intelligence, specifically multi-agent systems and expert systems. In addition, these partners come from the breeding environment constituted by all the agencies or individuals, either in a region or locality, which have the potential of response.
基金Supported by the National Natural Science Foundation of China (61271137)Public Science and Technology Research Funds Projects of Zhejiang Province (2011C21077)the Natural Science Foundation of Ningbo City (2011A610173)
文摘Based on the immune mechanics and multi-agent technology, a multi-agent artificial immune network (Maopt-aiNet) algorithm is introduced. Maopt-aiNet makes use of the agent ability of sensing and acting to overcome premature problem, and combines the global and local search in the searching process. The performance of the proposed method is examined with 6 benchmark problems and compared with other well-known intelligent algorithms. The experiments show that Maopt-aiNet outperforms the other algorithms in these benchmark functions. Furthermore, Maopt-aiNet is applied to determine the Murphree efficiency of distillation column and satisfactory results are obtained.
基金Supported in part by Chinese National Natural Science Foundation under Grant Nos. 60774016 60875039+2 种基金 60904022 60805039the Science Foundation of Education Office of Shandong Province of China under Grant No. J08LJ01
文摘In this paper, the relations of the network topology and the moving consensus of multi-agent systems are studied. A consensus-prestissimo scale-free network model with the static preferential-consensus attachment is presented on the rewired link of the regular network. The effects of the static preferential-consensus BA network on the algebraic connectivity of the topology graph are compared with the regular network. The robustness gain to delay is analyzed for variable network topology with the same scale. The time to reach the consensus is studied for the dynamic network with and without communication delays. By applying the computer simulations, it is validated that the speed of the convergence of multi-agent systems can be greatly improved in the preferential-consensus BA network model with different configuration.
文摘In this paper,a local-learning algorithm for multi-agent is presented based on the fact that individual agent performs local perception and local interaction under group environment.As for in-dividual-learning,agent adopts greedy strategy to maximize its reward when interacting with envi-ronment.In group-learning,local interaction takes place between each two agents.A local-learning algorithm to choose and modify agents' actions is proposed to improve the traditional Q-learning algorithm,respectively in the situations of zero-sum games and general-sum games with unique equi-librium or multi-equilibrium.And this local-learning algorithm is proved to be convergent and the computation complexity is lower than the Nash-Q.Additionally,through grid-game test,it is indicated that by using this local-learning algorithm,the local behaviors of agents can spread to globe.
文摘In these latter days software agents are used for the development and implementation of intellectual decision support systems. In order to implement intelligence in a system some or several dozen of software agents are used and the made system becomes multi-agent. For the development of these systems a set of methodologies, i.e., the sequence of consequent steps of analysis, designing and implementation, is offered. The carried out analysis of the methodologies showed that as a rule they are limited by the spectrum of their pending problem (within the pales of the requirements of specific applied task, within the pales of the possibilities of technical implementation) or within the pales of amount of detail. The variety of methodologies is influenced by the fact that for the development of these systems the requirements and attitudes are offered by the specialists of related spheres such as software, numeral intellect engineers. In the course of the development of hardware and software appeared possibilities to implement mobile multi-agents systems, however, there is no one united mobile multi-agent systems design methodology, whereas existing systems are underdeveloped and their number is small. In this article we introduce the course of the designing of an intellectual real time multi-agent investment management decision support information system adapting and combining some methodologies where the choice to use either communicating or mobile agents is the question of rather technical implementation than methodological. In the article we introduce two ways of system implementation by JADE platform: the first one-using communicating agents, and the second one-using mobile agents.
文摘In this paper, the authors outline a formal system for reasoning about agents' knowledge in knowledge games-a special type of multi-agent system. Knowledge games are card games where the agents' actions involve an exchange of information with other agents in the game. The authors' system is modeled using Coq-a formal proof management system. To the best of the authors" knowledge, there are no papers in which knowledge games are considered using a Coq proof assistant. The authors use the dynamic logic of common knowledge, where they particularly focus on the epistemic consequences of epistemic actions carried out by agents. The authors observe the changes in the system that result from such actions. Those changes that can occur in such a system that are of interest to the authors take the form of agents' knowledge about the state of the system, knowledge about other agents' knowledge, higher-order agents' knowledge and so on, up to common knowledge. Besides an axiomatic ofepistemic logic, the authors use a known axiomatization of card games that is extended with some new axioms that are required for the authors' approach. Due to a deficit in implementations grounded in theory that enable players to compute their knowledge in any state of the game, the authors show how the authors' approach can be used for these purposes.
基金Projects(61173026,61373045,61202039)supported by the National Natural Science Foundation of ChinaProjects(K5051223008,BDY221411)supported by the Fundamental Research Funds for the Central Universities of ChinaProject(2012AA02A603)supported by the High-Tech Research and Development Program of China
文摘As the ability of a single agent is limited while information and resources in multi-agent systems are distributed, cooperation is necessary for agents to accomplish a complex task. In the open and changeable environment on the Internet, it is of great significance to research a system flexible and capable in dynamic evolution that can find a collaboration method for agents which can be used in dynamic evolution process. With such a method, agents accomplish tasks for an overall target and at the same time, the collaborative relationship of agents can be adjusted with the change of environment. A method of task decomposition and collaboration of agents by improved contract net protocol is introduced. Finally, analysis on the result of the experiments is performed to verify the improved contract net protocol can greatly increase the efficiency of communication and collaboration in multi-agent system.
文摘In this paper, a modified multi-agent system for assembly line balancing is proposed. Each worker in the assembly line is regarded as an agent, and two neighboring agents exchange information about the allocated tasks. To balance the workload, an agent with a smaller workload sends a request message to his/her neighboring agent, who has a larger workload, to exchange tasks between them. Without any centralized control mechanism, each agent behaves to achieve their goal, which is to balance the workload. A tabu list and cooling control are also incorporated. However, the effectiveness of the previous system is limited, and the system depends on problems to be solved. As such, a modified system is proposed. In the proposed system, the cycle time is used when considering the proposal of exchange of allocated tasks instead of the task time allocated to the neighboring workers. Also, in the proposed system, the length of tabu list is determined dynamically based on the current number of possible exchanges, and the best cycle time in the search with cooling at medium speed is recorded for the second search that is finished when the current cycle time reaches the recorded cycle time. The effectiveness of the modified system is investigated by solving problems for various conditions. The results show that the proposed system is effective regardless of the problems that are encountered.