Abstract
In real world planning problems, it might not be possible for an automated agent to satisfy all the objectives assigned to it. When this situation arises, classical planning returns no plan. In partial satisfaction planning, it is possible to satisfy only a subset of the objectives. To solve this kind of problems, an agent can select a subset of objectives and return the plan that maximizes the net benefit, i.e. the sum of satisfied objectives utilities minus the sum of the cost of actions. This approach has been experimented for deterministic planning. This paper extends partial satisfaction planning for problems with uncertainty on time. For problems under uncertainty, the best subset of objectives can not be calculated at planning time. The effective duration of actions at execution time may dynamically influence the achievable subset of objectives. Our approach introduces special abort actions to explicitly abort objectives. These actions can have deadlines in order to control when objectives can be aborted.
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.
References
Amir, E., Engelhardt, B.: Factored planning. In: Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, pp. 929–935. Morgan Kaufmann (2003)
Beaudry, E., Kabanza, F., Michaud, F.: Using a classical forward search to solve temporal planning problems under uncertainty. In: Proceedings of the Association for the Advancement of Artificial Intelligence Workshops, pp. 2–8. AAAI Press (2012)
Beaudry, E., Kabanza, F., Michaud, F.: Planning for concurrent action executions under action duration uncertainty using dynamically generated bayesian networks. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 10–17. AAAI Press (2010)
Benton, J., Do, M., Kambhampati, S.: Anytime heuristic search for partial satisfaction planning. Journal of Artificial Intelligence 173(5-6), 562–592 (2009)
Bresina, J., Dearden, R., Meuleau, N., Smith, D., Washington, R.: Planning under continuous time and resource uncertainty: A challenge for AI. In: Proceedings of the Conference on Uncertainty in AI, pp. 77–84 (2002)
Coles, A.J.: Opportunistic branched plans to maximise utility in the presence of resource uncertainty. In: Proceedings of the Twentieth European Conference on Artificial Intelligence, pp. 252–257. IOS Press (2012)
Gerevini, A.E., Haslum, P., Long, D., Saetti, A., Dimopoulos, Y.: Deterministic planning in the fifth international planning competition: Pddl3 and experimental evaluation of the planners. Artificial Intelligence 173(5-6), 619–668 (2009)
Haslum, P., Geffner, H.: Admissible heuristics for optimal planning. In: Proceedings of the Artificial Intelligence Planning Systems, pp. 140–149. AAAI Press (2000)
Keyder, E., Geffner, H.: Soft goals can be compiled away. Journal of Artificial Intelligence Research 36, 547–556 (2009)
Meuleau, N., Brafman, R.I., Benazera, E.: Stochastic over-subscription planning using hierarchies of MDPs. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 121–130. AAAI Press (2006)
Nigenda, R.S., Kambhampati, S.: Planning graph heuristics for selecting objectives in over-subscription planning problems. In: Proceedings of the Conference of the International Conference on Automated Planning and Scheduling, pp. 192–201. AAAI Press (2005)
Smith, D.E.: Choosing objectives in over-subscription planning. In: Proceedings of the International Conference on Automated Planning and Scheduling, pp. 393–401. AAAI Press (2004)
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
Labranche, S., Beaudry, É. (2014). Partial Satisfaction Planning under Time Uncertainty with Control on When Objectives Can Be Aborted. In: Sokolova, M., van Beek, P. (eds) Advances in Artificial Intelligence. Canadian AI 2014. Lecture Notes in Computer Science(), vol 8436. Springer, Cham. https://doi.org/10.1007/978-3-319-06483-3_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-06483-3_15
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06482-6
Online ISBN: 978-3-319-06483-3
eBook Packages: Computer ScienceComputer Science (R0)