Paper Info
Title
Constraint Solving-Based Itineraries for Mobile Agents.
Abstract
Itineraries of mobile agents among multiple nodes seriously affect the availability and performance of mobile agent-based processing. Such itineraries tend to be complicated, for example, the order of the nodes that agents should visit may be alternative or commutable. This paper proposes a framework for specifying constraints on the itineraries of agents and solving the itineraries that can satisfy the constraints. The contribution of this framework is to automatically generate the itineraries of mobile agents among computers from application-specific constraints. A prototype implementation of this framework and its application were built on a Java-based mobile agent system.
Year
DOI
Venue
2016
10.1007/978-3-319-40162-1_13
DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, (DCAI 2016)
Keywords
Field
DocType
Mobile agent,Constraint satisfaction problem,Agent route,Agent itinerary
Computer science,Mobile agent,Constraint satisfaction problem,Artificial intelligence,Java,Machine learning,Distributed computing
Conference
Volume
ISSN
Citations 
474
2194-5357
0
PageRank 
References 
Authors
0.34
1
1
Name
Order
Citations
PageRank
Ichiro Satoh188296.32