Zobrazeno 1 - 10
of 19
pro vyhledávání: '"Torralba, Alvaro"'
A popular approach for sequential decision-making is to perform simulator-based search guided with Machine Learning (ML) methods like policy learning. On the other hand, model-relaxation heuristics can guide the search effectively if a full declarati
Externí odkaz:
http://arxiv.org/abs/2207.04479
Publikováno v:
In Artificial Intelligence September 2024 334
Autor:
Köhn, Arne, Wichlacz, Julia, Torralba, Álvaro, Höller, Daniel, Hoffmann, Jörg, Koller, Alexander
When generating technical instructions, it is often convenient to describe complex objects in the world at different levels of abstraction. A novice user might need an object explained piece by piece, while for an expert, talking about the complex ob
Externí odkaz:
http://arxiv.org/abs/2010.03982
Publikováno v:
EPTCS 99, 2012, pp. 66-82
For the exploration of large state spaces, symbolic search using binary decision diagrams (BDDs) can save huge amounts of memory and computation time. State sets are represented and modified by accessing and manipulating their characteristic function
Externí odkaz:
http://arxiv.org/abs/1210.6415
Publikováno v:
In Artificial Intelligence June 2018 259:1-31
Publikováno v:
In Artificial Intelligence January 2017 242:52-79
Publikováno v:
Horčík, R, Torralba, A, Rytíř, P, Chrpa, L & Edelkamp, S 2022, Optimal Mixed Strategies for Cost-Adversarial Planning Games . in A Kumar, S Thiebaux, P Varakantham & W Yeoh (eds), Proceedings of the 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 . vol. 32, AAAI Press, pp. 160-168, The 32nd International Conference on Automated Planning and Scheduling, Singapore, Singapore, 13/06/2022 . https://doi.org/10.1609/icaps.v32i1.19797
This paper shows that domain-independent tools from classical planning can be used to model and solve a broad class of game-theoretic problems we call Cost-Adversarial Planning Games (CAPGs). We define CAPGs as 2-player normal-form games specified by
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c1f3828c5cf4afd091235627d2f77836
https://vbn.aau.dk/da/publications/8ec94b0e-7d7e-4cd4-9f9b-7bc8f6460e92
https://vbn.aau.dk/da/publications/8ec94b0e-7d7e-4cd4-9f9b-7bc8f6460e92
Publikováno v:
Gnad, D, Torralba, A & Fišer, D 2022, Beyond Stars-Generalized Topologies for Decoupled Search . in A Kumar, S Thiebaux, P Varakantham & W Yeoh (eds), Proceedings of the 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 . vol. 32, AAAI Press, pp. 110-118, The 32nd International Conference on Automated Planning and Scheduling, Singapore, Singapore, 13/06/2022 . https://doi.org/10.1609/icaps.v32i1.19791
Decoupled search decomposes a classical planning task bypartitioning its variables such that the dependencies betweenthe resulting factors form a star topology. In this topology,a single center factor can interact arbitrarily with a set ofleaf factor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::08261a7d920a1afaea7012db63ee7643
https://vbn.aau.dk/da/publications/876c6d76-05fa-49d0-acab-c088ed889327
https://vbn.aau.dk/da/publications/876c6d76-05fa-49d0-acab-c088ed889327
Publikováno v:
Klößner, T, Steinmetz, M, Torralba, A & Hoffmann, J 2022, Pattern Selection Strategies for Pattern Databases in Probabilistic Planning . in A Kumar, S Thiebaux, P Varakantham & W Yeoh (eds), Proceedings of the 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 . vol. 32, AAAI Press, pp. 184-192, The 32nd International Conference on Automated Planning and Scheduling, Singapore, Singapore, 13/06/2022 . https://doi.org/10.1609/icaps.v32i1.19801
Recently, pattern databases have been extended to probabilistic planning, to derive heuristics for the objectives of goal probability maximization and expected cost minimization. While this approach yields both theoretical and practical advantages ov
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::b05843fa98ab06fbe99d8dbf0b78bcc3
https://vbn.aau.dk/da/publications/2ce28eb1-b390-4527-9a2f-418ca6255340
https://vbn.aau.dk/da/publications/2ce28eb1-b390-4527-9a2f-418ca6255340
Publikováno v:
Fišer, D, Torralba, A & Jörg, H 2022, Operator-Potentials in Symbolic Search: From Forward to Bi-Directional Search . in A Kumar, S Thiebaux, P Varakantham & W Yeoh (eds), Proceedings of the 32nd International Conference on Automated Planning and Scheduling, ICAPS 2022 . AAAI Press, Proceedings International Conference on Automated Planning and Scheduling, ICAPS, vol. 32, pp. 80-89, The 32nd International Conference on Automated Planning and Scheduling, Singapore, Singapore, 13/06/2022 . https://doi.org/10.1609/icaps.v32i1.19788
Symbolic search using binary decision diagrams is a state-of-the-art technique for cost-optimal planning. Heuristic search in this context has been problematic as even a very informative heuristic can be detrimental in case it induces difficult-to-re
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::2c0d3a1a737c29ef3fcb253003a74554
https://vbn.aau.dk/da/publications/63b570ea-227e-474a-92c6-916fe7a2c6e0
https://vbn.aau.dk/da/publications/63b570ea-227e-474a-92c6-916fe7a2c6e0