Abstract
In this paper we present a novel planning approach, based on well-known techniques such as goal decomposition and heuristic planning, aimed at working in highly dynamic environments with time constraints. Our contribution is a domain-independent planner to incrementally generate plans under a deliberative framework for reactive domains. The planner follows the anytime principles, i.e a first solution plan can be quickly computed and the quality of the solution is improved as time is available. Moreover, the fast computation of the sequential actions allows the plan to start its execution before it is totally generated, thus giving rise to a highly reactive planning system.
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
Ambite, J.L., Knoblock, C.A.: Planning by rewriting. JAIR 15, 207–261 (2001)
Blum, A., Furst, M.: Fast planning through planning graph analysis. Artificial Intelligence 90, 281–300 (1997)
Briggs, W., Cook, D.J.: Anytime planning for optimal tradeoff between deliberative and reactive planning. In: FLAIRS Conference, pp. 367–370 (1999)
Bryce, D., Kambhampati, S.: Heuristic guidance measures for conformant planning. In: Proceedings of ICAPS, pp. 365–375 (2004)
Chen, Y., Hsu, C.W., Wah, B.W.: SGPlan: Subgoal partitioning and resolution in planning. In: IPC-4 Booklet (ICAPS) (2004)
Dean, T., Kaelbling, L.P., Kirman, J., Nicholson, A.: Planning under time constraints in stochastic domains. Artificial Intelligence 76(1-2), 35–74 (1995)
Gerevini, A., Saetti, A., Serina, I.: Planning through stochastic local search and temporal action graphs in LPG. JAIR 20, 239–290 (2003)
Hawes, N.: Anytime planning for agent behaviour. PLANSIG, 157–166 (2001)
Hoffman, J., Nebel, B.: The FF planning system: Fast planning generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
Knight, R., Rabideau, G., Chien, S.A., Engelhardt, B., Sherwood, R.: Casper: Space exploration through continuous planning. IEEE Intelligent Systems 16(5), 70–75 (2001)
Koenig, S., Furcy, D., Bauer, C.: Heuristic search-based replanning. In: International Conference on Artificial Intelligence Planning and Scheduling (AIPS), pp. 310–317 (2002)
Koenig, S., Tovey, C.A., Smirnov, Y.V.: Performance bounds for planning in unknown terrain. Artificial Intelligence 147(1-2), 253–279 (2003)
Majercik, S.M., Littman, M.L.: Contingent planning under uncertainty via stochastic satisfiability. Artificial Intelligence 147(1-2), 119–162 (2003)
Pryor, L., Collins, G.: Planning for contingencies: A decision-based approach. Journal of Artificial Intelligence Research 4, 287–339 (1996)
Sapena, O., Onaindía, E.: Handling numeric criteria in relaxed planning graphs. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 114–123. Springer, Heidelberg (2004)
Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Magazine 17(3), 73–83 (1996)
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
Sapena, O., Onaindía, E. (2006). An On-Line Approach for Planning in Time-Limited Situations. In: Ali, M., Dapoigny, R. (eds) Advances in Applied Artificial Intelligence. IEA/AIE 2006. Lecture Notes in Computer Science(), vol 4031. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11779568_42
Download citation
DOI: https://doi.org/10.1007/11779568_42
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35453-6
Online ISBN: 978-3-540-35454-3
eBook Packages: Computer ScienceComputer Science (R0)