References

Backstrom, C. (1993)

Finding least constrained plans and optimal parallel executions is harder than we thought. In Proceedings of the Second European Workshop on Planning.

Barrett, A., Soderland, S., & Weld, D. (1991)

The effect of step-order representations on planning. Techinical report 91-05-06, Univ. of Washington, Computer Science Dept.

Barrett, A. & Weld, D. (1994)

Partial-order planning: Evaluating possible efficiency gains. Artificial Intelligence, 67(1), 71-112.

Chapman, D. (1987)

Planning for conjunctive goals. Artificial Intelligence, 32, 333-377.

Chen, P. (1989)

Heuristic Sampling on Backtrack Trees. Ph.D. thesis, Dept. of Computer Science, Stanford Univ., Stanford, CA.

Collins, G. & Pryor, L. (1992)

Achieving the functionality of filter conditions in a partial order planner. In Proceedings of the Tenth National Conference on Artificial Intelligence.

Crawford, J. & Baker, A. (1994)

Experimental results on the application of satisfiability algorithms to scheduling problems. In Proceedings of the Twelfth National Conference on Artificial Intelligence.

Dean, T. & Boddy, M. (1988)

Reasoning about partially ordered events. Artificial Intelligence, 36, 375-399.

Drummond, M. & Currie, K. (1989)

Goal-ordering in partially ordered plans. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence.

Ginsberg, M. & Harvey, W. (1992)

Iterative broadening. Artificial Intelligence, 55, 367-383.

Godefroid, P. & Kabanza, F. (1991)

An efficient reactive planner for synthesizing reactive plans. In Proceedings of the Ninth National Conference on Artificial Intelligence.

Hertzberg, J. & Horz, A. (1989)

Towards a theory of conflict detection and resolution in nonlinear plans. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence.

Kambhampati, S. (1994a)

Design tradeoffs in partial order (plan space) planning. In Proceedings of the Second International Conference on AI Planning Systems.

Kambhampati, S. (1994b)

Multi contributor causal structures for planning: A formalization and evaluation. Artificial Intelligence, 69, 235-278.

Kambhampati, S. (1994c)

Refinement search as a unifying framework for analyzing plan space planners. In Proceedings of the Fourth International Conference on Principles of Knowledge Representation and Reasoning.

Kambhampati, S. & Chen, J. (1993)

Relative utility of EBG-based plan reuse in partial ordering vs. total ordering planning. In Proceedings of the Eleventh National Conference on Artificial Intelligence.

Korf, R. (1985)

Depth-first iterative deepening: An optimal admissible tree search. Artificial Intelligence, 27, 97-109.

Korf, R. (1987)

Planning as search: A quantitative approach. Artificial Intelligence, 33, 65-88.

Langley, P. (1992)

Systematic and nonsystematic search strategies. In Proceedings of the First International Conference on AI Planning Systems.

McAllester, D. & Rosenblitt, D. (1991)

Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence.

Minton, S., Bresina, J., & Drummond, M. (1991a)

Commitment strategies in planning: A comparative analysis. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence.

Minton, S., Bresina, J., Drummond, M., & Philips, A. (1991b)

An analysis of commitment strategies in planning: The details. Technical report 91-08, NASA Ames, AI Research Branch.

Minton, S., Drummond, M., Bresina, J., & Philips, A. (1992)

Total order vs. partial order planning: Factors influencing performance. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning.

Pednault, E. (1988)

Synthesizing plans that contain actions with context-dependent effects. Computational Intelligence, 4, 356-372.

Penberthy, J. & Weld, D. (1992)

UCPOP: A sound, complete, partial-order planner for ADL. In Proceedings of the Third International Conference on Principles of Knowledge Representation and Reasoning.

Regnier, P. & Fade, B. (1991)

Complete determination of parallel actions and temporal optimization in linear plans of action. In Hertzberg, J., European Workshop on Planning, 522 of Lecture Notes in Artificial Intelligence, 100-111 Sankt Augustin, Germany. Springer.

Rosenbloom, P., Lee, S., & Unruh, A. (1993)

Bias in planning and explanation-based learning. In Minton, S., Machine Learning Methods for Planning. Morgan Kaufmann Publishers.

Sacerdoti, E. (1975)

The nonlinear nature of plans. In Proceedings of the Fourth International Joint Conference on Artificial Intelligence.

Sacerdoti, E. (1977)

A Structure for Plans and Behavior. American Elsivier, New York.

Tate, A. (1974)

Interplan: A plan generation system which can deal with interactions between goals. Memo MIP-R-109, Univ. of Edinburgh, Machine Intelligence Research Unit.

Tate, A. (1977)

Generating project networks. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence.

Veloso, M., Perez, M., & Carbonell, J. (1990)

Nonlinear planning with parallel resource allocation. In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control.

Waldinger, R. (1975)

Achieving several goals simultaneously. In Machine Intelligence 8. Ellis Harwood, Ltd.

Warren, D. (1974)

Warplan: A system for generating plans. Memo 76, Computational Logic Dept., School of AI, Univ. of Edinburgh.