Designing distributed applications with mobile code paradigms
ICSE '97 Proceedings of the 19th international conference on Software engineering
Mobile agents
IEEE Transactions on Software Engineering
Experiences with network-based user agents for mobile applications
Mobile Networks and Applications - Special issue on protocols and software paradigms of mobile networks
MSWiM '99 Proceedings of the 2nd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fundamentals of Computer Alori
Fundamentals of Computer Alori
On Solving Travelling Salesman Problems by Genetic Algorithms
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Infrastructure for Mobile Agents: Requirements and Design
MA '98 Proceedings of the Second International Workshop on Mobile Agents
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
Agent-mediated message passing for constrained environments
MLCS Mobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium
Path planning under time-dependent uncertainty
UAI'95 Proceedings of the Eleventh conference on Uncertainty in artificial intelligence
Threshold Route Optimization Algorithm for Information Retrieving Mobile Agents
CIA '02 Proceedings of the 6th International Workshop on Cooperative Information Agents VI
Analysis on the performance of mobile agents for query retrieval
Information Sciences—Informatics and Computer Science: An International Journal
The Hopfield-Tank neural network applied to the mobile agent planning problem
Applied Intelligence
Analysis on the performance of mobile agents for query retrieval
Information Sciences: an International Journal
An ant algorithm based dynamic routing strategy for mobile agents
APWeb'03 Proceedings of the 5th Asia-Pacific web conference on Web technologies and applications
A fuzzy logic based multi-agents controller
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
Statistical behaviors of mobile agents in network routing
The Journal of Supercomputing
Hi-index | 0.00 |
Abstract: The number of agents and the execution time are two significant performance factors in mobile agent planning. Fewer agents cause lower network traffic and consume less bandwidth. Regardless of the number of agents used, the execution time for a task must be kept minimal, which means that use of the minimal number of agents must not impact on the execution time unfavorably. As the population of the mobile agent application domain grows, the importance of these two factors also increases. After careful review of these two factors, we propose two heuristic algorithms for finding the minimal number of traveling agents for retrieving information from a distributed computing environment, while keeping the latency minimal. Although agent planning, specifically Mobile Agent Planning (MAP), is quite similar to the famous Traveling Salesman Problem (TSP), agent planning has a different objective function from that of TSP. TSP deals with optimal total routing cost, while MAP attempts to minimize the execution time to complete tasks of information retrieval. In this paper, we suggest the cost-effective MAP algorithms, BYKY1 and BYKY2, which can be used in distributed information retrieval systems to find the factors mentioned above. At the end of each algorithm, 2OPT, a well-known TSP algorithm, is called to optimize each agent's local routing path. Experimental results show that BYKY2 produces near optimal performance. These algorithms are more realistic and applicable directly to the problem domains than those of previous works.