Abstract
Planning systems for real-world applications need the ability to handle concurrency and numeric fluents. Nevertheless, the predominant approach to cope with concurrency followed by the most successful participants in the latest International Planning Competitions (IPC) is still to find a sequential plan that is rescheduled in a post-processing step.We present Temporal Fast Downward (TFD), a planning system for temporal problems that is capable of finding low-makespan plans by performing a heuristic search in a temporal search space.We show how the context-enhanced additive heuristic can be successfully used for temporal planning and how it can be extended to numeric fluents. TFD often produces plans of high quality and, evaluated according to the rating scheme of the last IPC, outperforms all state-of-the-art temporal planning systems.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bäckström, C., Nebel, B.: Complexity results for SAS + planning. Computational Intelligence 11(4), 625–655 (1995)
Coles, A., Fox, M., Halsey, K., Long, D., Smith, A.: Managing concurrency in temporal planning using planner-scheduler interaction. AIJ 173(1), 1–44 (2009)
Cushing, W., Kambhampati, S., Mausam, Weld, D.S.: When is temporal planning really temporal? In: Proc. IJCAI 2007, pp. 1852–1859 (2007)
Do, M.B., Kambhampati, S.: Sapa: A multi-objective metric temporal planner. JAIR 20, 155–194 (2003)
Edelkamp, S.: Taming numbers and duration in the model checking integrated planning system. JAIR 20, 195–238 (2003)
Fox, M., Long, D.: PDDL 2.1: An extension to PDDL for expressing temporal planning domains. JAIR 20, 61–124 (2003)
Gerevini, A., Saetti, A., Serina, I.: An approach to efficient planning with numerical fluents and multi-criteria plan quality. AIJ 172(8-9), 899–944 (2008)
Helmert, M.: The Fast Downward planning system. JAIR 26, 191–246 (2006)
Helmert, M.: Concise finite-domain representations for PDDL planning tasks. AIJ 173, 503–535 (2009)
Helmert, M., Geffner, H.: Unifying the causal graph and additive heuristics. In: Proc. of ICAPS 2008, pp. 140–147 (2008)
Hoffmann, J.: The Metric-FF planning system: Translating ignoring delete lists to numeric state variables. JAIR 20, 291–341 (2003)
Hsu, C.-W., Wah, B.W.: The SGPlan planning system in IPC-6 (2008), http://manip.crhc.uiuc.edu/Wah/papers/C168/C168.pdf
Smith, D.E., Weld, D.S.: Temporal planning with mutual exclusion reasoning. In: Proc. IJCAI 1999, pp. 326–337 (1999)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag GmbH Berlin Heidelberg
About this chapter
Cite this chapter
Eyerich, P., Mattmüller, R., Röger, G. (2012). Using the Context-Enhanced Additive Heuristic for Temporal and Numeric Planning. In: Prassler, E., et al. Towards Service Robots for Everyday Environments. Springer Tracts in Advanced Robotics, vol 76. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25116-0_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-25116-0_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25115-3
Online ISBN: 978-3-642-25116-0
eBook Packages: EngineeringEngineering (R0)