Zobrazeno 1 - 10
of 78
pro vyhledávání: '"Álvaro Torralba"'
Autor:
GORDILLO, MARTA
Publikováno v:
Hola; 2/6/2019, Vol. 3 Issue 888, p38-44, 7p, 7 Color Photographs
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 36:9767-9775
Classical planning tasks are modelled in PDDL which is a schematic language based on first-order logic. Most of the current planners turn this lifted representation into a propositional one via a grounding process. However, grounding may cause an exp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1337d19174b720aea50c2c588b6c2e77
https://doi.org/10.1609/aaai.v36i9.21212
https://doi.org/10.1609/aaai.v36i9.21212
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:160-168
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=doi_________::90a4ecae7b5a9af30226b3e1578a92c0
https://doi.org/10.1609/icaps.v32i1.19797
https://doi.org/10.1609/icaps.v32i1.19797
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:184-192
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=doi_________::786c94f92b950e11e94f3b7c2e9e6dc0
https://doi.org/10.1609/icaps.v32i1.19801
https://doi.org/10.1609/icaps.v32i1.19801
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:110-118
Decoupled search decomposes a classical planning task by partitioning its variables such that the dependencies between the resulting factors form a star topology. In this topology, a single center factor can interact arbitrarily with a set of leaf fa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c4c1b027b1e3d035436e2c9f173d37c6
https://doi.org/10.1609/icaps.v32i1.19791
https://doi.org/10.1609/icaps.v32i1.19791
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:80-89
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=doi_________::ecc744a7851d37b58dcfced6f03b52cf
https://doi.org/10.1609/icaps.v32i1.19788
https://doi.org/10.1609/icaps.v32i1.19788
Autor:
Álvaro Torralba, Kissmann, P.
Publikováno v:
Aalborg University
Scopus-Elsevier
Scopus-Elsevier
Merge-and-shrink (M&S) is a framework to generate abstraction heuristics for cost-optimal planning. A recent approach computes simulation relations on a set of M&S abstractions in order to identify states that are better than others. This relation is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::37a07da8235bba15a26fbebe708d7d83
https://doi.org/10.1609/socs.v6i1.18353
https://doi.org/10.1609/socs.v6i1.18353
Publikováno v:
Aalborg University
Search methods are useful in hierarchical task network (HTN) planning to make performance less dependent on the domain knowledge provided, and to minimize plan costs. Here we investigate Monte-Carlo tree search (MCTS) as a new algorithmic alternative
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::718f3cf7bdef55f77440f1297bc1e240
https://doi.org/10.1609/socs.v11i1.18538
https://doi.org/10.1609/socs.v11i1.18538
Autor:
Álvaro Torralba, Alcázar, V.
Publikováno v:
Aalborg University
Scopus-Elsevier
Scopus-Elsevier
Symbolic search allows saving large amounts of memory compared to regular explicit-state search algorithms. This is crucial in optimal settings, in which common search algorithms often exhaust the available memory. So far, the most successful uses of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b5c8e42fec2b03b65c1a24de33243bc7
https://doi.org/10.1609/socs.v4i1.18285
https://doi.org/10.1609/socs.v4i1.18285
Autor:
Álvaro Torralba, Carlos Linares López
Publikováno v:
Aalborg University
The Pancake problem has become a classical combinatorial problem. Different attempts have been made to optimally solve it and/or to derive tighter bounds on the diameter of its state space for a different number of discs. Until very recently, the mos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::170ac359c79ea22ee04c6b22e90a8b39
https://doi.org/10.1609/socs.v2i1.18193
https://doi.org/10.1609/socs.v2i1.18193