Generating Parallel Execution Plans with a Partial-Order Planner

Proceedings of the 2nd Artificial Intelligence Planning Systems Conference, AIPS 1994

Volumn , Issue , 1994, Pages 98-103

  Knoblock, Craig A ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CONDITION; EXECUTION PLANS; OVERALL EXECUTION; PARALLEL EXECUTIONS; PARALLEL PLANS; PARTIAL ORDER PLANNERS; REAL-WORLD PLANNING PROBLEM; SUBSTANTIAL REDUCTION;

EID: 0010402170     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. Allen, J. F.; Kautz, H . A.; Pelavin, R. N.; and Tcnenberg, J. D. 1991. Reasoning About Plans. San Mateo: Morgan Kaufmann.
2. Backstrom, C. 1993. Finding least constrained plans and optimal parallel executions is harder than we thought. In Current Trends in AI Planning: EWSP'93-2nd European Workshop on Planning. Amsterdam: IOS Press.
3. Barrett, A.; Golden, K.; Penberthy, S.; and Weld, D. 1993. UCPOP user s manual (version 2.0). Technical Report 93-09-06, Department of Computer Science and Engineering, University of Washington.
4. Chapman, D. 1987. Planning for conjunctive goals. Artificial Intelligence 32(3):333-377.
5. Currie, K., and Tate, A. 1991. O-Plan: The open planning architecture. Artificial Intelligence 52(1):49-86.
6. Horz, A. 1993. On the relation of classical and temporal planning. In Proceedings of the Spring Symposium on Foundations of Automatic Planning.
7. Kambhampati, S. 1994. Multi-contributor causal structures for planning: A formalization and evaluation. Artificial Intelligence.
8. Knoblock, C, and Arens, Y. 1994. Cooperating agents for information retrieval. In Proceedings of the Second International Conference on Cooperative Information Systems. University of Toronto Press.
9. McAllester, D., and Rosenblitt, D. 1991. Systematic nonlinear planning. In Proceedings of the Ninth National Conference on Artificial Intelligence.
10. Minton, S.; Bresina, J .; and Drummond, M. 1991. Commitment strategies in planning: A comparative analysis. In Proceedings of the Twelfth International Joint Conference on Artificial Intelligence.
11. Penberthy, J. S., and Weld, D. S. 1992. UCPOP: A sound, complete, partial order planner for ADL. In Third International Conference on Principles of Knowledge Representation and Reasoning, 189-197.
12. Penberthy, J. S. 1993. Planning with Continuous Change. Ph.D. Thesis, Department of Computer Science and Engineering, University Washington.
13. Régnier, P., and Fade, B. 1991. Complete determination of parallel actions and temporal optimization in linear plans of action. In Hertzberg, J ., ed.. European Workshop on Planning. Springer-Verlag. 100-111.
14. Tate, A. 1976. Project planning using a hierarchic non-linear planner. Research Report 25, Department of Artificial Intelligence, University of Edinburgh, Edinburgh, Scotland.
15. Tjaden, G. S., and Flynn, M. J. 1970. Detection and parallel execution of independent instructions. IEEE Transactions on Computers C-19(10):889-895.
16. Veloso, M. M.; Perez, M. A.; and Carbonell, J. G. 1990. Nonlinear planning with parallel resource allocation. In Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control. 207-212.
17. Vere, S. A. 1983. Planning in time: Windows and durations for activities and goals. IEEE Transactions on Pattern Analysis and Machine Intcll. 5(3):246-267.
18. Vilain, M.; Kautz, H .; and van Beek, P. 1989. Constraint propagation algorithms for temporal reasoning: A revised report. In Weld, D., and de Kleer. J ., eds., Readings in Qualitative Reasoning about Physical Systems, 373-381. Morgan Kaufmann.
19. Weld, D. S. 1994. An introduction to partial-order planning. AI Magazine.
20. Wilkins, D. E. 1984. Domain-independent planning: Representation and plan generation. Aitificial Intelligence 22(3):269 301.