Simulating a Finite State Mobile Agent System
نویسندگان
چکیده
This paper analyzes the simulation of Finite State mobile agent, which regards the migration, execution, and searching of the mobile agents as finite states. As the finite state mobile agents are deployed under the virtual organization platform, the corresponding search algorithm in virtual organization is also introduced. The experiments results based on the finite mobile agent’s evaluation model show the finite mobile agents can achieve satisfied performance.
منابع مشابه
Simulating Turn-Taking Behaviours with Coupled Dynamical Recognizers
A coupled dynamical recognizer is proposed as a model for simulating turn-taking behaviour. An agent is modelled as a mobile robot with two wheels. A recurrent neural network is used to produce the motor outputs. By controlling this, agents compete to take turns on a two dimensional arena. There are two novel aspects to the present study. First, a dynamical recognizer is not only used for produ...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Finite State Mobile Agent Computation Model
In this paper, a novel formalized finite state mobile agent computation model based on the virtual organization is presented. In this model, all the actions (e.g. service, migration and communication etc.) of the mobile agents are treated as states. The process of the mobile agents’ workflow is controlled by a finite-state-machine. This ensures the atomic action for each mobile agent to avoid t...
متن کاملPartitioning algorithms for multi-agent systems based on finite-time proximity metrics
We address a generalized Voronoi partitioning problem for a team of mobile agents with nonlinear dynamics with respect to a state-dependent proximity metric. In particular, the proximity (pseudo-) metric corresponds to the reduction of a generalized energy metric that occurs during the transfer of an agent to an arbitrary destination with zero terminal velocity, in finite time. The realization ...
متن کامل