Results 1 - 10
of
4,547
Coordination of Groups of Mobile Autonomous Agents Using Nearest Neighbor Rules
, 2002
"... In a recent Physical Review Letters paper, Vicsek et. al. propose a simple but compelling discrete-time model of n autonomous agents fi.e., points or particlesg all moving in the plane with the same speed but with dierent headings. Each agent's heading is updated using a local rule based on ..."
Abstract
-
Cited by 1290 (62 self)
- Add to MetaCart
coordination and despite the fact that each agent's set of nearest neighbors change with time as the system evolves. This paper provides a theoretical explanation for this observed behavior. In addition, convergence results are derived for several other similarly inspired models.
A calculus of mobile processes, I
, 1992
"... We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage. The ..."
Abstract
-
Cited by 1184 (31 self)
- Add to MetaCart
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing structure. Not only may the component agents of a system be arbitrarily linked, but a communication between neighbours may carry information which changes that linkage
Data mules: Modeling a three-tier architecture for sparse sensor networks
- IN IEEE SNPA WORKSHOP
, 2003
"... Abstract — This paper presents and analyzes an architecture that exploits the serendipitous movement of mobile agents in an environment to collect sensor data in sparse sensor networks. The mobile entities, called MULEs, pick up data from sensors when in close range, buffer it, and drop off the data ..."
Abstract
-
Cited by 485 (6 self)
- Add to MetaCart
Abstract — This paper presents and analyzes an architecture that exploits the serendipitous movement of mobile agents in an environment to collect sensor data in sparse sensor networks. The mobile entities, called MULEs, pick up data from sensors when in close range, buffer it, and drop off
Protecting Mobile Agents Against Malicious Hosts
, 1997
"... A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under execution and (b) the mobile code against tampering attempts by the executing host. Many techniques for the first ..."
Abstract
-
Cited by 325 (1 self)
- Add to MetaCart
A key element of any mobile code based distributed system are the security mechanisms available to protect (a) the host against potentially hostile actions of a code fragment under execution and (b) the mobile code against tampering attempts by the executing host. Many techniques for the first
Developing multi-agent systems with JADE
- Wiley Series in Agent Technology
, 2007
"... Abstract. JADE (Java Agent Development Framework) is a software framework to make easy the development of multi-agent applications in compliance with the FIPA specifications. JADE can then be considered a middle-ware that implements an efficient agent platform and supports the development of multi a ..."
Abstract
-
Cited by 320 (5 self)
- Add to MetaCart
agent systems. JADE agent platform tries to keep high the performance of a distributed agent system implemented with the Java language. In particular, its communication architecture tries to offer flexible and efficient messaging, transparently choosing the best transport available and leveraging state
KLAIM: a Kernel Language for Agents Interaction and Mobility
- IEEE Transactions on Software Engineering
, 1997
"... We investigate the issue of designing a kernel programming language for Mobile Computing and describe Klaim, a language that supports a programming paradigm where processes, like data, can be moved from one computing environment to another. The language consists of a core Linda with multiple tuple s ..."
Abstract
-
Cited by 258 (62 self)
- Add to MetaCart
processes. The formal operational semantics is useful for discussing the design of the language and provides guidelines for implementations. Klaim is equipped with a type system that statically checks access rights violations of mobile agents. Types are used to describe the intentions (read, write, execute
AntNet: Distributed stigmergetic control for communications networks
- JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 1998
"... This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems. AntNet's agents co ..."
Abstract
-
Cited by 336 (31 self)
- Add to MetaCart
This paper introduces AntNet, a novel approach to the adaptive learning of routing tables in communications networks. AntNet is a distributed, mobile agents based Monte Carlo system that was inspired by recent work on the ant colony metaphor for solving optimization problems. AntNet's agents
Balance Sheets, The Transfer Problem, and Financial Crisis
- International Finance and Financial Crises, Essays in Honor of Robert P
, 1999
"... In a world of high capital mobility, the threat of speculative attack becomes a central issue of macroeconomic policy. While “first-generation ” and “second-generation ” models of speculative attacks both have considerable relevance to particular financial crises of the 1990s, a “third-generation ” ..."
Abstract
-
Cited by 259 (1 self)
- Add to MetaCart
-generation ” model is needed to make sense of the number and nature of the emerging market crises of 1997–98. Most of the recent attempts to produce such a model have argued that the core of the problem lies in the banking system. This paper sketches another candidate for third-generation crisis modeling
Resource Access Control in Systems of Mobile Agents
- Information and Computation
, 1998
"... INTRODUCTION Mobile computation, where independent agents roam widely distributed networks in search of resources and information, is fast becoming a reality. A number of programming languages, APIs and protocols have recently emerged which seek to provide high-level support for mobile agents. These ..."
Abstract
-
Cited by 212 (18 self)
- Add to MetaCart
INTRODUCTION Mobile computation, where independent agents roam widely distributed networks in search of resources and information, is fast becoming a reality. A number of programming languages, APIs and protocols have recently emerged which seek to provide high-level support for mobile agents
On robust rendezvous for mobile autonomous agents
, 2005
"... This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multi-agent networks in arbitrary di ..."
Abstract
-
Cited by 203 (21 self)
- Add to MetaCart
This paper presents coordination algorithms for networks of mobile autonomous agents. The objective of the proposed algorithms is to achieve rendezvous, that is, agreement over the location of the agents in the network. We provide analysis and design results for multi-agent networks in arbitrary
Results 1 - 10
of
4,547