COLIN: Planning with continuous linear numeric change

Journal of Artificial Intelligence Research

Volumn 44, Issue , 2012, Pages 1-96

  Coles, Amanda ^a   Coles, Andrew ^a   Fox, Maria ^a   Long, Derek ^a  

^a KING'S COLLEGE LONDON   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK DOMAINS; HEURISTIC SEARCH; LINEAR PROGRAMS; MIXED INTEGER PROGRAMMING; PDDL2.1; REASONING CAPABILITIES; RELAXED PLANNING GRAPHS; TIGHTLY-COUPLED; TIME STAMPS;

HEURISTIC ALGORITHMS; SEMANTICS;

PLANNING;

EID: 84866858053     PISSN: None     EISSN: 10769757     Source Type: Journal    
DOI: None     Document Type: Article

References (77)

1. Audemard, G., Bertoli, P., Cimatti, A., Kornilowicz, A., & Sebastiani, R. (2002). A SAT-based approach for solving formulas over boolean and linear mathematical propositions. In Proceedings of the 18th International Conference on Automated Deduction, Vol. 2392, pp. 193-208. Springer-Verlag, LNAI Series.
2. Blum, A., & Furst, M. (1995). Fast Planning through Planning Graph Analysis. In Proceedings of the International Joint Conference on Artificial Inteligence (IJCAI).
3. Boddy, M. S., & Johnson, D. P. (2002). A New Method for the Global Solution of Large Systems of Continuous Constraints. In Proceedings of the 1st International Workshop on Global Constraint Optimization and Constraint Satisfaction (COCOS), Vol. 2861 of Lecture Notes in Computer Science, pp. 142-156. Springer.
4. Cesta, A., & Oddi, A. (1996). Gaining Efficiency and Flexibility in the Simple Temporal Problem. In Proceedings of the 3rd InternationalWorkshop on Temporal Representation and Reasoning (TIME).
5. Cesta, A., Cortellessa, G., Fratini, S., & Oddi, A. (2009). Developing an End-to-End Planning Application from a Timeline Representation Framework. In Proceedings of 21st Conference on Innovative Applications of Artificial Intelligence (IA*AI).
6. Chien, S. A., Tran, D., Rabideau, G., Schaffer, S. R., Mandl, D., & Frye, S. (2010). Timeline-Based Space Operations Scheduling with External Constraints. In Proceedings of the International Conference on AI Planning and Scheduling (ICAPS), pp. 34-41.
7. Cimatti, A., Giunchiglia, F., Giunchiglia, E., & Traverso, P. (1997). Planning via Model Checking: A Decision Procedure for R. In Recent Advances in AI Planning, 4th European Conference on Planning, ECP, pp. 130-142.
8. Coles, A. I., Fox, M., Halsey, K., Long, D., & Smith, A. J. (2008). Managing concurrency in temporal planning using planner-scheduler interaction. Artificial Intelligence, 173, 1-44.
9. Coles, A. I., Fox, M., Long, D., & Smith, A. J. (2008a). Planning with Problems Requiring Temporal Coordination. In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 08).
10. Coles, A. I., Fox, M., Long, D., & Smith, A. J. (2008b). A Hybrid Relaxed Planning GraphLP Heuristic for Numeric Planning Domains. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS), pp. 52-59.
11. Coles, A. J., Coles, A. I., Fox, M., & Long, D. (2009a). Extending the Use of Inference in Temporal Planning as Forwards Search. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 09).
12. Coles, A. J., Coles, A. I., Fox, M., & Long, D. (2009b). Temporal Planning in Domains with Linear Processes. In Proceedings of the 21st International Joint Conference on Artificial Intelligence (IJCAI). AAAI Press.
13. Cushing, W., Kambhampati, S., Mausam, & Weld, D. (2007). When is temporal planning really temporal planning?. In Proceedings of the International Joint Conference on AI (IJCAI), pp. 1852-1859.
14. Dechter, R., Meiri, I., & Pearl, J. (1989). Temporal Constraint Networks. In Proceedings of Principles of Knowledge Representation and Reasoning (KR), pp. 83-93. Toronto, Canada.
15. Dierks, H. (2005). Finding Optimal Plans for Domains with Restricted Continuous Effects with UPPAAL-Cora. In ICAPS Workshop on Verification and Validation of Model-Based Planning and Scheduling Systems.
16. Do, M. B., & Kambhampati, S. (2003). Sapa: A Multi-objective Metric Temporal Planner. Journal of Artificial Intelligence Research (JAIR), 20, 155-194.
17. Edelkamp, S. (2003). Taming numbers and durations in a model-checking integrated planning system. Journal of Artificial Intelligence Research (JAIR), 20, 195-238.
18. Edelkamp, S., & Jabbar, S. (2006). Cost-Optimal External Planning. In Proceedings of the 21st National (American) Conference on Artificial Intelligence (AAAI). AAAI Press.
19. Eyerich, P., Mattmüller, R., & Röger, G. (2009). Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009). AAAI Press.
20. Fox, M., & Long, D. (2003). PDDL2.1: An extension of PDDL for expressing temporal planning domains. Journal of Artificial Intelligence Research (JAIR), 20, 61-124.
21. Fox, M., & Long, D. (2006). Modelling Mixed Discrete-Continuous Domains for Planning. Journal of Artificial Intelligence Research (JAIR), 27, 235-297.
22. Fox, M., Howey, R.,& Long, D. (2005). Validating Plans in the Context of Processes and Exogenous Events. In Proceedings of the 20th National Conference on Artificial Intelligence and the 17th Innovative Applications of Artificial Intelligence Conference (AAAI), pp. 1151-1156.
23. Fox, M., Long, D., & Halsey, K. (2004). An Investigation into the Expressive Power of PDDL2.1. In Proceedings of the 16th European Conference of Artificial Intelligence (ECAI).
24. Fox, M., Long, D., & Magazzeni, D. (2011). Automatic Construction of Efficient Multiple Battery Usage Policies. In Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS).
25. Frank, J., & Jónsson, A. K. (2003). Constraint-Based Attribute and Interval Planning. Constraints, 8(4), 339-364.
26. Garrido, A., Fox, M., & Long, D. (2002). A Temporal Planning System for Durative Actions of PDDL2.1. In Proceedings of the 15th Eureopean Conference on Artificial Intelligence (ECAI), pp. 586-590.
27. Garrido, A., Onainda, E., & Barber, F. (2001). A Temporal Planning System for Time-Optimal Planning. In Proceedings of the 10th Portuguese Conference on Artificial Intelligence, pp. 379-392. Springer.
28. Gerevini, A., Saetti, A., & Serina, I. (2006). An Approach to Temporal Planning and Scheduling in Domains with Predictable Exogenous Events. Journal of Artificial Intelligence Research (JAIR), 25, 187-231.
29. Gerevini, A., Saetti, A., & Serina, I. (2010). Temporal Planning with Problems Requiring Concurrency through Action Graphs and Local Search. In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS).
30. Gerevini, A., & Serina, I. (2000). Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques. In Proceedings of the 5th International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 112-121.
31. Ghallab, M., & Laruelle, H. (1994). Representation and Control in IxTeT, a Temporal Planner. In Proceedings of the 2nd International Conference on Artificial Intelligence Planning Systems (AIPS), pp. 61-67.
32. Halsey, K. (2005). CRIKEY!: It's co-ordination in temporal planning. Ph.D. thesis, University of Durham.
33. Haslum, P., & Geffner, H. (2001). Heuristic planning with time and resources. In Proceedings of the 6th European Conference on Planning (ECP'01), pp. 121-132.
34. Haslum, P. (2009). Admissible Makespan Estimates for PDDL2.1 Temporal Planning. In Proceedings of the ICAPS Workshop on Heuristics for Domain-Independent Planning.
35. Helmert, M. (2006). The Fast Downward Planning System. Journal of Artificial Intelligence (JAIR), 26, 191-246.
36. Henzinger, T. (1996). The Theory of Hybrid Automata. In Proceedings of the 11th Annual Symposium on Logic in Computer Science. Invited tutorial., pp. 278-292. IEEE Computer Society Press.
37. 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.
38. Hoffmann, J. (2003). The Metric-FF Planning System: Translating "Ignoring Delete Lists" to Numeric State Variables. Journal of Artificial Intelligence Research (JAIR), 20, 291-341.
39. Hoffmann, J., & Edelkamp, S. (2005). The Deterministic Part of IPC-4: An Overview. Journal of Artificial Intelligence Research (JAIR), 24, 519-579.
40. Hoffmann, J., & Nebel, B. (2001). The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research (JAIR), 14, 253-302.
41. Huang, R., Chen, Y., & Zhang, W. (2009). An Optimal Temporally Expressive Planner: Initial Results and Application to P2P Network Optimization. In Proceedings of the International Conference on Automated Planning and Scheduling (ICAPS).
42. Knight, R., Schaffer, S., & B.Clement (2009). Power planning in the international space station domain. In Proceedings of the 6th International Workshop on Planning and Scheduling for Space (IWPSS).
43. Lamba, N., Dietz, M., Johnson, D. P., & Boddy, M. S. (2003). A Method for Global Optimization of Large Systems of Quadratic Constraints. In Proceedings of the 2nd International Workshop on Global Optimization and Constraint Satisfaction (COCOS), Vol. 3478 of Lecture Notes in Computer Science, pp. 61-70. Springer.
44. Léauté, T., &Williams, B. (2005). Coordinating Agile Systems through the Model-based Execution of Temporal Plans. In Proceedings of the 20th National Conference on AI (AAAI).
45. Li, H., &Williams, B. (2008). Generative systems for hybrid planning based on flow tubes. In Proc. 18th Int. Conf. on Aut. Planning and Scheduling (ICAPS).
46. Li, H., & Williams, B. (2011). Hybrid Planning with Temporally Extended Goals for Sustainable Ocean Observing. In Proceedings of the International Conference of the Association for the Advancement of AI (AAAI): Special Track on Sustainability and AI.
47. Long, D., & Fox, M. (2003a). Exploiting a Graphplan Framework in Temporal Planning. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS), pp. 52-61.
48. Long, D., & Fox, M. (2003b). The 3rd International Planning Competition: Results and Analysis. Journal of Artificial Intelligence Research (JAIR), 20, 1-59.
49. Lougee-Heimer, R. (2003). The Common Optimization INterface for Operations Research. IBM Journal of Research and Development, 47(1), 57-66.
50. McDermott, D. (2003). Reasoning about Autonomous Processes in an Estimated Regression Planner. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS).
51. McDermott, D. V. (2000). The 1998 AI Planning Systems Competition. AI Magazine, 21(2), 35-55.
52. Meuleau, N., Benazera, E., Brafman, R. I., Hansen, E. A., & Mausam (2009). A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. Journal of Artificial Intelligence Research (JAIR), 34, 27-59.
53. Palacios, H., & Geffner, H. (2009). Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width. Journal of Artificial Intelligence Research (JAIR), 35, 623-675.
54. Pednault, E. P. D. (1989). ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus. In Proceedings of the International Conference on Knowledge Representation (KR), pp. 324-332.
55. Pell, B., Gat, E., Keesing, R., Muscettola, N., & Smith, B. D. (1997). Robust Periodic Planning and Execution for Autonomous Spacecraft. In Proceedings of the International Joint Conference on AI (IJCAI), pp. 1234-1239.
56. Penberthy, S., & Weld, D. (1994). Temporal Planning with Continuous Change. In Proceedings of the 12th National Conference on AI (AAAI), pp. 1010-1015. AAAI/MIT Press.
57. Penna, G. D., Intrigila, B., Magazzeni, D., & Mercorio, F. (2009). UPMurphi: a Tool for Universal Planning on PDDL+ Problems. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 19-23. AAAI Press.
58. Penna, G. D., Intrigila, B., Magazzeni, D., & Mercorio, F. (2010). A PDDL+ Benchmark Problem: The Batch Chemical Plant. In Proceedings of the International Conference on AI Planning and Scheduling (ICAPS), pp. 222-225.
59. Reddy, S. Y., Frank, J. D., Iatauro, M. J., Boyce, M. E., Kürklü, E., Ai-Chang, M., & Jónsson, A. K. (2011). Planning Solar Array Operations on the International Space Station. ACM Transactions on Intelligent Systems Technology, 2, 1-24.
60. Richter, S., & Westphal, M. (2010). The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks. Journal of Artificial Intelligence Research (JAIR), 39, 127-177.
61. Shin, J., & Davis, E. (2005). Processes and Continuous Change in a SAT-based Planner. Artificial Intelligence, 166, 194-253.
62. Li, H., & Williams, B. (2011). Hybrid Planning with Temporally Extended Goals for Sustainable Ocean Observing. In Proceedings of the International Conference of the Association for the Advancement of AI (AAAI): Special Track on Sustainability and AI.
63. Long, D., & Fox, M. (2003a). Exploiting a Graphplan Framework in Temporal Planning. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS), pp. 52-61.
64. Long, D., & Fox, M. (2003b). The 3rd International Planning Competition: Results and Analysis. Journal of Artificial Intelligence Research (JAIR), 20, 1-59.
65. Lougee-Heimer, R. (2003). The Common Optimization INterface for Operations Research. IBM Journal of Research and Development, 47(1), 57-66.
66. McDermott, D. (2003). Reasoning about Autonomous Processes in an Estimated Regression Planner. In Proceedings of the 13th International Conference on Automated Planning and Scheduling (ICAPS).
67. McDermott, D. V. (2000). The 1998 AI Planning Systems Competition. AI Magazine, 21(2), 35-55.
68. Meuleau, N., Benazera, E., Brafman, R. I., Hansen, E. A., & Mausam (2009). A Heuristic Search Approach to Planning with Continuous Resources in Stochastic Domains. Journal of Artificial Intelligence Research (JAIR), 34, 27-59.
69. Palacios, H., & Geffner, H. (2009). Compiling Uncertainty Away in Conformant Planning Problems with Bounded Width. Journal of Artificial Intelligence Research (JAIR), 35, 623-675.
70. Pednault, E. P. D. (1989). ADL: Exploring the Middle Ground Between STRIPS and the Situation Calculus. In Proceedings of the International Conference on Knowledge Representation (KR), pp. 324-332.
71. Pell, B., Gat, E., Keesing, R., Muscettola, N., & Smith, B. D. (1997). Robust Periodic Planning and Execution for Autonomous Spacecraft. In Proceedings of the International Joint Conference on AI (IJCAI), pp. 1234-1239.
72. Penberthy, S., & Weld, D. (1994). Temporal Planning with Continuous Change. In Proceedings of the 12th National Conference on AI (AAAI), pp. 1010-1015. AAAI/MIT Press.
73. Penna, G. D., Intrigila, B., Magazzeni, D., & Mercorio, F. (2009). UPMurphi: a Tool for Universal Planning on PDDL+ Problems. In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 19-23. AAAI Press.
74. Penna, G. D., Intrigila, B., Magazzeni, D., & Mercorio, F. (2010). A PDDL+ Benchmark Problem: The Batch Chemical Plant. In Proceedings of the International Conference on AI Planning and Scheduling (ICAPS), pp. 222-225.
75. Reddy, S. Y., Frank, J. D., Iatauro, M. J., Boyce, M. E., Kürklü, E., Ai-Chang, M., & Jónsson, A. K. (2011). Planning Solar Array Operations on the International Space Station. ACM Transactions on Intelligent Systems Technology, 2, 1-24.
76. Richter, S., & Westphal, M. (2010). The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks. Journal of Artificial Intelligence Research (JAIR), 39, 127-177.
77. Shin, J., & Davis, E. (2005). Processes and Continuous Change in a SAT-based Planner. Artificial Intelligence, 166, 194-253.