Bibliography

Bacchus 2000

Bacchus, F. 2000.
AIPS-2000 planning competition
http://www.cs.toronto.edu/aips2000/SelfContainedAIPS-2000.ppt.

Barrett et al.1993

Barrett, A., Golden, K., Penberthy, S., Weld, D. 1993.
UCPOP User's Manual.
Dept. of Computer Science and Engineering, University of Washington, Seattle, WA.
TR 93-09-06.

Blum Furst 1997

Blum, A. L. Furst, M. L. 1997.
Fast planning through planning graph analysis
Artificial Intelligence Journal, 90(1-2), 225-279.

Bonet Geffner 1999

Bonet, B. Geffner, H. 1999.
Planning as heuristic search: New results
In Proceedings of the Fifth European Conference on Planning (ECP-99) Durham, UK.

Chien et al. 2000

Chien, S., Kambhampati, S., Knoblock, C. A.2000.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000).
AAAI Press, Breckenridge, CO.

Cohen 1991

Cohen, P. R. 1991.
A survey of the eighth national conference on artificial intelligence: Pulling together or pulling apart?
AI Magazine, 12(1), 16-41.

Cohen 1995

Cohen, P. R. 1995.
Empirical Methods for Artificial Intelligence.
MIT Press.

Drummond et al. 1990

Drummond, M. E., Kaelbling, L. P., Rosenschein, S. J. 1990.
Collected notes from the benchmarks and metrics workshop
Artificial intelligence branch FIA-91-06, NASA Ames Research Center.

Engelhardt et al. 2001

Engelhardt, B., Chien, S., Barrett, T., Willis, J., Wilklow, C. 2001.
The data-chaser and citizen explorer benchmark problem sets
In Proceedings of the Sixth European Conference on Planning (ECP 01) Toledo, Spain.

Estlin Mooney 1997

Estlin, T. A. Mooney, R. J. 1997.
Learning to improve both efficicency and quality of planning
In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, 1227-1233, Nagoya, Japan.

Fox Long 1999

Fox, M. Long, D. 1999.
The efficient implementation of the plan-graph in STAN
Journal of Artificial Intelligence Research, 10, 87-115.

Fox Long 2002

Fox, M. Long, D. 2002.
PDDL2.1: An extension to PDDL for expressing temporal planning domains
Available at http://www.dur.ac.uk/d.p.long/pddl2.ps.gz.

Genevini Schubert 1996

Genevini, A. Schubert, L. 1996.
Accelerating partial-order planners: Some techniques for effective search control and pruning
Journal of Artificial Intelligence Research, 5, 95-137.

Hanks et al. 1993

Hanks, S., Nguyen, D., Thomas, C. 1993.
A beginner's guide to the truckworld simulator
Dept. of Computer Science and Engineering UW-CSE-TR 93-06-09, University of Washington.

Hanks et al. 1994

Hanks, S., Pollack, M. E., Cohen, P. R. 1994.
Benchmarks, test beds, controlled experimentation and the design of agent architectures
AI Magazine, 17-42.

Haslum Geffner 2000

Haslum, P. Geffner, H. 2000.
Admissible heuristics for optimal planning
In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), 140-149, Breckenridge, CO. AAAI Press.

Helmert 2001

Helmert, M. 2001.
On the complexity of planning in transportation domains
In 6th European Conference on Planning (ECP'01), Lecture Notes in Artificial Intelligence, New York, Springer-Verlag.

Hoffmann 2001

Hoffmann, J. 2001.
Local search topology in planning benchmarks: An empirical analysis
In Proceedings of the 17th International Joint Conference on Artificial Intelligence Seattle, WA, USA.

Hoffmann Nebel 2001

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

Howe et al. 1999

Howe, A. E., Dahlman, E., Hansen, C., Scheetz, M., von Mayrhauser, A. 1999.
Exploiting competitive planner performance
In Proceedings of the Fifth European Conference on Planning, Durham, UK.

Howe et al. 1997

Howe, A. E., von Mayrhauser, A., Mraz, R. T. 1997.
Test case generation as an AI planning problem
Automated Software Engineering, 4(1), 77-106.

Joslin Pollack 1994

Joslin, D. Pollack, M. 1994.
Least-cost flaw repair: A plan refinement strategy for partial-order planning
In Proceedings of the Twelfth National Conference on Artificial Intelligence, 1004-1009, Seattle, WA.

Kautz Selman 1998

Kautz, H. Selman, B. 1998.
BLACKBOX: A new approach to the application of theorem proving to problem solving
In Working notes of the AIPS98 Workshop on Planning as Combinatorial Search, Pittsburgh, PA.

Kautz 2002

Kautz, H.
blackbox: a SAT technology planning system
http://www.cs.washington.edu/homes/kautz/blackbox/index.html.

Kautz Selman 1999

Kautz, H. Selman, B. 1999.
Unifying SAT-based and graph-based planning
In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, Sweden.

Koehler 1999

Koehler, J. 1999.
Handling of conditional effects and negative goals in IPP
128, Institute for Computer Science, Albert Ludwigs University, Freiburg, Germany.

Koehler et al. 1997

Koehler, J., Nebel, B., Hoffmann, J., Dimopoulos, Y. 1997.
Extending planning graphs to an ADL subset
In Proceedings of the Fourth European Conference in Planning.

McDermott et al. 1998

McDermott, D., Ghallab, M., Howe, A., Knoblock, C., Ram, A., Veloso, M., Weld, D., Wilkins, D. 1998.
The Planning Domain Definition Language.

McDermott2000

McDermott, D. 2000.
The 1998 AI planning systems competition
AI Magazine, 21(2), 35-56.

Penberthy Weld1992

Penberthy, J. S. Weld, D. S. 1992.
UCPOP: a sound, complete, partial order planner for adl
In Proceedings of the Third International Conference on Knowledge Representation and Reasoning, 103-114.

Perez1995

Perez, M. A. 1995.
Learning Search Control Knowledge to Improve Plan Quality.
Ph.D. thesis, Carnegie-Mellon University.

Piccinocchi et al. 1997

Piccinocchi, S., Ceccarelli, M., Piloni, F., Bicchi, A. 1997.
Interactive benchmark for planning algorithms on the web
In Proceedings of IEEE International Conference on Robotics and Automation.

Pollack Ringuette 1990

Pollack, M. E., Ringuette, M. 1990.
Introducing the Tileworld: Experimentally evaluating agent architectures
In Proceedings of the Eight National Conference on Artificial Intelligence, 183-189, Boston, MA.

Pollack et al. 1997

Pollack, M., Joslin, D., Paolucci, M. 1997.
Flaw selection strategies for partial-order planning
Journal of Artificial Intelligence Research, 6, 223-262.

Rabideau et al. 2000

Rabideau, G., Englehardt, B., Chien, S. 2000.
Using generic prferences to incrementally improve plan quality
In Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2000), Breckenridge, CO.

Slaney Thiebaux 2001

Slaney, J., Thiebaux, S. 2001.
Blocks world revisited
Artificial Intelligence Journal, 125(1-2), 119-153.

Srinivasan Howe 1995

Srinivasan, R. Howe, A. E. 1995.
Comparison of methods for improving search efficiency in a partial-order planner
In Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1620-1626, Montreal, Canada.

Sussman 1973

Sussman, G. A. 1973.
A computational model of skill acquisition
Memo no. AI-TR-297, MIT AI Lab.

The Prodigy Research Group 1992

The Prodigy Research Group 1992.
PRODIGY 4.0; the manual and tutorial
School of Computer Science 92-150, Carnegie Mellon University.

Watson et al. 1999

Watson, J., Barbulescu, L., Howe, A., Whitley, L. D. 1999.
Algorithm performance and problem structure for flow-shop scheduling
In Proceedings of the Sixteenth National Conference on Artificial Intelligence (AAAI-99), Orlando, FL.

Watson et al. 2001

Watson, J., Beck, J., Barbulescu, L., Whitley, L. D., Howe, A. 2001.
Toward a descriptive model of local search cost in job-shop scheduling
In Proceedings of Sixth European Conference on Planning (ECP'01), Toledo, Spain.

Weld et al. 1998

Weld, D., Anderson, C., Smith, D. 1998.
Extending graphplan to handle uncertainty and sensing actions
In Proceedings of the Fifteenth National Conference on Artificial Intelligence Madison, WI.

Weld 1999

Weld, D. S. 1999.
Recent advances in AI planning
AI Magazine, 20(2), 93-122.

Wilkins desJardins 2001

Wilkins, D. E. desJardins, M. 2001.
A call for knowledge-based planning
AI Magazine, 22(1), 99-115.