Abstract
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficient strategy for solving TP, which combines, in an innovative way, several well established and studied techniques in AI, OR and constraint programming. Our approach integrates graph planning (a well studied planning paradigm), max-SAT (a constraint optimization technique), and the Program Evaluation and Review Technique (PERT), a well established technique in OR. Our method first separates the logical and temporal constraints of a TP problem and solves it in two phases. In the first phase, we apply our new STRIPS planner to generate a parallel STRIPS plan with a minimum number of parallel steps. Our new STRIPS planner is based on a new max-SAT formulation, which leads to an effective incremental learning scheme and a goal-oriented variable selection heuristic. The new STRIPS planner can generate optimal parallel plans more efficiently than the well-known SATPLAN approach. In the second phase, we apply PERT to schedule the activities in a parallel plan to create a shortest temporal plan given the STRIPS plan. When applied to the first optimal parallel STRIPS plan, this simple strategy produces optimal temporal plans on most benchmarks we have tested. This strategy can also be applied to optimal STRIPS plans of different parallel steps in an anytime fashion to find an optimal temporal plan. Our experimental results show that the new strategy is effective and the resulting algorithm outperforms many existing temporal planners.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Benedetti, M., Bernardini, S.: Incremental compilation-to-SAT procedures. In: H. Hoos, H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 46–58. Springer, Heidelberg (2005)
Blum, A., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence 90, 281–300 (1997)
Bonet, B., Geffner, H.: Planning as heuristic search. Artificial Intelligence, Special issue on Heuristic Search 129(1) (2001)
http://www.cs.washington.edu/homes/kautz/satplan/blackbox/blackbox-download.html
Edelkamp, S.: Mixed propositional and numerical planning in the model checking integrated planning system. In: Proceedings of AIPS 2002, Workshop on Planning for Temporal Domains, pp. 47–55 (2002)
Fikes, R.E., Nilsson, N.J.: STRIPS: A new approach to the application of theorem proving to problem solving. Artificial Intelligence 2, 189–208 (1971)
Awedh, M., Jin, H., Somenzi, F.: CirCus: a satisfiability solver geared towards bounded model checking. In: Alur, R., Peled, D.A. (eds.) CAV 2004. LNCS, vol. 3114, pp. 519–522. Springer, Heidelberg (2004)
Haslum, P.: TP4’04 and HSP. In: Proceedings of IPC4, ICAPS, pp. 38–40 (2004)
Hillier, F., Lieberman, G.: Introduction to Operations Research, 7th edn. McGraw-Hill, Boston (2001)
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
Hooker, J.N., Vinay, V.: Branching rules for satisfiability. Journal of Automated Reasoning 15, 359–383 (1995)
Katukam, S., Kambhampati, S.: Learning explanation-based search control rules for partial order planning. In: Proceedings of AAAI 1994, pp. 582–587 (1994)
Kautz, H.: SATPLAN04: Planning as satisfiability. In: Proceedings of IPC4, ICAPS (2004)
Kautz, H., Selman, B.: Unifying SAT-based and graph-based planning. In: Proceedings of IJCAI 1999, pp. 318–325 (1999)
Koehler, J., Hoffmann, J.: On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm. Journal of Artificial Intelligence Research 12, 338–386 (2000)
McDermott, D.: Estimated-regression planning for interactions with web services. In: Proceedings of AIPS 2002, pp. 204–211 (2002)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: Engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001) (2001)
Nigenda, R.S., Nguyen, X., Kambhampati, S.: AltAlt: Combining the advantages of Graphplan and heuristic state search. Technical report, Arizona State University (2000)
Pollock, J.L.: The logical foundations of goal-regression planning in autonomous agents. Artificial Intelligence 106(2), 267–334 (1998)
Refanidis, I., Vlahavas, I.: The GRT planner. AI Magazine, 63–66 (2001)
Ryan, L.: Efficient algorithms for clause-learning SAT solvers. Master’s thesis, Simon Fraser University (2003)
Selman, B., Kautz, H.: Planning as satisfiability. In: Proceedings ECAI 1992, pp. 359–363 (1992)
Shtrichman, O.: Tuning SAT checkers for bounded model checking. In: Computer Aided Verification, pp. 480–494 (2000)
Vidal, V., Geffner, H.: CPT: An optimal temporal POCL planner based on constraint programming. In: Proceedings of IPC4, ICAPS, pp. 59–60 (2004)
Wolfman, S., Weld, D.: Combining linear programming and satisfiability solving for resource planning. The Knowledge Engineering Review 15(1) (2000)
Hsu, C., Chen, Y., Wah, B.W.: SGPlan: Subgoal partitioning and resolution in planning. In: Proceedings of IPC4, ICAPS, pp. 30–32 (2004)
Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD, pp. 279–285 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Xing, Z., Chen, Y., Zhang, W. (2006). An Efficient Hybrid Strategy for Temporal Planning. In: Beck, J.C., Smith, B.M. (eds) Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. CPAIOR 2006. Lecture Notes in Computer Science, vol 3990. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11757375_22
Download citation
DOI: https://doi.org/10.1007/11757375_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34306-6
Online ISBN: 978-3-540-34307-3
eBook Packages: Computer ScienceComputer Science (R0)