Modelling mixed discrete-continuous domains for planning

Journal of Artificial Intelligence Research

Volumn 27, Issue , 2006, Pages 235-297

  Fox, Maria ^a   Long, Derek ^a  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATA THEORY; COMPUTER SIMULATION; CONFORMAL MAPPING; MATHEMATICAL MODELS; PROBLEM SOLVING; REAL TIME SYSTEMS; SEMANTICS; TIME DOMAIN ANALYSIS;

HYBRID AUTOMATA; LABELLED TRANSITION SYSTEMS; REACHABILITY PROBLEMS; SEMANTIC MODELS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 33750599596     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.2044     Document Type: Article

References (64)

1. Allen, J., & Koomen, J. A. (1983). Planning in a Temporal World Model. In Proceedings of the Eigth International Joint Conference on Artificial Intelligence, pp. 741-747.
2. Alur, R., & Dill, D. L. (1994). A Theory of Timed Automata. Theoretical Computer Science, 126, 183-235.
3. Androulakis, I. P. (2001). MINLP: Branch and Bound Methods. In Floudas, C. A., & Pardalos, P. M. (Eds.), Encyclopaedia of Optimisation, Vol. 3, pp. 325-331. Kluwer Academic.
4. Aylett, R., Soutter, J., Petley, G., Chung, P., & Edwards, D. (2001). Planning plant operating procedures for a chemical plant. Engineering Applications of Artificial Intelligence, 14(3).
5. Bacchus, F. (2003). The power of modeling - a response to PDDL2.1. Journal of AI Research, 20, 125-132.
6. Beasley, J., Krishnamoorthy, M., Sharaiha, Y., & Abramson, D. (2000). Scheduling Aircraft Landings: The Static Case. Transportation Science, 34(2), 180-197.
7. Behrmann, G., Larsen, K., & Rasmussen, J. (2005). Optimal Scheduling Using Priced Timed Automata, SIGMETRICS Perform. Eval. Rev., 32(4), 34-40.
8. Benazera, E., Brafman, R., Meuleau, N., Mausam, &; Hansen, E. A. (2005). An AO* Algorithm for Planning with Continuous Resources. In Workshop on Planning under Uncertainty for Autonomous Systems, associated with the International Conference on AI Planning and Scheduling (ICAPS).
9. Benders, J. F. (1962). Partitioning Procedures for Solving Mixed-Variables Programming Problems. Numerische Mathematik, 4, 238-252.
10. Blake, O., Bridges, J., Chester, E., Clemmet, J., Hall, S., Hannington, M., Hurst, S., Johnson, G., Lewis, S., Malin, M., Morison, I., Northey, D., Pullan, D., Rennie, G., Richter, L., Rothery, D., Shaughnessy, B., Sims, M., Smith, A., Townend, M., &: Waugh, L. (2004). Beagle2 Mars: Mission Report. Lander Operations Control Centre, National Space Centre, University of Leicester.
11. Boddy, M. (2003). Imperfect match: PDDL2. and real applications. Journal of AI Research, 20, 133-137.
12. Boddy, M., & Johnson, D. (2002). A new method for the solution of large systems of continuous constraints. In Proceedings of 1st International Workshop on Global Constrained Optimization and Constraint Satisfaction (COCOS-02).
13. Boddy, M., & Johnson, D. (2004). Integrated planning and scheduling for petroleum refinery operations. In Proceedings of ICAPS Workshop on Integrating Planning into Scheduling (WIPIS).
14. de Kleer, J., & Brown, J. S. (1984). A Qualitative Physics based on Confluences. Artificial Intelligence, 24, 7-83.
15. Dechter, R., Meiri, I., & Pearl, J. (1991). Temporal constraint networks. Artificial Intelligence, 49.
16. Dierks, H. (2005). Finding Optimal Plans for Domains with Restricted Continuous Effects with UPPAAL-cora. In First Workshop on Validation and Verification for Planning, ICAPS-05.
17. Edelkamp, S. (2003). Promela Planning. In Proceedings of 10th International SPIN Workshop on Model Checking of Software, pp. 197-212.
18. Forbus, K. (1984). Qualitative Process Theory. Artificial Intelligence, 24, 85-168.
19. Fox, M., Howey, R., &: Long, D. (2005). Exploration of the Robustness of Plans. In Workshop on Verification and Validation of Model-based Planning and Scheduling Systems, associated with the International Conference on AI Planning and Scheduling (ICAPS)).
20. Fox, M., Howey, R., &; Long, D. (2006). Exploration of the Robustness of Plans. In Proceedings of The 21st National Conference on Artificial Intelligence (AAAI-06).
21. Fox, M., & Long, D. (2003). PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of AI Research, 20, 61-124.
22. Fox, M., & Long, D. (2004). An Investigation into the Expressive Power of PDDL2.1. In Proceedings of the Sixteenth European Conference on Artificial Intelligence.
23. Frank, J., & Jónsson, A. (2003). Constraint-based Attribute and Interval Planning. Journal of Constraints, 8 (Special Issue on Constraints and Planning)(4), 339-364.
24. Frank, J., Jönsson, A., & Morris, P. (2000). On Reformulating Planning as Dynamic Constraint Satisfaction (Extended Abstract). In Symposium on Abstraction, Reformulation and Approximation (SARA).
25. Grossmann, I. E. (2002). Review of Nonlinear, Mixed-Integer and Disjunctive Programming Techniques. Optimization and Engineering, 3, 227-252.
26. Gupta, V., Henziner, T., & Jagadeesan, R. (1997). Robust Timed Automata. In HART'97: Hybrid and Real-time Systems, LNCS 1201, pp. 331-345. Springer-Verlag.
27. Haroud, D., & Faltings, B. (1994). Global Consistency for Continuous Constraints. In Principles and Practice of Constraint Programming, pp. 40-50.
28. Helmert, M. (2002). Decidability and undecidability results for planning with numerical state variables. In Proceedings of sixth conference on AI Planning Systems (AIPS).
29. Henzinger, T. (1996). The Theory of Hybrid Automata. In Proceedings of the 11th Annual Symposium on ogic in Computer Science. Invited tutorial., pp. 278-292. IEEE Computer Society Press.
30. Henzinger, T., Ho, P.-H., & Wong-Toi, H. (1995). A user guide to HYTECH. In E. Brinksma, W.R. Cleaveland, K.G. Larsen, T. Margaria, and B. Steffen, editors, Tool and Algorithms for the Construction and Analysis of Systems: (TACAS 95), volume 1019 of Lecture Notes in Computer Science, pp. 41-71.
31. Henzinger, T., & Raskin, J.-F. (2000). Robust Undecidability of Timed and Hybrid Systems. In Proceedings of the 3rd International Workshop on Hybrid Systems: Computation and Control. LNCS 1790., pp. 145-159. Springer-Verlag.
32. Henzinger, T. A., Kopke, P. W., Puri, A., & Varaiya, P. (1998). What's Decidable about Hybrid Automata?. Journal of Computer and System Sciences, 57, 94-124.
33. Herrmann, C. S., &; Thielscher, M. (1996). Reasoning about continuous processes. In Clancey, B., & Weld, D. (Eds.), Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI), pp. 639-644, Portland, OR. MIT Press.
34. Hoffmann, J., &: Edelkamp, S. (2005). The Classical Part of IPC-4: An Overview. Journal of AI Research, To appear.
35. Hofmann, A., & Williams, B. (2006). Robust execution of temporally flexible plans for bipedal walking devices. In Proceedings of 16th International Conference on Automated Planning and Scheduling (ICAPS), pp. 386-389.
36. Howey, R., Long, D., & Fox, M. (2004). VAL: Automatic plan validation, continuous effects and mixed initiative planning using PDDL. In Proceedings of 16th IEEE International Conference on Tools with Artificial Intelligence.
37. Jónsson, A., & Frank, J. (2000). A Framework for Dynamic Constraint Reasoning using Procedural Constraints. In Proceedings of 14th European Conference on AI, pp. 93-97.
38. Jónsson, A., Morris, P., Muscettola, N., Rajan, K., & Smith, B. (2000). Planning in Interplanetary Space: Theory and Practice. In Proceedings of 5th International Conference on AI Planning Systems, pp. 177-186.
39. Keller, R. (1976). Formal Verification of Parallel Programs. Communications of the ACM, 19(7), 371-384.
40. Kuipers, B. (1984). Commonsense Reasoning about Causality: Deriving Behaviour from Structure. Artificial Intelligence, 24, 169-203.
41. Laborie, P., & Ghallab, M. (1995). Planning with sharable resource constraints. In Proc. of 14th International Joint Conference on AI. Morgan Kaufmann.
42. Lamba, N., Dietz, M., Johnson, D., & Boddy, M. (2003). A method for global optimization of large systems of quadratic constraints. In Proceedings of 2nd International Workshop on Global Constrained Optimization and Constraint Satisfaction (COCOS-03).
43. Larsen, K. G., Behrmann, G., Brinksma, E., Fehnker, A., Hune, T., Pettersson, P., & Romijn, J. (2001). The use of optimistic and pessimistic resource profiles to inform search in an activity based planner. In Proceedings of 13th Conference on Computer Aided Verification (CAV-01)). Springer Verlag, Lecture Notes in Computer Science 2102.
44. Léauté, T., &; Williams, B. (2005). Coordinating Agile Systems through the Model-based Execution of Temporal Plans. In Proceedings of 20th National Conference on AI (AAAI), pp. 114-120.
45. McAllester, D., &; Rosenblitt, D. (1991). Systematic Nonlinear Planning. In Proceedings of the Ninth National Conference on Artificial Intelligence (AAAI-91), Vol. 2, pp. 634-639, Anaheim, California, USA. AAAI Press/MIT Press.
46. McDermott, D. (2003a). PDDL2.1 - The Art of the Possible? Commentary on Fox and Long. Journal of AI Research, 20, 145-148.
47. McDermott, D. (2003b). Reasoning about autonomous processes in an estimated-regression planner. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS'03).
48. McDermott, D. (2005). Reasoning about Autonomous Processes in an Estimated Regression Planner. In Proceedings of 13th International Conference on Automated Planning and Scheduling (ICAPS), pp. 143-152. AAAI-Press.
49. McDermott, D., & the AIPS'98 Planning Competition Committee (1998). PDDL-the planning domain definition language. Tech. rep., Available at: www.cs.yale.edu/homes/dvm.
50. McDermott, D. (2004). The Opt and Optop API. Tech. rep., Yale University.
51. Muscettola, N. (1993). HSTS: Integrating Planning and Scheduling. In Zweben, M., &; Fox, M. (Eds.), Intelligent Scheduling, pp. 169-212. Morgan Kaufmann, San Mateo, CA.
52. Musliner, D. J., Durfee, E. H., & Shin, K. G. (1993). CIRCA: A Cooperative Intelligent Real-time Control Archtecture. IEEE Transactions on Systems, Man and Cybernetics, 23(6), 1561-1574.
53. Penberthy, J., & Weld, D. (1992). UCPOP: a sound, complete, partial-order planner for ADL. In Proc. Int. Conf. On Principles of Knowledge Representation and Reasoning, pp. 103-114, Los Altos, CA. Kaufmann.
54. Penberthy, S., & Weld, D. (1994). Temporal Planning with Continuous Change. In Proceedings of the Twelfth National Conference on Artificial Intelligence (AAAI), pp. 1010-1015. AAAI/MIT Press.
55. Rasmussen, J. I., Larsen, K. G., & Subramani, K. (2004). Resource Optimal Scheduling using Priced Timed Automata. In Proceedings of 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pp. 220-235. Springer-Verlag, Lecture Notes in Computer Science, 2988.
56. Reiter, R. (1996). Natural Actions, Concurrency and Continuous Time in the Situation Calculus. In Aiello, L., Doyle, J., & Shapiro, S. (Eds.), KR-96: Principles of Knowledge Representation and Reasoning, pp. 2-13. Morgan Kaufmann.
57. Reiter, R. (2001). Knowledge in Action: Logical Foundations for Secifying and Implementing Dynamical Systems. MIT Press.
58. Sandewall, E. (1989). Combining Logic and Differential Equations for describing Real World Systems. In Proceedings of Knowledge Representation (KR), pp. 412-420.
59. Shanahan, M. (1990). Representing Continuous Change in the Event Calculus. In Proceedings of 9th European Conference on AI, pp. 598-603.
60. Shin, J.-A., & Davis, E. (2005). Processes and Continuous Change in a SAT-based Planner. Artificial Intelligence, 166, 194-253.
61. Smith, D. (2003). The case for durative actions: A commentary on PDDL2.1. Journal of AI Research, 20, 149-154.
62. Wolfman, S., & Weld, D. (1999). The LPSAT System and its Application to Resource Planning. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence.
63. Wu, S. J., & Chow, P. T. (1995). Genetic Algorithms for Nonlinear Mixed Discrete-Integer Optimization Problems via Meta-Genetic Parameter Optimization. Engineering Optimization, 24(2), 137-159.
64. Yi, W., Larsen, K., & Pettersson, P. (1997). UPPAAL in a Nutshell. International Journal of Software Tools for Technology Transfer, 1(1).