Enabling fast flexible planning through incremental temporal reasoning with conflict extraction

ICAPS 2005 - Proceedings of the 15th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2005, Pages 252-261

  Shu, I Hsiang ^a   Effinger, Robert ^a   Williams, Brian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EXECUTION UNCERTAINTIES; INCREMENTAL ALGORITHM; NETWORK OPTIMIZATION; SHORTEST PATH ALGORITHMS; TEMPORAL CONSISTENCY; TEMPORAL CONSTRAINTS; TEMPORAL PLAN NETWORKS; TIMING CONSTRAINTS;

ARTIFICIAL INTELLIGENCE; AUTONOMOUS AGENTS; EXTRACTION; PLANNING;

ALGORITHMS;

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

References (16)

1. Ahuja, R.; Magnanti T.; Orlin J, 1958. Network Flows: Theory, Algorithms, and Applications. Prentice Hall.
2. Cesta, A. and Oddi, A., 1996. Gaining Efficiency and Flexibility in the Simple Temporal Problem, 3rd Workshop on Temporal Representation and Reasoning.
3. Dechter, R.; Meiri, I.; Pearl, J., 1991. Temporal Constraint Networks. Artificial Intelligence, 49:61-95.
4. Estlin, T.; et, al., 2000. Using Continuous Planning Techniques to Coordinate Multiple Rovers. Electronic Transactions on Artificial Inttligence, 4:45-57.
5. Gelle, E. and Sabin, M., 2003. Solving Methods for Conditional Constraint Satisfaction. In IJCAI-2003.
6. Gerevini, A., et, al., 1996. Incremental Algorithms for Managing Temporal Constraints. 8th International Conference of Tools with Artificial Intelligence.
7. Ginsberg, M.L., 1993. Dynamic backtracking. Journal of Al Research, 1:25-46.
8. Kim, P.; Williams, B. and Abrahmson, M, 2001. Executing Reactive, Model-based Programs through Graph-based Temporal Planning. IJCAI-2001.
9. Koenig, S. and Likhachev, M., 2001. Incremental A*. In Adv. in Neural Information Processing Systems 14.
10. McAllester, D., 1991. Truth Maintenance, ln Proceedings ofAAAI-90, 1109-1116.
11. Muscettola, N., et, al., 1998. Issues in temporal reasoning for autonomous control systems. In Autonomous Agents.
12. Prosser, P., 1993. Hybrid algorithms for the constraint satisfaction problem, Comp. Intelligence. 3 268-299.
13. Rabideau, G., et, al., 1999. Iterative Repair Planning for Spacecraft Operations in the ASPEN System. ISAIRAS.
14. Stergiou, K and Koubarakis, M., 1998. Backtracking Algorithms for Disjunctions of Temporal Constraints. 15' Nat. Conference of Artificial Intelligence, 81-117.
15. Tsamardinos, I., Vidal T. Pollack, M., 2003. CTP: A new constraint-based formalism for conditional, temporal planning. Constraints., vol. 8, no. 4, pp. 365-388.
16. Williams, B. and Ragno, J., 2002. Conflict-directed A* and its role in model-based embedded systems. Journal of Discrete Applied Math.