1 |
H. L. S, Younes and M. Littman, "PPDDL1.0: An Extension to PDDL for Expressing Planning Do-mains wit Probabilistic Effects," Technical Report CMU-CS-04-167, 2004
|
2 |
B. Bonet and H. Geffner, "Labeled RTDP: Im-proving the Convergence of Real-Time Dynamic Programming," Proceeding of the ICAPS'03, pp.12-21, 2003
|
3 |
U. Kuter, D. Nau, E. Reisner and R. Goldman, “Conditionalization: Adapting Forward-Chaining Planners to Partially Observable Environments,” Proceeding of the ICAPS'07, 2007
|
4 |
M. Fox and D. Long, “PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains,” Journal of Artificial Intelligence Research, vol.20, pp.61-124, 2003
|
5 |
U. Kuter and D. Nau, “Forward-Chaining Planning in Nondeterministic Domains,” Proceedings of the National Conference on Artflcial Intelligence (AAAI), pp.513-518, 2004
|
6 |
M. Ghallib, D. Nau, and P. Traverso, Automated Planning: Theory and Practice, Morgan Kaufmann, 2004
|
7 |
S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach, 2nd Edition, Prentice Hall, 2003
|
8 |
E. Hansen and S. Zilberstein, "LAO: A Heuristic Search Algorithm that Finds Solutions with Loops," Artificial Intelligence, vol.129, no.1-2, pp.35-62, 2001
DOI
ScienceOn
|