P3 C: A new algorithm for the Simple Temporal Problem

ICAPS 2008 - Proceedings of the 18th International Conference on Automated Planning and Scheduling

Volumn , Issue , 2008, Pages 256-263

  Planken, Léon ^a   De Weerdt, Mathijs ^a   Van Der Krogt, Roman ^b  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

TRIANGULATION;

CONSTRAINT GRAPHS; EFFICIENT METHODS; NUMBER OF TRIANGLES; PATH CONSISTENCIES; SCHEDULING PROBLEMS; TIME COMPLEXITY; TIME CONSTRAINTS;

SCHEDULING;

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

References (22)

1. Anselma, L.; Terenziani, P.; Montani, S.; and Bottrighi, A. 2006. Towards a comprehensive treatment of repetitions, periodicity and temporal constraints in clinical guidelines. Artificial Intelligence in Medicine 38(2): 171-195.
2. Bliek, C., and Sam-Haroud, D. 1999. Path consistency on triangulated constraint graphs. In Proc. of the 16th Int. Joint Conf. on Artificial Intelligence, 456-461. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
3. Buzing, P., and Witteveen, C. 2004. Distributed (re)- planning with preference information. In Verbrugge, R.; Taatgen, N.; and Schomaker, L., eds., Proc. of the I6th Belgium-Netherlands Conf. on AI, 155-162.
4. Castillo, L.; Fdez-Olivares, J.; and Gonzalez, A. 2002. A temporal constraint network based temporal planner. In Proc. of the 21st Workshop of the UK Planning and Scheduling Special Interest Group, 99-109.
5. Cresswell, S., and Coddington, A. 2003. Planning with timed literals and deadlines. In Proc. of the Twenty-Second Workshop of the UK Planning and Scheduling Special Interest Group (PlanSIG-03), 22-35.
6. Dechter, R.; Meiri, I.; and Pearl, J. 1991. Temporal constraint networks. Artificial Intelligence 49(1-3):61-95.
7. Dechter, R. 2003. Constraint Processing. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
8. Fukunaga, A.; Rabideau, G.; Chien, S.; and Yan, D. 1997. Aspen: A framework for automated planning and scheduling of spacecraft control and operations. In Proc. of the Int. Symposium on AI, Robotics and Automation in Space.
9. Garrido, A., and Barber, F. 2001. Integrating planning and scheduling. Applied Artificial Intelligence 15:471-491.
10. Halsey, K.; Long, D.; and Fox, M. 2004. CRIKEY - a temporal planner looking at the integration of planning and scheduling. In Proc. of the ICAPS 2004 Workshop on Integrating Planning into Scheduling, 46-52.
11. Kjærulff, U. 1990. Triangulation of graphs - algorithms giving small total state space. Technical report, Aalborg University.
12. McVey, C. B.; Durfee, E. H.; Atkins, E. M.; and Shin, K. G. 1997. Development of iterative real-time scheduler to planner feedback. In Proc. of the 15th Int. Joint Conf on Artificial Intelligence, 1267-1272.
13. Montanari, U. 1974. Networks of constraints: Fundamental properties and applications to picture processing. Information Science 7(66):95-132.
14. Myers, K., and Smith, S. 1999. Issues in the integration of planning and scheduling for enterprise control. In Proc. of the DARPA Symposium on Advances in Enterprise Control.
15. Nau, D.; Ghallab, M.; and Traverso, P. 2004. Automated Planning: Theory & Practice. Morgan Kaufmann Publishers.
16. Ranise, S., and Tinelli, C. 2003. The SMT-LIB format: An initial proposal. In Proceedings of PDPAR'03.
17. Srivastava, B.; Kambhampati, S.; and Do, M. B. 2001. Planning the project management way: Efficient planning by effective integration of causal and resource reasoning in realplan. Artificial Intelligence 131(1-2):73-134.
18. Stergiou, K., and Koubarakis, M. 2000. Backtracking algorithms for disjunctions of temporal constraints. Artificial Intelligence 120(1):81-117.
19. Vidal, T., and Bidot, J. 2001. Dynamic sequencing of tasks in simple temporal networks with uncertainty. In CP 2001 Workshop in Constraints and Uncertainty.
20. West, D. B. 1996. Introduction to Graph Theory. Prentice-Hall.
21. Xu, L., and Choueiry, B. Y. 2003. A new efficient algorithm for solving the Simple Temporal Problem. In Proc. of the 10th Int. Symp. on Temporal Representation and Reasoning and 4th Int. Conf on Temporal Logic, 210-220. IEEE Computer Society.
22. Younes, H. L. S., and Simmons, R. G. 2003. VHPOP: Versatile heuristic partial order planner. Journal of AI Research 20:405-4130.