Abstract
This paper describes an experiment with mobility in multi-agent systems. The setting is a virtual machine that supports reification of the computational state of a running process. The objective is to investigate how this feature facilitates telescripting and to speculate on how languages like Java should evolve to include the resulting notion of strong migration
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Jim White, Mobile Agents White Paper, General Magic
Robert S. Gray, Agent TCL: A flexible and secure mobile-agent system, Department of Computer Science, Dartmouth College
Gian Pietro Picco, Understanding Code Mobility, Politecnico di Torino, Italy, Tutorial at ECOOP98, 22 July 1998
Gerald Jay Sussman, Guy Lewis Steele Jr, Scheme, An Interpreter for Extended Lambda Calculus, Massachusetts Institute of Technology, Artificial Intelligence Laboratory. December 1975
Werner Van Belle, Reinforcement Learning as a Routing Technique for Mobile Multi Agent Systems, April 1997
Ad Astra, Jumping Beans, a white paper, 1 september 1998
Online documentation on http://pico.vub.ac.be
Agha G. Actors: A Model of Concurrent Computation in Distributed Systems, AI Tech Report 844, MI
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Belle, W., D’Hondt, T. (2001). Agent Mobility and Reification of Computational State: An Experiment in Migration. In: Wagner, T., Rana, O.F. (eds) Infrastructure for Agents, Multi-Agent Systems, and Scalable Multi-Agent Systems. AGENTS 2000. Lecture Notes in Computer Science(), vol 1887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47772-1_15
Download citation
DOI: https://doi.org/10.1007/3-540-47772-1_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42315-7
Online ISBN: 978-3-540-47772-3
eBook Packages: Springer Book Archive