Zobrazeno 1 - 10
of 25
pro vyhledávání: '"Ronen Brafman"'
Publikováno v:
Proceedings of the International Conference on Automated Planning and Scheduling. 20:xiii-xiv
This volume contains the papers accepted for presentation at ICAPS 2010, the Twentieth International Conference on Automated Planning and Scheduling, held in Toronto, Ontario, Canada, May 12–16, 2010. The annual ICAPS conference series was establis
Autor:
Shekhar, S., Ronen Brafman
Publikováno v:
Scopus-Elsevier
Interacting actions — actions whose joint effect differs from the union of their individual effects — are challenging both to represent and to plan with due to their combinatorial nature. So far, there have been few attempts to provide a succinct
In Markov Decision Processes (MDPs), the reward obtained in a state is Markovian, i.e., depends on the last state and action. This dependency makes it difficult to reward more interesting long-term behaviors, such as always closing a door after it ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::775c25eeaeb0a9e88fb2e853b90f7884
http://hdl.handle.net/11573/1182865
http://hdl.handle.net/11573/1182865
Autor:
Taig, R., Ronen Brafman
Publikováno v:
Scopus-Elsevier
We extend RBPP, the state-of-the-art, translation-based planner for conformant probabilistic planning (CPP) with deterministic actions,to handle a wide set of CPPs with stochastic actions. Our planner uses relevance analysis to divide a probabilistic
Autor:
Nissim, R., Ronen Brafman
Publikováno v:
Scopus-Elsevier
As our world becomes better connected and autonomous agents no longer appear to be science fiction, a natural need arises for enabling groups of selfish agents to cooperate in generating plans for diverse tasks that none of them can perform alone in
Publikováno v:
Scopus-Elsevier
We study the computational complexity of finding the next most preferred solution in some common formalisms for representing constraints and preferences. The problem is computationally intractable for CSPs, but is polynomial for tree-shaped CSPs and
Autor:
Gefen, A., Ronen Brafman
Publikováno v:
Scopus-Elsevier
This paper defines and studies a new, interesting, and challenging benchmark problem that originates in systems biology. The minimal seed-set problem is defined as follows: given a description of the metabolic reactions of an organism, characterize t
Autor:
Ronen Brafman, Engel, Y.
Publikováno v:
Scopus-Elsevier
Recently, Brafman and Engel (2009) proposed new concepts of marginal and conditional utility that obey additive analogues of the chain rule and Bayes rule, which they employed to obtain a directed graphical model of utility functions that resembles B
Autor:
Taig, R., Ronen Brafman
Publikováno v:
Scopus-Elsevier
Conformant probabilistic planning (CPP) differs from conformant planning (CP) by two key elements: the initial belief state is probabilistic,and the conformant plan must achieve the goal with probability $\geq\theta$, for some $0
This book constitutes the refereed proceedings of the Second International Conference on Algorithmic Decision Theory, ADT 2011, held in Piscataway, NJ, USA, in October 2011. The 24 revised full papers presented were carefully reviewed and selected fr