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. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Sapena, O., & Onaindía, E. (2006). An on-line approach for planning in time-limited situations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4031 LNAI, pp. 383–392). Springer Verlag. https://doi.org/10.1007/11779568_42
Mendeley helps you to discover research relevant for your work.