Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Shleyfman, A."'
Autor:
Senderovich, Arik, Shleyfman, Alexander, Weidlich, Matthias, Gal, Avigdor, Mandelbaum, Avishai
Publikováno v:
In Information Systems November 2018 78:96-111
Autor:
Ryo Kuroiwa, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro, J. Christopher Beck
Publikováno v:
Journal of Artificial Intelligence Research. 75:1477-1548
The LM-cut heuristic, both alone and as part of the operator counting framework, represents one of the most successful heuristics for classical planning. In this paper, we generalize LM-cut and its use in operator counting to optimal numeric planning
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64dd5c58b8817a8b0d43da323cf2c606
https://doi.org/10.1613/jair.1.14034
https://doi.org/10.1613/jair.1.14034
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 32:203-212
While numeric variables play an important, sometimes central, role in many planning problems arising from real world scenarios, most of the currently available heuristic search planners either do not support such variables or impose heavy restriction
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::89bab1d04d368af99b4b9b459a7e68a4
https://doi.org/10.1609/icaps.v32i1.19803
https://doi.org/10.1609/icaps.v32i1.19803
This document contains a detailed proof that the symmetry group of the colored numeric problem description graphis isomorphic to the group of numeric structural symmetries of the same task.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0edfe2f8e00e0df9b199c2b719ab46b5
This is supplementary material for the paper ``Structurally Restricted Fragments of Numeric Planning – a Complexity Analysis'.' It has two parts:the first one contains the full proofs of Lemma 1 and Corollary 1of section ``Integer Restricted Tasks'
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c468b7ea41ecb1069f039419183c6c2
Publikováno v:
Proceedings of the International Symposium on Combinatorial Search. 12:88-96
In a multi-agent environment, each agent must take into account not only the actions it must perform to achieve its goals, but also the behavior of other agents in the system, which usually requires some sort of coordination between the agents. One w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0ef1e9209eb7c9b26bc3e759d6ba265b
https://doi.org/10.1609/socs.v12i1.18555
https://doi.org/10.1609/socs.v12i1.18555
Publikováno v:
Scopus-Elsevier
We consider optimal numeric planning with numeric conditions consisting of linear expressions of numeric state variables and actions that increase or decrease numeric state variables by constant quantities. We build on previous research to introduce
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdb52a10bf6f67010e507c164b4582f0
https://doi.org/10.1609/icaps.v31i1.15964
https://doi.org/10.1609/icaps.v31i1.15964
Autor:
Peter Jonsson, Alexander Shleyfman
Publikováno v:
Journal of Artificial Intelligence Research. 70:1183-1221
Symmetry-based pruning is a powerful method for reducing the search effort in finitedomain planning. This method is based on exploiting an automorphism group connected to the ground description of the planning task - these automorphisms are known as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2377d2b530e17d9b9600d851678f6d6b
https://doi.org/10.1613/jair.1.12283
https://doi.org/10.1613/jair.1.12283
Publikováno v:
AAAI
Agents operating in a multi-agent environment must consider not just their actions, but also those of the other agents in the system. Artificial social systems are a well-known means for coordinating a set of agents, without requiring centralized pla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::061073bf84ee9fb68e3688d2a9f1d8d5
https://doi.org/10.1609/aaai.v34i06.6549
https://doi.org/10.1609/aaai.v34i06.6549
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.