Abstract
Planning technology has made huge strides, alongside other combinatorial optimisation solving technologies, over the past decade. Automated planning systems now exist for temporal and metric problems, including management of continuous time and concurrency, continuous numeric resources and action costs [3,1,2,12,7,8,11,9]. There is an increasing interest in combining planners with specialised solvers, such as optimisation alogorithms, to achieve a hybrid form of planning. In this context, the relationship between planning and model-checking, planning and constraint-solving and planning and control are all being clarified.
Thanks to my generous collaborators and co-authors who have contributed to this work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Coles, A., Coles, A., Fox, M., Long, D.: COLIN: Planning with continuous linear numeric change. Journal of Art. Int. Research 44, 1–96 (2012)
Coles, A.I., Fox, M., Long, D., Smith, A.J.: A Hybrid Relaxed Planning Graph-LP Heuristic for Numeric Planning Domains. In: Proc. 18th Int. Conf. on Automated Planning and Scheduling (ICAPS) (2008)
Coles, A.J., Coles, A.I., Fox, M., Long, D.: Forward-Chaining Partial-Order Planning. In: Proc. 20th Int. Conf. on Aut. Planning and Scheduling, ICAPS (2010)
Fox, M., Howey, R., Long, D.: Validating plans in the context of processes and exogenous events. In: Veloso, M.M., Kambhampati, S. (eds.) Proc. Nat. Conf. on AI, AAAI, pp. 1151–1156. AAAI Press / The MIT Press (2005)
Gao, S., Kong, S., Clarke, E.: Satisfiability Modulo ODEs. In: Proc. Formal Methods in Computer-Aided Design, FMCAD (2013)
Gregory, P., Long, D., Fox, M., Beck, J.C.: Planning Modulo Theories: Extending the Planning Paradigm. In: Proc. 22nd Int. Conf. on Automated Planning and Scheduling, ICAPS (2012)
Ivankovic, F., Haslum, P., Thiebaux, S., Shivashankar, V., Nau, D.: Optimal planning with global numerical state constraints. In: Proceedings of 24th Int. Conf. on Aut. Planning and Scheduling, ICAPS (2014)
Lipovetzky, N., Burt, C.N., Pearce, A.R., Stuckey, P.J.: Planning for Mining Operations with Time and Resource Constraints. In: Proceedings of 24th Int. Conf. on Aut. Planning and Scheduling, ICAPS (2014)
Löhr, J., Eyerich, P., Winkler, S., Nebel, B.: Domain Predictive Control Under Uncertain Numerical State Information. In: Proc. 23rd Int. Conf. on Automated Planning and Scheduling (ICAPS) (2013)
Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT Modulo Theories: From an abstract Davis–Putnam–Logemann–Loveland procedure to DPLL(T). J. ACM 53(6), 937–977 (2006)
Ono, M., Williams, B.C., Blackmore, L.: Probabilistic Planning for Continuous Dynamic Systems under Bounded Risk. Journal of AI Research (JAIR) 46, 511–577 (2013)
Penna, G.D., Intrigila, B., Magazzeni, D., Mercorio, F.: Upmurphi: a tool for universal planning on pddl+ problems. In: Proc. 19th Int. Conf. on Automated Planning and Scheduling (ICAPS), pp. 19–23 (2009)
Vidal, V., Geffner, H.: Branching and pruning: An optimal temporal pocl planner based on constraint programming. Artif. Intell. 170(3), 298–335 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Fox, M. (2014). A Modular Architecture for Hybrid Planning with Theories. In: O’Sullivan, B. (eds) Principles and Practice of Constraint Programming. CP 2014. Lecture Notes in Computer Science, vol 8656. Springer, Cham. https://doi.org/10.1007/978-3-319-10428-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-10428-7_1
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-10427-0
Online ISBN: 978-3-319-10428-7
eBook Packages: Computer ScienceComputer Science (R0)