Zobrazeno 1 - 10
of 328
pro vyhledávání: '"Höller, D."'
The research in hierarchical planning has made considerable progress in the last few years. Many recent systems do not rely on hand-tailored advice anymore to find solutions, but are supposed to be domain-independent systems that come with sophistica
Externí odkaz:
http://arxiv.org/abs/1911.05499
Publikováno v:
Workshop on the International Planning Competition (ICAPS), 2019
Over the last year, the amount of research in hierarchical planning has increased, leading to significant improvements in the performance of planners. However, the research is diverging and planners are somewhat hard to compare against each other. Th
Externí odkaz:
http://arxiv.org/abs/1909.04405
Publikováno v:
In Clinical Microbiology and Infection February 2020 26(2):168-173
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Alcaide, F., Amlerová, J., Bou, G., Ceyssens, P.J., Coll, P., Corcoran, D., Fangous, M.-S., González-Álvarez, I., Gorton, R., Greub, G., Hery-Arnaud, G., Hrábak, J., Ingebretsen, A., Lucey, B., Marekoviċ, I., Mediavilla-Gradolph, C., Monté, M.R., O'Connor, J., O'Mahony, J., Opota, O., O'Reilly, B., Orth-Höller, D., Oviaño, M., Palacios, J.J., Palop, B., Pranada, A.B., Quiroga, L., Rodríguez-Temporal, D., Ruiz-Serrano, M.J., Tudó, G., Van den Bossche, A., van Ingen, J., Rodriguez-Sanchez, B.
Publikováno v:
In Clinical Microbiology and Infection June 2018 24(6):599-603
Publikováno v:
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling: June 13-24, 2022, virtual conference, 134-144
STARTPAGE=134;ENDPAGE=144;TITLE=Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling
STARTPAGE=134;ENDPAGE=144;TITLE=Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling
Planning models are usually defined in lifted, i.e. first order formalisms, while most solvers need (variable-free) grounded representations. Though techniques for grounding prune unnecessary parts of the model, grounding might – nevertheless – b
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Decristoforo, P. †, Kaltseis, J. †, Fritz, A., Edlinger, M., Posch, W., Wilflingseder, D., Lass-Flörl, C., Orth-Höller, D.
Publikováno v:
In Clinical Microbiology and Infection October 2018 24(10):1101-1101
Autor:
Behnke, G., Pollitt, F., Höller, D., Bercher, P., Alford, R., Sycara, K., Honavar, V., Spaan, M.
Publikováno v:
Proceedings of the 36th AAAI Conference on Artificial Intelligence: AAAI-22 : virtual conference, Vancouver, Canada, February 22-March 1, 2022, 9, 9687-9697
Translation-based approaches to planning allow for solving problems in complex and expressive formalisms via the means of highly efficient solvers for simpler formalisms. To be effective, these translations have to be constructed appropriately. The c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::382af7f75e50238f3b7cdd783de959a9
https://dare.uva.nl/personal/pure/en/publications/making-translations-to-classical-planning-competitive-with-other-htn-planners(336893be-037d-42dc-9692-2c393ff83416).html
https://dare.uva.nl/personal/pure/en/publications/making-translations-to-classical-planning-competitive-with-other-htn-planners(336893be-037d-42dc-9692-2c393ff83416).html
Autor:
Höller, D., Wichlacz, J., Bercher, P., Behnke, G., Kumar, A., Thiébaux, S., Varakantham, P., Yeoh, W.
Publikováno v:
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling: June 13-24, 2022, virtual conference, 145-150
STARTPAGE=145;ENDPAGE=150;TITLE=Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling
STARTPAGE=145;ENDPAGE=150;TITLE=Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling
Plan Verification is the task of deciding whether a sequence of actions is a solution for a given planning problem. In HTN planning, the task is computationally expensive and may be up to NP-hard. However, there are situations where it needs to be so
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a79104736bb3221275a5eba08a7b01d8
https://dare.uva.nl/personal/pure/en/publications/compiling-htn-plan-verification-problems-into-htn-planning-problems(b309ea15-e089-4e83-b543-e5ba233773f8).html
https://dare.uva.nl/personal/pure/en/publications/compiling-htn-plan-verification-problems-into-htn-planning-problems(b309ea15-e089-4e83-b543-e5ba233773f8).html