Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Simon Ståhlberg"'
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:29-37
There has been a tremendous advance in domain-independent planning over the past decades, and planners have become increasingly efficient at finding plans. However, this has not been paired by any corresponding improvement in detecting unsolvable ins
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89eeca0f5dd5ff6cd18d6665b700631f
https://doi.org/10.1609/socs.v4i1.18294
https://doi.org/10.1609/socs.v4i1.18294
It has been recently shown that general policies for many classical planning domains can be expressed and learned in terms of a pool of features defined from the domain predicates using a description logic grammar. At the same time, most description
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::212d155a8ea683a11caee21fc7055373
http://arxiv.org/abs/2109.10129
http://arxiv.org/abs/2109.10129
Publikováno v:
IJCAI
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence
Recent work in classical planning has introduced dedicated techniques for detecting unsolvable states, i.e., states from which no goal state can be reached. We approach the problem from a generalized planning perspective and learn first-order-like fo
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::09d4dc5b5460801a370cc3d70edfa586
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-179326
http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-179326
Autor:
Simon Ståhlberg
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 27:274-282
There has been an astounding improvement in domain-independent planning for solvable instances over the last decades and planners have become increasingly efficient at constructing plans. However, this advancement has not been matched by a similar im
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bd2ed7e27160a438b89111fe836343c8
https://doi.org/10.1609/icaps.v27i1.13808
https://doi.org/10.1609/icaps.v27i1.13808
Autor:
Simon Ståhlberg
Publikováno v:
Linköping Studies in Science and Technology. Dissertations ISBN: 9789176854983
In this thesis we study automated planning, a branch of artificialintelligence, which deals with construction of plans. A plan is typically an action sequence that achieves some specific goal. In p ...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ceabfb948bc8c184c0605fd227a7e1bc
https://doi.org/10.3384/diss.diva-139802
https://doi.org/10.3384/diss.diva-139802
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 29
Causal graphs are widely used to analyze the complexity of planning problems. Many tractable classes have been identified with their aid and state-of-the-art heuristics have been derived by exploiting such classes. In particular, Katz and Keyder have
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94ac39d92dc7bc81a1948e3470094d8b
https://doi.org/10.1609/aaai.v29i1.9650
https://doi.org/10.1609/aaai.v29i1.9650
Publikováno v:
BASE-Bielefeld Academic Search Engine
The use of computational complexity in planning, and in AI in general, has always been a disputed topic. A major problem with ordinary worst-case analyses is that they do not provide any quantitative information: they do not tell us much about the ru
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3146239331d73b35c071d66f24800a20