Energy-Aware Heuristics for Mobile Agents Itinerary with Time Constraints

In some mobile agent applications there may be the necessity of meeting a firm end-to-end deadline, although with some itinerary flexibil ity. The objective of this paper is to propose heuristics that deal with t he cost of physically moving agents; and to evaluate and compare the performance of these heuristics with others for routing real-time imprecise mobil e agents in a distributed environment.