Timed mobile agent planning for distributed information retrieval

Authors:
Jin-Wook Baek;Gyu-Tae Kim;Heon-Young Yeom
Affiliations:
School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea;School of Computer Science and Engineering, Seoul National University, Seoul, Korea
Venue:
Proceedings of the fifth international conference on Autonomous agents
Year:
2001

Citing 2
Cited 5

Methodologies for Distributed Information Retrieval

ICDCS '98 Proceedings of the The 18th International Conference on Distributed Computing Systems
Mobile agent planning problems

Mobile agent planning problems

Itinerary determination of imprecise mobile agents with firm deadline

Web Intelligence and Agent Systems
Heuristics for agent routing and itinerary optimization on dynamic networks

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 4
A fuzzy logic based multi-agents controller

Expert Systems with Applications: An International Journal
A timed mobile agent planning approach for distributed information retrieval in dynamic network environments

Information Sciences: an International Journal
Efficient dynamic itinerary and memory allocation for mobile agents

Proceedings of the International Conference on Advances in Computing, Communications and Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The most significant performance factors in Mobile Agent Planning (MAP) ARE; (a) the number of mobile agents, (b) the total routing time consumed by the participated agents, and (c) the time constraints, (such as information ready time and deadline triggered unto each nodes to be visited). We propose the Timed Mobile Agent Planning (TMAP), a time constrained mobile agent planning method for finding the minimal number of agents and the best scheduled agents' itineraries for information retrieval from a distributed computing environment processed under the time- constraints while keeping the completion and the total routing time minimal. Experimental results show that this method is required and highly applicable directly to the time- constrained distributed information retrieval environment which has a time window which consists of a &lquo;ready- line” (information ready time) and a “deadline” (the end of the information's lifetime).