Zobrazeno 1 - 10
of 61
pro vyhledávání: '"Malte Helmert"'
Autor:
Nathan Sturtevant, Malte Helmert
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 11:75-81
Budgeted Tree Search (BTS), a variant of Iterative Budgeted Exponential Search, is a new algorithm that has the same performance as IDA* on problems where the state space grows exponentially, but has far better performance than IDA* in other cases wh
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba04b8730fe209168746e20b340020ed
https://doi.org/10.1609/socs.v11i1.18537
https://doi.org/10.1609/socs.v11i1.18537
Autor:
Gabriele Röger, Malte Helmert
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 20:246-249
We empirically examine several ways of exploiting the information of multiple heuristics in a satisficing best-first search algorithm, comparing their performance in terms of coverage, plan quality, speed, and search guidance. Our results indicate th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ad1500b32ebcf335e86dcc062a720492
https://doi.org/10.1609/icaps.v20i1.13435
https://doi.org/10.1609/icaps.v20i1.13435
Autor:
Malte Helmert, Hauke Lasinger
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 20:234-237
We introduce the Scanalyzer planning domain, a domain for classical planning which models the problem of automatic greenhouse logistic management. At its mathematical core, the Scanalyzer domain is a permutation problem with striking similarities to
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e14760975669e107b2edda1d3be8e1d
https://doi.org/10.1609/icaps.v20i1.13431
https://doi.org/10.1609/icaps.v20i1.13431
While the unsolvability IPC sparked a multitude of planners proficient in detecting unsolvable planning tasks, there are gaps where concise unsolvability arguments are known but no existing planner can capture them without prohibitive computational e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6b241c3d06775ebf67f753aac7617d1e
https://edoc.unibas.ch/93362/
https://edoc.unibas.ch/93362/
Publikováno v:
Datacite
edoc
Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021)
edoc
Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021)
Landmarks of a planning task denote properties that must be satisfied by all plans. Existing landmark heuristics exploit that each landmark must be achieved at least once. However, if the orderings between the landmarks induce cyclic dependencies, on
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f63ea2b4acdfb87b9fe51604ccd8b5bc
https://edoc.unibas.ch/84308/
https://edoc.unibas.ch/84308/
Recent research in classical planning has shown the importance of search techniques that operate directly on the lifted representation of the problem, particularly in domains where the ground representation is prohibitively large. In this paper, we s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d6098910098f4c2f953a04cb3db01208
Autor:
Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert
Publikováno v:
Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021)
Sygma
edoc
Datacite
Sygma
edoc
Datacite
Optimal cost partitioning can produce high quality heuristic estimates even from small abstractions. It can be computed with a linear program (LP) but the size of this LP often makes this impractical. Recent work used Lagrangian decomposition to spee
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f7fa2560b30f0cfd4bd96e7374ca0efb
https://doi.org/10.5451/unibas-ep84307
https://doi.org/10.5451/unibas-ep84307
Autor:
Silvan Sievers, Malte Helmert
Publikováno v:
Journal of Artificial Intelligence Research
The merge-and-shrink framework has been introduced as a general approach for defining abstractions of large state spaces arising in domain-independent planning and related areas. The distinguishing characteristic of the merge-and-shrink approach is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::da7f6c82cc12155464635fd784bce03a
Autor:
Malte Helmert, Gabriele Röger
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:viii-ix
List of organizers of the Sixth International Symposium on Combinatorial Search.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6c81e6af5b5d1c71ccd1648d1f28784
https://doi.org/10.1609/socs.v4i1.18277
https://doi.org/10.1609/socs.v4i1.18277
Autor:
Malte Helmert, Gabriele Röger
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 4:xi-xii
This volume contains the papers accepted for presentation at SoCS 2013, the Sixth Annual Symposium on Combinatorial Search, held in Leavenworth, WA, USA on July 11–13, 2013. SoCS 2013 was held in cooperation with AAAI and collocated with the Twenty
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9ceca5b8b450c3528af3d1a492dba4e4
https://doi.org/10.1609/socs.v4i1.18275
https://doi.org/10.1609/socs.v4i1.18275