Bibliography

1

P. Bertoli and A. Cimatti.
Improving heuristics for planning as search in belief space.
In Proceedings of AIPS'02, 2002.

2

P. Bertoli, A. Cimatti, and M. Roveri.
Heuristic search + symbolic model checking = efficient conformant planning.
In Proceedings of IJCAI'01, 2001.

3

P. Bertoli, A. Cimatti, M. Roveri, and P. Traverso.
Planning in nondeterministic domains under partial observability via symbolic model checking.
In Proceedings of IJCAI'01, 2001.

4

A. Blum and M. Furst.
Fast planning through planning graph analysis.
In Proceedings of IJCAI'95, 1995.

5

B. Bonet and H. Geffner.
Planning as heuristic search: New results.
In Proceedings of ECP'99, 1999.

6

B. Bonet and H. Geffner.
Planning with incomplete information as heuristic search in belief space.
In Proceedings of AIPS'00, 2000.

7

K. Brace, R. Rudell, and R. Bryant.
Efficient implementation of a bdd package.
In Proceedings of the 27th ACM/IEEE design automation conference, 1990.

8

R. Bryant.
Graph-based algorithms for Boolean function manipulation.
IEEE Transactions on Computers, C-35(8):677-691, August 1986.

9

D. Bryce and S. Kambhampati.
Heuristic guidance measures for conformant planning.
In Proceedings of ICAPS'04, 2004.

10

Claudio Castellini, Enrico Giunchiglia, and Armando Tacchella.
Improvements to sat-based conformant planning.
In Proceedings of ECP'01, 2001.

11

A. Cimatti and M. Roveri.
Conformant planning via symbolic model checking.
Journal of Artificial Intelligence Research, 13:305-338, 2000.

12

T. H. Cormen, C. E. Leiserson, and R. L. Rivest.
Introduction to Algorithms.
McGraw-Hill, 1990.

13

W. Cushing and D. Bryce.
State agnostic planning graphs.
In Proceedings of AAAI'05, 2005.

14

J. de Kleer.
An Assumption-Based TMS.
Artificial Intelligence, 28(2):127-162, 1986.

15

Michael R. Genesereth and Illah R. Nourbakhsh.
Time-saving tips for problem solving with incomplete information.
In Proceedings of AAAI'93, 1993.

16

E.A. Hansen and S. Zilberstein.
LAO: A heuristic-search algorithm that finds solutions with loops.
Artificial Intelligence, 129(1-2):35-62, 2001.

17

J. Hoffmann and R. Brafman.
Conformant planning via heuristic forward search: A new approach.
In Proceedings of ICAPS'04, 2004.

18

J. Hoffmann and B. Nebel.
The FF planning system: Fast plan generation through heuristic search.
Journal of Artificial Intelligence Research, 14:253-302, 2001.

19

S. Kambhampati, L. Ihrig, and B. Srivastava.
A candidate set based analysis of subgoal interactions in conjunctive goal planning.
In Proceedings of AIPS'96, 1996.

20

J. Koehler, B. Nebel, J. Hoffmann, and Y. Dimopoulos.
Extending planning graphs to an adl subset.
In Proceedings of ECP'97, 1997.

21

J. Kurien, P. Nayak, and D.E. Smith.
Fragment-based conformant planning.
In Proceedings of AIPS'02, 2002.

22

Derek Long and Maria Fox.
The 3rd international planning competition: Results and analysis.
Journal of Artificial Intelligence Research, 20:1-59, 2003.

23

X. Nguyen, S. Kambhampati, and R.S. Nigenda.
Planning graph as the basis for deriving heuristics for plan synthesis by state space and CSP search.
Artificial Intelligence, 135(1-2):73-123, 2002.

24

N.J. Nilsson.
Principles of Artificial Intelligence.
Morgan Kaufmann, 1980.

25

Edwin P. D. Pednault.
Synthesizing plans that contain actions with context-dependent effects.
Computational Intelligence, 4:356-372, 1988.

26

R.P.A. Petrick and F. Bacchus.
A knowledge-based approach to planning with incomplete information and sensing.
In Proceedings of AIPS'02, 2002.

27

J. Rintanen.
Expressive equivalence of formalisms for planning with sensing.
In Proceedings of ICAPS'03, 2003.

28

J. Rintanen.
Product representation of belief spaces in planning under partial observability.
In Proceedings of IJCAI'03, 2003.

29

J. Rintanen.
Distance estimates for planning in the discrete belief space.
In Proceedings of AAAI'04, 2004.

30

D.E. Smith and D.S. Weld.
Conformant graphplan.
In Proceedings of AAAI'98, 1998.

31

D.S. Weld, C. Anderson, and D.E. Smith.
Extending graphplan to handle uncertainty and sensing actions.
In Proceedings of AAAI'98, 1998.