Anderson, S.D.: Simulation of multiple time-pressured agents. In: Winter Simulation Conference. (1997) 397--404 Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Simulation for Agent-Oriented Software Engineering - Uhrmacher (2002) (Correct)
....Typically, the agent is not modeled in its entirety. Already the first simulation systems for agents allowed to plug code fragments, or single modules into the modeled agent skeleton [21] A further step towards reducing the modeling effort treats agents as external source and drain of events [26, 2]. The simulation is interpreted as a black box with a clearly specified interface. The agent software has to be changed to transform and to redirect requests and messages that are normally sent to its real environment to the simulation system. If the agent is synchronized with the simulation ....
S.D. Anderson. Simulation of Multiple Time-Pressured Agents. In Proc. of the Wintersimulation Conference, WSC'97, Atlanta, 1997.
MPADES: Middleware for Parallel Agent Discrete Event Simulation - Riley (2002) (Correct)
....events. Uhrmacher also provides an overview of the current state of agent oriented simulation [6] Agent simulation has existed for much longer in the AI community. Perhaps the most comprehensive work on simulations that track the thinking time of the agents is the MESS system by Anderson [7, 8]. MESS allows the computation of the agents to be tracked at a level as low as primitive LISP instructions, as well as providing perfectly reproducible results. However, MESS requires that all agents are written in LISP and provides no support for distributed, parallel simulation. One widely used ....
....by the Linux kernel is in 10ms increments, a fairly large amount of computation on today s computers. With the randomness in interrupts and other system activity, CPU usage numbers are unfortunately not perfectly reproducible, in contrast to a more language speci c time tracking system like [7, 8]. However, tracking the CPU time via kernel provided information allows much more exibility in the implementation of the agents and provides a better substrate for interoperability of agents designed by separate groups. The agents have one special action which MPADES understands: a request time ....
Anderson, S.D.: Simulation of multiple time-pressured agents. In Andradottir, S., Healy, K.J., Withers, D.H., Nelson, B.L., eds.: Proceedings of the 1997 Winter Simulation Conference. (1997) 397-404
Planning Agents in James - Schattenberg, Uhrmacher (2000) (1 citation) (Correct)
....a timely response. Most approaches model the 4 deliberation time as a function of the actual computation time [14] other estimate it according to the used deliberation component and the size of the problem [17] again others weight and count instructions which are executed during deliberation [3]. James supports the former two time models, since the latter presupposes that the deliberation component can be executed in a timed programming language, e.g. Timed Lisp which overloads the standard lisp functions [3] The deliberation components that are tested in James are typically ....
.... weight and count instructions which are executed during deliberation [3] James supports the former two time models, since the latter presupposes that the deliberation component can be executed in a timed programming language, e.g. Timed Lisp which overloads the standard lisp functions [3]. The deliberation components that are tested in James are typically implemented in di erent languages, e.g. Java and C, and started as external threads. Neither Java nor C nor other non interpretative languages lend themselves to an easy implementation of a timed variant. If internal information ....
S.D. Anderson. Simulation of Multiple Time-Pressured Agents. In Proc. of the Wintersimulation Conference, WSC'97, Atlanta, 1997.
Distributed, Parallel Simulation of Multiple, Deliberative Agents - Gugler (2000) (1 citation) (Correct)
....deliberation component and the size of the knowledge base [4] others weigh and count instructions which are executed during deliberation . This presupposes that the deliberation component can be executed in a timed environment, e.g. Timed Lisp which simply overloads the standard lisp operators [1]. Most test beds determine the deliberation time as a function of the actually used computation time [3] Even though in this case noise is induced due to changing work loads, which hampers repeatable test runs, it is the most flexible and simplistic approach in testing agent architectures and ....
....facilitate the testing of different planning systems [10] 3 The Problem Most test beds for multi agent systems do not execute their models concurrently. They simply maintain the illusion of simultaneity on a single machine. If only a single deliberative agent is tested in a dynamic environment [1] or the coordination strategies of a moderate number of reactive agents [7] there is no need for a distributed, parallel execution of agents. To efficiently test more than a single deliberative agent, which consumes significant space and computation resources, a concurrent, distributed simulation ....
S.D. Anderson. Simulation of Multiple TimePressured Agents. In Proc. of the Wintersimulation Conference, WSC'97, Atlanta, 1997.
Extending Time Management Support for Multiagent Systems - Helleboogh, Holvoet.. (2005) (Correct)
No context found.
Anderson, S.D.: Simulation of multiple time-pressured agents. In: Winter Simulation Conference. (1997) 397--404
"Plug And Test" - Software Agents In Virtual Environments - Uhrmacher, Kullick (2000) (1 citation) (Correct)
No context found.
S.D. Anderson. 1997. Simulation of Multiple TimePressured Agents. In Proc. of the Wintersimulation Conference, WSC'97, Atlanta.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC