2008 |
29 | EE | Blai Bonet,
Hector Geffner:
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits.
Artif. Intell. 172(12-13): 1579-1604 (2008) |
28 | EE | Blai Bonet,
Patrik Haslum,
Sarah L. Hickmott,
Sylvie Thiébaux:
Directed Unfolding of Petri Nets.
T. Petri Nets and Other Models of Concurrency 1: 172-198 (2008) |
2007 |
27 | | Patrik Haslum,
Adi Botea,
Malte Helmert,
Blai Bonet,
Sven Koenig:
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
AAAI 2007: 1007-1012 |
26 | | Stefan Edelkamp,
Shahid Jabbar,
Blai Bonet:
External Memory Value Iteration.
ICAPS 2007: 128-135 |
25 | EE | Nerio Borges,
Blai Bonet:
On Canonical Forms of Complete Problems via First-order Projections
CoRR abs/0706.3412: (2007) |
2006 |
24 | | Yolifé Arvelo,
Blai Bonet,
Maria-Esther Vidal:
Compilation of Query-Rewriting Problems into Tractable Fragments of Propositional Logic.
AAAI 2006 |
23 | | Blai Bonet,
Hector Geffner:
Learning Depth-First Search: A Unified Approach to Heuristic Search in Deterministic and Non-Deterministic Settings, and Its Application to MDPs.
ICAPS 2006: 142-151 |
22 | | Blai Bonet:
Bounded Branching and Modalities in Non-Deterministic Planning.
ICAPS 2006: 42-51 |
21 | | Blai Bonet,
Hector Geffner:
Heuristics for Planning with Penalties and Rewards using Compiled Knowledge.
KR 2006: 452-462 |
2005 |
20 | | Patrik Haslum,
Blai Bonet,
Hector Geffner:
New Admissible Heuristics for Domain-Independent Planning.
AAAI 2005: 1163-1168 |
19 | | Blai Bonet,
Hector Geffner:
An Algorithm Better than AO*?
AAAI 2005: 1343-1348 |
18 | | Héctor Palacios,
Blai Bonet,
Adnan Darwiche,
Hector Geffner:
Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations.
ICAPS 2005: 141-150 |
17 | EE | Blai Bonet,
Hector Geffner:
mGPT: A Probabilistic Planner Based on Heuristic Search.
J. Artif. Intell. Res. (JAIR) 24: 933-944 (2005) |
2003 |
16 | | Blai Bonet,
Sylvie Thiébaux:
GPT Meets PSR.
ICAPS 2003: 102-112 |
15 | | Blai Bonet,
Hector Geffner:
Labeled RTDP: Improving the Convergence of Real-Time Dynamic Programming.
ICAPS 2003: 12-31 |
14 | | Blai Bonet,
Hector Geffner:
Faster Heuristic Search Algorithms for Planning with Uncertainty and Full Feedback.
IJCAI 2003: 1233-1238 |
2002 |
13 | | Blai Bonet:
An epsilon-Optimal Grid-Based Algorithm for Partially Observable Markov Decision Processes.
ICML 2002: 51-58 |
12 | | Blai Bonet,
Judea Pearl:
Qualitative MDPs and POMDPs: An Order-Of-Magnitude Approximation.
UAI 2002: 61-68 |
2001 |
11 | EE | Blai Bonet:
A Calculus for Causal Relevance.
UAI 2001: 40-47 |
10 | EE | Blai Bonet:
Instrumentality Tests Revisited.
UAI 2001: 48-55 |
9 | | Blai Bonet,
Hector Geffner:
Heuristic Search Planner 2.0.
AI Magazine 22(3): 77-80 (2001) |
8 | | Blai Bonet,
Hector Geffner:
Planning and Control in Artificial Intelligence: A Unifying Perspective.
Appl. Intell. 14(3): 237-252 (2001) |
7 | EE | Blai Bonet,
Hector Geffner:
Planning as heuristic search.
Artif. Intell. 129(1-2): 5-33 (2001) |
2000 |
6 | | Blai Bonet,
Hector Geffner:
Planning with Incomplete Information as Heuristic Search in Belief Space.
AIPS 2000: 52-61 |
5 | | Derek Long,
Henry A. Kautz,
Bart Selman,
Blai Bonet,
Hector Geffner,
Jana Koehler,
Michael Brenner,
Jörg Hoffmann,
Frank Rittinger,
Corin R. Anderson,
Daniel S. Weld,
David E. Smith,
Maria Fox:
The AIPS-98 Planning Competition.
AI Magazine 21(2): 13-33 (2000) |
1999 |
4 | | Blai Bonet,
Hector Geffner:
Planning as Heuristic Search: New Results.
ECP 1999: 360-372 |
1998 |
3 | | Blai Bonet,
Hector Geffner:
Learning Sorting and Decision Trees with POMDPs.
ICML 1998: 73-81 |
1997 |
2 | | Blai Bonet,
Gábor Loerincs,
Hector Geffner:
A Robust and Fast Action Selection Mechanism for Planning.
AAAI/IAAI 1997: 714-719 |
1996 |
1 | EE | Blai Bonet,
Hector Geffner:
Arguing for Decisions: A Qualitative Model of Decision Making.
UAI 1996: 98-105 |