A fast incremental algorithm for maintaining dispatchability of partially controllable plans

ICAPS 2007, 17th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2007, Pages 296-303

  Shah, Julie ^a   Stedl, John ^a   Williams, Brian ^a   Robertson, Paul ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DISPATCHABILITY; DISPATCHABLE EXECUTIONS; DYNAMIC CONTROL ALGORITHM; INCREMENTAL ALGORITHM; NEAR-REAL TIME; PLAN EXECUTION; REAL TIME SCHEDULING; REAL WORLD ENVIRONMENTS; REAL- TIME; UNCERTAINTY;

EID: 58349112733     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. [Bessiere, C. 1994] Arc-consistency and arc-consistency again. Artificial Intelligence 65, pages 179-190, 1994.
2. [Corment, T. H., Leiserson, C.E., Rivest, R. L. 1990] Introduction to Algorithms. MIT Press, Cambridge, MA.
3. [Dechter, R., Meiri, I., Pearl, J. 1991] Temporal constraint networks. AI, 49:61-95.
4. [Demestrescu, C., Emiliozzi, S., Italiano, G. 2004] Experimental analysis of dynamic all pairs shortest path algorithms. Proc. SODA'04, pp. 362-271.
5. [Doyle 1979] A truth maintenance system. AI, 12:231-272.
6. [Effinger 2006] Optimal Temporal Planning at Reactive Time Scales via Dynamic Backtracking Branch and Bound, S.M. Thesis, MIT.
7. [Hofmann, A., Williams, B. 2006] Robust execution of temporally flexible plans for bipedal walking devices. Proc. ICAPS-06.
8. [Koenig, S., Likhachev, M. 2001] Incremental A*. Advances in Neural Information Processing Systems (14).
9. [Morris, P., Muscettola, N. 2000] Execution of temporal plans with uncertainty. In: Proc. AAAI-00.
10. [Morris, P., Muscettola, N., Vidal, T. 2001] Dynamic Control of plans with temporal uncertainty. In: Proc. IJCAI-01.
11. [Muscettola, N., Morris, P., Tsmardinos, I. 1998]. Reformulating temporal plans for efficient execution. Proc. KRR-98.
12. [Muscettola, N., Nayak, P., Pell, B., Williams, B. 1998b] To boldly go where no AI system has gone before. AI 103(1):5-48.
13. [Radibeau, G., Knight, R., Chien, S., Fukunaga, A, et al. 1999] Iterative Repair Planning for Spacecraft Operations in the ASPEN System, Proc. i-SAIRAS.
14. [Robertson, P., Williams, B. 2005] A Model-Based System Supporting Automatic Self-Regeneration of Critical Software, Proceedings of the IFIP/IEEE Intl Workshop on Self-Managed Systems & Services, France.
15. [Shu, I., Effinger, R., Williams, C. 2005] Enabling Fast Flexible Planning through Incremental Temporal Reasoning, ICAPS-05.
16. [Stedl 2004] Managing Temporal Uncertainty Under Limited Communication: A Formal Model of Tight and Loose Team Communication, S.M. Thesis, MIT.
17. [Stenz 1995] The focused D* algorithm for real-time planning. ICAI.
18. [Tsamardinos, I., Muscettola, N., Morris, P. 1998] Fast transformation of temporal plans for efficient execution. Proc. AAAI-98.
19. [Vidal, T., Ghallab, M. 1996] Dealing with uncertain durations in temporal constraint networks dedicated to planning. Proc. ECAI-96.
20. [Vidal 1999] Handling contingency in temporal constraint networks: from consistencies to controllabilities. J. of Exp. & Th. AI, 11:23-45.
21. [Vidal 2000]. Controllability characterization and checking in contingent temporal constraint networks. Proc. KRR- 2000.
22. [Zweben, M., Davis, E., Daun, B., Deale, M. 1993] Scheduling and rescheduling with iterative repair. IEEE SMC 3(6):1588-1596.