Title
Plan Switching: An Approach To Plan Execution In Changing Environments
Abstract
The execution of a complex task in any environment requires planning. Planning is the process of constructing an activity graph given by the current state of the system, a goal state, and a set of activities. If we wish to execute a complex computing task in a heterogeneous computing environment with autonomous resource providers, we should be able to adapt to changes in the environment. A possible solution is to construct a family of activity graphs beforehand and investigate the means of switching from one member of the family to another when the execution of one activity graph fails. In this paper, we study the conditions when plan switching is feasible. Then we introduce an approach for plan switching and report the simulation results of this approach. © 2006 IEEE.
Publication Date
1-1-2006
Publication Title
20th International Parallel and Distributed Processing Symposium, IPDPS 2006
Volume
2006
Number of Pages
-
Document Type
Article; Proceedings Paper
Personal Identifier
scopus
DOI Link
https://doi.org/10.1109/IPDPS.2006.1639395
Copyright Status
Unknown
Socpus ID
33847145003 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/33847145003
STARS Citation
Yu, Han; Malinescu, Dan C.; Wu, Annie S.; Siegel, Howard Jay; and Daley, Rose A., "Plan Switching: An Approach To Plan Execution In Changing Environments" (2006). Scopus Export 2000s. 9107.
https://stars.library.ucf.edu/scopus2000/9107