Timelines with temporal uncertainty

Proceedings of the 27th AAAI Conference on Artificial Intelligence, AAAI 2013

Volumn , Issue , 2013, Pages 195-201

  Cimatti, Alessandro ^a   Micheli, Andrea ^a,b   Roveri, Marco ^a  

^a FONDAZIONE BRUNO KESSLER   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

PLANNING DOMAINS; REAL-WORLD; SATISFIABILITY MODULO THEORIES; STATE OF THE ART; TEMPORAL ASPECTS; TEMPORAL UNCERTAINTY; TIME TRIGGERED; WELL-FOUNDED FRAMEWORK;

ARTIFICIAL INTELLIGENCE;

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

References (32)

1. Allen, J. F. 1983. Maintaining knowledge about temporal intervals. Communication of the ACM 26(11):832-843.
2. Angelsmark, O., and Jonsson, P. 2000. Some observations on durations, scheduling and allen?s algebra. In CP, 484-488.
3. Barreiro, J.; Boyce, M.; Do, M.; Frank, J.; Iatauro, M.; Kichkaylo, T.; Morris, P.; Ong, J.; Remolina, E.; Smith, T.; and Smith, D. 2012. EUROPA: A Platform for AI Planning, Scheduling, Constraint Programming, and Optimization. In Proc. of 4th International Competition on Knowledge Engineering for Planning and Scheduling (ICKEPS).
4. Barrett, C. W.; Sebastiani, R.; Seshia, S. A.; and Tinelli, C. 2009. Satisfiability modulo theories. In Handbook of Satisfiability. IOS Press. 825-885.
5. Bernardini, S. 2008. Constraint-based Temporal Planning: Issues in Domain Modelling and Search Control. Ph.D. Dissertation, Faculty of Computer Science - University of Trento (Italy).
6. Cesta, A.; Fratini, S.; Oddi, A.; and Pecora, F. 2008. APSI Case#1: Pre-planning Science Operations in Mars Express. In Proceedings of i-SAIRAS-08, the 9th International Symposium in Artificial Intelligence, Robotics and Automation in Space.
7. Cesta, A.; Cortellessa, G.; Fratini, S.; Oddi, A.; and Rasconi, R. 2009a. The APSI Framework: a Planning and Scheduling Software Development Environment. In Working Notes of the ICAPS-09 Application Showcase Program.
8. Cesta, A.; Cortellessa, G.; Fratini, S.; and Oddi, A. 2009b. Developing an end-to-end planning application from a timeline representation framework. In Haigh, K. Z., and Rychtyckyj, N., eds., IAAI. AAAI.
9. Cesta, A.; Finzi, A.; Fratini, S.; Orlandini, A.; and Tronci, E. 2010a. Analyzing flexible timeline-based plans. In Coelho, H.; Studer, R.; and Wooldridge, M., eds., ECAI, volume 215 of Frontiers in Artificial Intelligence and Applications, 471-476. IOS Press.
10. Cesta, A.; Finzi, A.; Fratini, S.; Orlandini, A.; and Tronci, E. 2010b. Validation and verification issues in a timeline-based planning system. Knowledge Eng. Review 25(3):299-318.
11. Cesta, A.; Cortellessa, G.; Fratini, S.; and Oddi, A. 2011. Mrspock - steps in developing an end-to-end space application. Computational Intelligence 27(1):83-102.
12. Cesta, A.; Fratini, S.; and Pecora, F. 2008. Planning with multiplecomponents in omps. In Nguyen, N. T.; Borzemski, L.; Grzech, A.; and Ali, M., eds., IEA/AIE, volume 5027 of Lecture Notes in Computer Science, 435-445. Springer.
13. Cheng, C.-C., and Smith, S. F. 1994. Generating feasible schedules under complex metric constraints. In Hayes-Roth, B., and Korf, R. E., eds., AAAI, 1086-1091. AAAI Press / The MIT Press.
14. Cimatti, A.; Griggio, A.; Sebastiani, R.; and Schaafsma, B. 2012. The MathSAT5 SMT solver. http://mathsat.fbk.eu.
15. Cimatti, A.; Micheli, A.; and Roveri, M. 2012a. Solving temporal problems using smt: Strong controllability. In CP, 248-264.
16. Cimatti, A.; Micheli, A.; and Roveri, M. 2012b. Solving temporal problems using smt: Weak controllability. In AAAI.
17. Coles, A.; Fox, M.; Halsey, K.; Long, D.; and Smith, A. 2009. Managing concurrency in temporal planning using plannerscheduler interaction. Artif. Intell. 173(1):1-44.
18. Coles, A. J.; Coles, A.; Fox, M.; and Long, D. 2012. Colin: Planning with continuous linear numeric change. J. Artif. Intell. Res. (JAIR) 44:1-96.
19. Donati, A.; Policella, N.; Cesta, A.; Fratini, S.; Oddi, A.; Cortellessa, G.; Pecora, F.; Schulster, J.; Rabenau, E.; Niezette, M.; and Steel, R. 2008. Science Operations Pre-Planning & Optimization using AI constraint- resolution - the APSI Case Study 1. In Proceedings of SpaceOps-08, the 10th International Conference on Space Operations.
20. Drakengren, T., and Jonsson, P. 1997. Eight maximal tractable subclasses of allen?s algebra with metric time. J. Artif. Intell. Res. (JAIR) 7:25-45.
21. Frank, J., and Jónsson, A. 2003. Constraint-based Attribute and Interval Planning. Constraints 8(4):339-364.
22. Ghallab, M., and Laruelle, H. 1994. Representation and control in ixtet, a temporal planner. In AIPS, 61-67.
23. Loos, R., and Weispfenning, V. 1993. Applying linear quantifier elimination. Computer Journal 36(5):450-462.
24. Monniaux, D. 2008. A Quantifier Elimination Algorithm for Linear Real Arithmetic. In Logic for Programming, Artificial Intelligence, and Reasoning - LPAR, 243-257.
25. Morris, P. H.; Muscettola, N.; and Vidal, T. 2001. Dynamic control of plans with temporal uncertainty. In International Joint Conference on Artificial Intelligence - IJCAI, 494-502.
26. Muscettola, N. 1993. Hsts: Integrating planning and scheduling. Technical report, DTIC Document.
27. Peintner, B.; Venable, K. B.; and Yorke-Smith, N. 2007. Strong controllability of disjunctive temporal problems with uncertainty. In Bessiere, C., ed., Principles and Practice of Constraint Programming - CP, volume 4741 of LNCS, 856-863. Springer.
28. Schrijver, A. 1998. Theory of Linear and Integer Programming. J. Wiley & Sons.
29. Venable, K. B.; Volpato, M.; Peintner, B.; and Yorke-Smith, N. 2010. Weak and dynamic controllability of temporal problems with disjunctions and uncertainty. In Workshop on Constraint Satisfaction Techniques for Planning & Scheduling, 50-59.
30. Verfaillie, G.; Pralet, C.; and Lema?itre, M. 2010. How to model planning and scheduling problems using constraint networks on timelines. Knowledge Eng. Review 25(3):319-336.
31. Vidal, T., and Fargier, H. 1999. Handling contingency in temporal constraint networks: from consistency to controllabilities. Journal of Experimental Theoretical Artificial Intelligence 11(1):23-45.
32. Wetprasit, R., and Sattar, A. 1998. Temporal reasoning with qualitative and quantitative information about points and durations. In Mostow, J., and Rich, C., eds., AAAI/IAAI, 656-663. AAAI Press / The MIT Press.