Constraint Solving-Based Automatic Generation of Mobile Agent Itineraries
link.springer.com › chapter
May 29, 2016 · This paper proposes a framework for specifying constraints on the itineraries of agents and generating the itineraries that can satisfy the ...
Jun 1, 2016 · This paper proposes a framework for specifying constraints on the itineraries of agents and solving the itineraries that can satisfy the ...
Constraint Solving-Based Automatic Generation of Mobile Agent Itineraries. Ichiro Satoh. Published in: ICAISC (1) (2016). Keyphrases.
This gives rise to the mobile-agent itinerary problem (MIP) which seeks a route maximizing overall benefit from the resources while meeting a deadline. This ...
A dynamic programming (DP) algorithm was designed to produce a family of optimal routes, allowing a mobile agent to dynamically revise its route. A fully ...
Missing: Generation | Show results with:Generation
New computing paradigms for network-aware applications need specification languages able to deal with the features of mobile code-based systems.
... based on imprecise mobile agents with real time constraints. Also, this paper presents some basic algorithms for dynamic determination of itinerary. An ...
Missing: Solving- Automatic
This paper proposes a framework for specifying constraints on the itineraries of agents and solving the itineraries that can ... [Show full abstract] ...
Sep 8, 2021 · A multi-agent itinerary suggestion system that aims at assisting the users in an online and collaborative way is proposed.
In this paper, we describe and evaluate adaptive heuristics able to choose the best behaviour to be used for decision making in the itinerary definition. This ...
Missing: Automatic | Show results with:Automatic