Abstract
In the last few years, the field of planning in AI has experimented a great advance. Nowadays, one can use planners that solve complex problems in a few seconds. However, building good quality plans has not been a main issue. In this paper, we introduce a planning system whose aim is obtaining the optimal solution w.r.t. the number of actions and maintaining as maximum number of parallel actions as possible. © Springer-Verlag Berlin Heidelberg 2001.
Cite
CITATION STYLE
Sebastia, L., Onaindia, E., & Marzal, E. (2001). STeLLa: An optimal sequential and parallel planner. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2258 LNAI, pp. 409–416). Springer Verlag. https://doi.org/10.1007/3-540-45329-6_40
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
