Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Daniel Gnad"'
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:
Scopus-Elsevier
Fork decoupling is a recent approach to exploiting problem structure in state space search. The problem is assumed to take the form of a fork, where a single (large) center component provides preconditions for several (small) leaf components. The lea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::070d2d5828bed854e5c60b655022520d
https://doi.org/10.1609/socs.v6i1.18348
https://doi.org/10.1609/socs.v6i1.18348
Analyzing reachability in large discrete transition systems is an important sub-problem in several areas of AI, and of CS in general. State space search is a basic method for conducting such an analysis. A wealth of techniques have been proposed to r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4bc3754208dda1b60015506a2b6faf7b
Autor:
Daniel Gnad, Hoffmann, J.
Publikováno v:
Scopus-Elsevier
Petri net unfolding expands concurrent sub-threads of a transition system separately. In AI Planning, star-topology decoupling (STD) finds a partitioning of state variables into components whose dependencies take a star shape, and expands leafcompone
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fe427a85ab746e52b03236c03908eeb0
https://doi.org/10.1609/icaps.v29i1.3473
https://doi.org/10.1609/icaps.v29i1.3473
Autor:
Daniel Gnad
Publikováno v:
Proceedings of the AAAI Conference on Artificial Intelligence. 35:11809-11817
In classical planning as search, duplicate state pruning is a standard method to avoid unnecessarily handling the same state multiple times. In decoupled search, similar to symbolic search approaches, search nodes, called decoupled states, do not cor
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8774c6633ccda1d6dfaa896c55222856
https://doi.org/10.1609/aaai.v35i13.17403
https://doi.org/10.1609/aaai.v35i13.17403
Publikováno v:
Sievers, S, Gnad, D & Torralba, A 2022, Additive Pattern Databases for Decoupled Search . in Proceedings of the Fifteenth International Symposium on Combinatorial Search . 1 edn, vol. 15, The AAAI Press, pp. 180-189, Fifteenth International Symposium on Combinatorial Search, Wien, Austria, 21/07/2022 . https://doi.org/10.1609/socs.v15i1.21766
ion heuristics are the state of the art in optimal classical planning as heuristic search. Despite their success for explicit-state search, though, abstraction heuristics are not available for decoupled state-space search, an orthogonal reduction tec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::404e61f4e8905b09d88bc8014251ec41
Publikováno v:
IJCAI
Classical planning tasks are commonly described in PDDL, while most planning systems operate on a grounded finite-domain representation (FDR). The translation of PDDL into FDR is complex and has a lot of choice points---it involves identifying so cal
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fca7fa147c4d4b1fcfa71187328e2dee
https://doi.org/10.24963/ijcai.2021/558
https://doi.org/10.24963/ijcai.2021/558
Publikováno v:
Computer Aided Verification ISBN: 9783030816872
CAV (2)
CAV (2)
Decoupled search is a state space search method originally introduced in AI Planning. Similar to partial-order reduction methods, decoupled search exploits the independence of components to tackle the state explosion problem. Similar to symbolic repr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::26ba1789404f8c99d4ea9281eecebf5d
https://doi.org/10.1007/978-3-030-81688-9_19
https://doi.org/10.1007/978-3-030-81688-9_19
Autor:
Daniel Gnad, Jörg Hoffmann
State space search is a basic method for analyzing reachability in discrete transition systems. To tackle large compactly described transition systems – the state space explosion – a wealth of techniques (e.g., partial-order reduction) have been
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f24dc1ca1f5cc65cfbdaf094b791a69
Publikováno v:
IJCAI
Red-black relaxation in classical planning allows to interpolate between delete-relaxed and real planning. Yet the traditional use of relaxations to generate heuristics restricts relaxation usage to tractable fragments. How to actually tap into the r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9869ce61bb3eb9bf9f7f10494853b43
https://doi.org/10.24963/ijcai.2018/660
https://doi.org/10.24963/ijcai.2018/660