Abstract
In this paper we present LP-TPOP, a domain-independent temporal partial-order planning algorithm that handles CBI-style action model. By the utilization of ground actions variable binding constraints can be eliminated from partial plans, then all the constraints needed to be handled are temporal constraints, which are maintained in a revised simple temporal constraint network (r-STN) structure. The exact scheduling of plan returned by planning phase is calculated by a linear programming module. By exploiting incremental algorithms the efficiency of LP-TPOP can be further improved. LP-TPOP is proved to be sound and complete.
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
Cesta, A., Pecora, F., Rasconi, R.: Biasing the Structure of Scheduling Problems Through Classical Planners. In: Proceedings of WIPIS-2004, ICAPS Workshop on Integrating Planning into Scheduling, Whistler, British Columbia, Canada, pp. 3–7 (2004)
Fox, M., Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. Journal of artificial intelligence research 20, 61–124 (2003)
Halsey, K., Long, D., Fox, M.: Isolating where Planning and Scheduling Interact. In: Proceedings from the 22nd UK Planning and Scheduling Special Interest Group (PlanSIG 2003), pp. 104–114 (2003)
Do, M., Kambhampati, S.: SAPA: A Multi-objective Metric Temporal Planner. Journal of Artificial Intelligence Research 20, 155–194 (2003)
Smith, D., Frank, J., Jónsson, A.: Bridging the Gap Between Planning and Scheduling. In: Knowledge Engineering Review, vol. 15(1), p. 15–1 (2000)
Penberthy, J.S., Weld, D.S.: Temporal planning with continuous change. In: Proceedings of AAAI 1994, pp. 1010–1015 (1994)
Weld, D.S.: An introduction to least commitment planning. AI Magazine 15(4), 27–61 (1994)
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
Liu, Y., Jiang, Y. (2006). LP-TPOP: Integrating Planning and Scheduling Through Constraint Programming. In: Yang, Q., Webb, G. (eds) PRICAI 2006: Trends in Artificial Intelligence. PRICAI 2006. Lecture Notes in Computer Science(), vol 4099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-36668-3_92
Download citation
DOI: https://doi.org/10.1007/978-3-540-36668-3_92
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-36667-6
Online ISBN: 978-3-540-36668-3
eBook Packages: Computer ScienceComputer Science (R0)