Communication and Computation Bounded Agents in Multi Agent Simulations
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183203" target="_blank" >RIV/68407700:21230/11:00183203 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Communication and Computation Bounded Agents in Multi Agent Simulations
Original language description
This paper proposes a mechanism for simulating limited com- munication bandwidth and processing power available to an agent in multi-agent simulations. Although there exist dedicated tools able to simulate computer networks, most multi-agent platforms lack support for this kind of resource allocation. We target such multi-agent plat- forms and offer an easy method to implement the missing functionality by the agent designer. The introduced method assigns two additional message buffers to each agent, which are used to (i) limit the number of messages an agent is able to send in one simulation round, and (ii) limit the number of messages an agent is able to process in one simulation round.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
—
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2011
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the 5th International Conference on Industrial Applications of Holonic and Multi-agent Systems for Manufacturing
ISBN
978-3-642-23180-3
ISSN
—
e-ISSN
—
Number of pages
10
Pages from-to
114-123
Publisher name
Springer-Verlag
Place of publication
Berlin
Event location
Toulouse
Event date
Aug 29, 2011
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—