Planning parallel actions

Artificial Intelligence

Volumn 99, Issue 2, 1998, Pages 261-324

  Lingard, A R ^a   Richards, E B ^b  

^a GEC Marconi CIS   (United Kingdom)

^b IMPERIAL COLLEGE LONDON   (United Kingdom)

Author keywords

Constraint propagation; Planning; Synergistic interference; Temporal reasoning

Indexed keywords

CONSTRAINT THEORY; FORMAL LOGIC; PARALLEL PROCESSING SYSTEMS;

SYNERGISTIC INTERFERENCE; TEMPORAL REASONING;

ARTIFICIAL INTELLIGENCE;

EID: 0032022307     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(97)00080-5     Document Type: Article

References (34)

1. J.F. Allen, J.A. Koomen, Planning using a temporal world model, in: Proceedings IJCAI-83, Karlsruhe, Germany, 1983, pp. 741-747.
2. D. Chapman, Planning for conjunctive goals, Artificial Intelligence 32 (1987) 333-377.
3. H. Choi, E.B. Richards, A decomposition method for solving temporal constraint networks in planning, IC-Parc, Imperial Colleg, London, UK, 1996.
4. I.B. Crabtree, Resource scheduling - comparing simulated annealing with constraint programming, BT Technology J. 13 (1) (1995) 121-127.
5. K. Currie, A. Tate, O-PLAN: the open planning architecture, Artificial Intelligence 52 (1991) 49-86.
6. T.L. Dean, D.V. McDermott, Temporal data base management, Artificial Intelligence 32 (1987) 1-55.
7. R. Dechter, I. Meiri, J. Pearl, Temporal constraint networks, Artificial Intelligence 49 (1991) 61-95.
8. A. El-Kholy, Resource feasibility in planning, Ph.D. Thesis, IC-Parc, Imperial College, London, UK, 1997.
9. A. El-Kholy, E.B. Richards, Temporal and resource reasoning in planning: The parcPLAN approach, in: W. Wahlster (Ed.), Proceedings ECAI-96, Budapest, Hungary, 1996, pp. 614-618.
10. R.E. Fikes, N.J. Nilsson, STRIPS: a new approach to the application of theorem proving to problem solving, Artificial Intelligence 2 (1971) 189-208.
11. S. Kambhampati, On the utility of systematicity: understanding tradeoffs between redundancy and commitment in partial-order planning, in: Proceedings IJCAI-93, Washington, DC, 1993, pp. 1380-1385.
12. S. Kambhampati, A comparative analysis of partial order planning and task reduction planning, SIGART Bull. 6 (1) (1994).
13. S. Kambhampati, Refinement search as a unifying framework for analysing planning algorithms, in: Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), Bonn, Germany (1994).
14. C.A. Knoblock, Search reduction in hierarchical problem solving, in: Proceedings AAAI-91, Anaheim, CA, 1991, pp. 686-691.
15. C.A. Knoblock, J.D. Tenenberg, Q. Yang, Characterising abstraction hierarchies for planning, in: Proceedings AAAI-91, Anaheim, CA, 1991, pp. 692-697.
16. R. Kowalski, M. Sergot, A logic-based calculus of events. New Generation Comput. 4 (1986) 67-95.
17. J. Lever, B. Richards, parcPLAN: a planning architecture with parallel actions, resources and constraints, in: Z. Ras, M. Zemankova (Eds.), ISMIS 94, Lecture Notes in Artificial Intelligence, Vol. 869, Springer, Berlin, 1994, pp. 213-222.
18. J. Lever, M. Wallace, B. Richards, Constraint logic programming for scheduling and planning, BT Technology J. 13 (1995) 73-80.
19. A.R. Lingard, Towards the efficient generation of plans containing overlapping actions, Ph.D. Thesis, Imperial College, London, UK, 1993.
20. A.R. Lingard, E.B. Richards, Preventing synergistic interference in plans (forthcoming).
21. A.K. Mackworth, Consistency in networks of relations, Artificial Intelligence 8 (1977) 99-118.
22. J. McCarthy, P. Hayes, Some philosophical problems from the standpoint of artificial intelligence, in: B. Meltzer, D. Michie (Eds.), Machine Intelligence, Vol. 4, Edinburgh University Press, Edinburgh, Scotland, 1969, pp. 463-502.
23. D. Miller, R.J. Firby, T. Dean, Deadlines, travel time and robot problem solving, in: Proceedings IJCAI-85 Los Angeles, CA, 1985, pp. 1052-1054.
24. B. Richards, I. Bethke, J. van der Does, J. Oberlander, Temporal Representation and Inference, Academic Press, London, 1989.
25. E.D. Sacerdoti, Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1974) 115-135.
26. E.D. Sacerdoti, A Structure for Plans and Behaviour, SRI Technical Note 109, Menlo Park, CA, 1975; also: Artificial Intelligence Series, Vol. 3, Elsevier, New York, 1977.
27. E.D. Sacerdoti, A Structure for Plans and Behaviour, SRI Technical Note 109, Menlo Park, CA, 1975; also: Artificial Intelligence Series, Vol. 3, Elsevier, New York, 1977.
28. A. Tate, Project planning using a hierarchic nonlinear planner, Research Report 25, Department of A1, Edinburgh University, Edinburgh, Scotland, 1976.
29. A. Tate, Generating project networks, in: Proceedings IJCAI-77, Cambridge, MA, 1977, pp. 888-893.
30. S.A. Vere, Planning in time: windows and durations for activities and goals, IEEE Trans. Pattern Anal. Machine Intell. 5 (1983) 246-267.
31. D.E. Wilkins, Parallelism in Planning and Problem Solving: Reasoning about Resources, SRI Technical Note 258, Menlo Park, CA, 1982.
32. D.E. Wilkins, Domain independent planning: representation and plan generation. Artificial Intelligence 22 (1984) 269-301.
33. D.E. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann, Menlo Park, CA, 1988.
34. Q. Yang, A theory of conflict resolution in planning, Artificial Intelligence 58 (1992) 361-392.