Planning allows mobile agents to make the best use of the available resources.
This thesis studies several planning problems that arise in mobile agent information retrieval and data-mining applications. We are given sites at which a certain task might be successfully performed. Each site has an independent probability of success associated with it. Latencies between sites, that is, the travel time between those two sites also have to be taken into account. If the task is successfully completed at a site then the remaining sites need not be visited.