Modeling of container terminal logistics system based on multi-agent

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.

Robust Consensus of Multi-Agent Systems with Uncertain Exogenous Disturbances

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.

Coordinated Control of Multi-Agent Systems with a Varying-Velocity Leader and Input Saturation

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.

Collaborative Problem in Multi-agent System

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.

Ant Colony Optimization for Task Allocation in Multi-Agent Systems

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.

A Multi-Agent Expert System for Prevention of Child Abuse and Neglect

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.

Design of Multi-agent Supply Chain System to Support Quick Response in Textile-Apparel Industry

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.

Consensus of Multi-Agent Systems with Prestissimo Scale-Free Networks

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.

Methodological Approaches to Development and Implementation of Multi-agents Investment DSS Using JADE Platform

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.

Reasoning about Epistemic Actions and Knowledge in Multi-Agent Systems Using Coq

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.

Collaboration strategy for software dynamic evolution of multi-agent system

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.

A Modified Multi-Agent System for Simple Assembly Line Balancing

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.

改进人工势场法在解决飞行冲突问题中的应用

飞行冲突的探测和解决是实现自由飞行的关键问题,改进后的人工势场法可以应用于飞行冲突的解决。文中介绍了多-Agent系统和人工势场法,将飞机当作能主动识别环境中动态障碍物的个体Agent,建立了相关的数学模型,应用改进人工势场的方法,将飞行冲突的解决扩展到三维空间。仿真实验表明该算法能有效解决飞行冲突。

Multi Agent Systems for Fault States Diagnostics and Equipment and Process Management of Yogurt Ripening Tank

It is impossible to plan in advance unpredictable phenomena at monitoring, diagnosis and control of industrial batch and continuous equipment and processes such as chemical composition of the raw materials, the process leads to unexpected reactions and changes its parameters, etc. The agent is active, a program entity, has its own ideas how to perform the tasks of the own agenda. Agents perceive, behave ＂reasonably＂, communicate with other agents. Agents can represent equipment and operations in batch processes as recommended by the ISA $88. Jadex system is based on Java language and on FIPA org. recommendations. The description of ripening tank T406 and recipe for yogurt production in the holding of MADETA Corp. in the Czech Rep. It is described modeling and displaying of＂normal＂ and error, fault unit state of the ripening tank. Agents are within the Jadex system and describing the behavior of ripening tank T406 with state diagrams-automata and assist in diagnosing of fault states. States are described in XML language-SCXML （State Charts XML）. Jadex Control Center-JCC represents a major access point to use for operating in real time.

Task Assignment for Forest Fire Suppression by Multiple UAVs

This paper presents a scenario of forest fire suppression using UAVs （Unmanned Aerial Vehicles） and addresses task assignment algorithm to coordinate UAVs. Forest fires are a major problem in many nations and fast extinguishing forest fires brings a lot of ecological advantages so proper use of firefighting resources is very critical. In this sense, multi UAVs forest fire suppression system can be effective way to prevent fire outbreaks. In multi agent system, an appropriate task assignment according to the SA （Situational Awareness） is the most essential to conduct mission. We should consider real time re-planning or re-scheduling of multi UAVs team because environmental situations such as wind are changeable and that changes affect the forest fire spreading. Furthermore, we have to think about convergence to a consistent SA because it may take too much time. CBBA （Consensus-Based Bundle Algorithm） is robust decentralized task assignment tool so it can be implemented in real time re-planning application. A simulation model which is the main topic in this paper shows that multi UAVs can be properly operated to suppress forest fires even if there are unpredictable random factors and partial disconnection. The simulation model includes concrete operating scenarios and recursive task re-assign algorithm until fires in the whole area are suppressed.

Reinforcement learning with partitioning function system

The size of state-space is the limiting factor in applying reinforcement learning algorithms to practical cases. A reinforcement learning system with partitioning function (RLWPF) is established, in which state-space is partitioned into several regions. Inside the performance principle of RLWPF is based on a Semi-Markov decision process and has general significance. It can be applied to any reinforcement learning with a large state-space. In RLWPF, the partitioning module dispatches agents into different regions in order to decrease the state-space of each agent. This article proves the convergence of the SARSA algorithm for a Semi-Markov decision process, ensuring the convergence of RLWPF by analyzing the equivalence of two value functions in two Semi-Markov decision processes before and after partitioning. This article can show that the optimal policy learned by RLWPF is consistent with prior domain knowledge. An elevator group system is devised to decrease the average waiting time of passengers. Four agents control four elevator cars respectively. Based on RLWPF, a partitioning module is developed through defining a uniform round trip time as the partitioning criteria, making the wait time of most passengers more or less identical then elevator cars should only answer hall calls in their own region. Compared with ordinary elevator systems and reinforcement learning systems without partitioning module, the performance results show the advantage of RLWPF.

The Design of the Online Teaching System based on Multiagent System

By introducing multi-agent technology to the online teaching system and establishing a personalized online teaching system model, the intelligent and personalized problems in the traditional online teaching system are solved; the needs of students for learning are fulfilled; the intelligent and interactive functions of the online teaching system are improved; a new interactive online teaching model is implemented. In this paper, the online system design based on multi-agent system technology is raised, and the modules and functions of the system are defined.

Second-Order Consensus of Multiple Agents with Coupling Delay

In this paper, we investigate two kinds of second-order consensus algorithms for multiple agents with coupling delay under general fixed directed information topology. Stability analysis is performed based on Lyapunov- Krasovskii functional method. Delay-dependent asymptotical stability condition in terms of linear matrix inequalities （LMIs） is derived for the second-order consensus algorithm of delayed dynamical networks. Both delay-independent and delay-dependent asymptotical stability conditions in terms of LMIs are derived for the second-order consensus algorithm with information feedback.

Medical Image Dynamic Collaborative Processing on the Distributed Environment

A new trend in the development of medical image processing systems is to enhance the shar-ing of medical resources and the collaborative processing of medical specialists. This paper presents an architecture of medical image dynamic collaborative processing on the distributed environment by combining the JAVA, CORBA (Common Object Request and Broker Architecture) and the MAS (Multi-Agents System) collaborative mechanism. The architecture allows medical specialists or applications to share records and cornmunicate with each other on the web by overcoming the shortcut of traditional approach using Common Gateway Interface (CGI) and client/server architecture, and can support the remote heterogeneous systems collaboration. The new approach im-proves the collaborative processing of medical data and applications and is able to enhance the in-teroperation among heterogeneous system. Research on the system will help the collaboration and cooperation among medical application systems distributed on the web, thus supply high quality medical service such as diagnosis and therapy to practicing specialists regardless of their actual geo-graphic location.

CONVERGENCE OF A CLASS OF MULTI-AGENT SYSTEMS IN PROBABILISTIC FRAMEWORK

Multi-agent systems arise from diverse fields in natural and artificial systems, and a basic problem is to understand how locally interacting agents lead to collective behaviors （e.g., synchronization） of the overall system. In this paper, we will consider a basic class of multi-agent systems that are described by a simplification of the well-known Vicsek model. This model looks simple, but the rigorous theoretical analysis is quite complicated, because there are strong nonlinear interactions among the agents in the model. In fact, most of the existing results on synchronization need to impose a certain connectivity condition on the global behaviors of the agents＇ trajectories （or on the closed-loop dynamic neighborhood graphs）, which are quite hard to verify in general. In this paper, by introducing a probabilistic framework to this problem, we will provide a complete and rigorous proof for the fact that the overall multi-agent system will synchronize with large probability as long as the number of agents is large enough. The proof is based on a detailed analysis of both the dynamical properties of the nonlinear system evolution and the asymptotic properties of the spectrum of random geometric graphs.