Decomposition of planning problems

AI Communications

Volumn 19, Issue 1, 2006, Pages 49-81

  Sebastia, Laura ^a   Onaindia, Eva ^a   Marzal, Eliseo ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Planning; Problem decomposition

Indexed keywords

PLANNING; PROFESSIONAL ASPECTS;

PROBLEM DECOMPOSITION; STATE-OF-THE-ART PLANNERS;

PROBLEM SOLVING;

EID: 33644771185     PISSN: 09217126     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (45)

1. J.L. Ambite and C.A. Knoblock, Planning by rewriting: efficiently generating high-quality plans, in: 14th National Conference on AI, 1997.
2. F. Bacchus, AIPS-2000 competition results. Technical report, University of Toronto, 2000. http://www.cs.toronto.edu/aips2000/.
3. F. Bacchus and Q. Yang, Downward refinement and the efficiency of hierarchical problem solving, Artificial Intelligence 71 (1994), 43-100.
4. A. Blum and M. Furst, Fast planning through planning graph analysis, Artificial Intelligence 90(1-2) (1997), 281-300.
5. B. Bonet and H. Geffner, Planning as heuristic search: New results, in: 5th European Conf. on Planning (ECP-99), 1999.
6. B. Clement and E. Durfee, Top-down search for coordinating the hierarchical plans of multiple agents, in: Third International Conference on Autonomous Agents, 1999, pp. 252-299.
7. D. Corkill, Hierarchical planning in a distributed environment, in: 6th International Joint Conference on Artificial Intelligence, 1979.
8. K. Currie and A. Tate, O-plan: the open system architecture, Artificial Intelligence 52 (1991), 49-86.
9. S. Das, P. Gonsalves, R. Krikorian and W. Truszkowski, Multi-agent planning and scheduling environment for enhanced spacecraft autonomy, in: 5th International Symposium on Artificial Intelligence, Robotics and Automation in Space, 1999.
10. K. Decker and V. Lesser, Generalizing the partial global planning algorithm, International Journal of Intelligent and Cooperative Information Systems 1(2) (1992), 319-346.
11. K. Decker, V. Lesser and M.V. Nagendra Prasad, Macron: an architecture for multi-agent cooperative information gathering, in: Conference on Information and Knowledge Management, Workshop on Intelligent Information Agents, 1995.
12. M.E. Desjardins and M.J. Wolverton, Coordinating planning activity and information flow in a distributed planning system, AI Magazine (1999) pp. 45-53.
13. J. Dix, H. Munoz-Avila, D. Nau and L. Zhang, IMPACTing SHOP: Putting an AI planner into a multi-agent environment, in: Annals of Mathematics and AI, 2002.
14. E. Durfee and V. Lesser, Partial global planning: a coordination framework for distributed hypothesis formation, IEEE Transactions on Systems, Man and Cybernetics 1(1) (1991), 63-83.
15. M. Fox and D. Long, The automatic inference of state invariants in TIM, Journal of Artificial Intelligence Research 9 (1998), 367-421.
16. M. Fox and D. Long, Hybrid STAN: Identifying and managing combinatorial sub-problems in planning, in: Proceedings of IJCAI '01, 2001, pp. 445-452.
17. M. Fox and D. Long, Domains and results of the third international planning competition, 2002. http://www.dur.ac.uk/d.p.long/competition.html.
18. M.R. Garey and D.S. Johnson, Computers and Intractability: A Quide to the Theory of NP-Completeness, W.H. Freeman and Company, San Francisco, 1979.
19. A. Gerevini and L.K. Schubert, Discovering state constraints in DISCOPLAN: Some new results, in: 17th Nat. Conf. on Artificial Intelligence (AAAI '2000), 2000.
20. A. Gerevini and I. Serina, LPG: a planner based on local search for planning graphs, in: AIPS '02. AAAI Press, 2002.
21. J. Hoffmann, Extending FF to numerical state variables, in: ECAI '02, IOS Press, Amsterdam, 2002, pp. 571-575.
22. J. Hoffmann, Local search topology in planning benchmarks: A theoretical analysis, in: AIPS '02, 2002.
23. J. Hoffmann and B. Nebel, The FF planning system: Fast plan generation through heuristic search, Journal of Artificial Intelligence Research 14 (2001), 253-302.
24. J. Hoffmann, J. Porteous and L. Sebastia, Ordered landmarks in planning, Journal of Artificial Intelligence Research 22 (2004), 215-287.
25. M. Iwen and A. Mali, Automatic problem decomposition for distributed planning, in: International Conference on Artificial Intelligence (IC-AI '2002), Volume 1, 2002, pp. 411-417.
26. M. Iwen and A. Mali, Distributed graphplan, in: 14th IEEE International Conference on Tools with Artificial Intelligence. (ICTAI '2002), 2002, pp. 138-145.
27. K. Knight, Are many reactive agents better than a few deliberative ones? in: 13th International Joint Conference on Artificial Intelligence (IJCAI), 1993, pp. 432-437.
28. C.A. Knoblock, Generating Abstraction Hierarchies - An Automated Approach to Reducing Search in Planning, Kluwer, Dordrecht, Netherlands, 1993.
29. J. Koehler and J. Hoffmann, On reasonable and forced goal orderings and their use in an agenda-driven planning algorithm, Journal of Artificial Intelligence Research 12 (2000).
30. J. Koehler, B. Nebel, J. Hoffmann and Y. Dimopoulos, Extending planning graphs to an ADL subset, in: ECP '97, Springer LNAI, 1997.
31. R. Korf, Planning as search: a quantitative approach, Artificial Intelligence 33 (1985), 65-85.
32. A. Lansky, Scope and abstraction: Two criteria for localized planning, in: Proceedings of the 14th International Joint Conference on Artificial Intelligence, 1995, pp. 1612-1619.
33. D. Long and M. Fox, Efficient implementation of the plan graph in STAN, Journal of Artificial Intelligence Research 10 (1999), 87-115.
34. D. Long and M. Fox, Automatic synthesis and use of generic types in planning, in: 5th Conference on Artificial Intelligence Planning Systems, 2000, pp. 196-205.
35. A. Mali and S. Kambhampati, Distributed planning, The Encyclopaedia of Distributed Computing, 1999.
36. D. Nau, Y. Cao, A. Lotem and H. Munoz-Avila, Shop: Simple hierarchical ordered planner, in: 16th International Joint Conference on AI, 1999, pp. 968-975.
37. J. Porteous, L. Sebastia and J. Hoffmann, On the extraction, ordering, and usage of landmarks in planning, in: Recent Advances in AI Planning, ECP '01, Springer, 2001.
38. I. Refanidis and I. Vlahavas, The GRT planning system: backward heuristic construction in forward state-space planning, Journal of Artificial Intelligence Research 15 (2001), 115-161.
39. E. Sacerdoti, Planning in a hierarchy of abstraction spaces, Artificial Intelligence 5 (1974), 115-135.
40. B. Srivastava, Realplan: Decoupling causal and resource reasoning in planning, in: I7th National Conference on AI, 2000, pp. 812-818.
41. B.W. Wah and Y. Chen, Constrained partitioning in penalty formulations for solving temporal planning problems, Artificial Intelligence, 2004 (to appear).
42. D.E. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann Publishers Inc., 1988.
43. B.W. Wah, Y. Chen and C. Hsu, Temporal planning using subgoal partitioning and resolution in SGPlan, Journal of Artificial Intelligence Research (2005) (to appear).
44. Q. Yang, Intelligent Planning. A Descomposition and Abstraction Based Approach, Springer, Berlin, Heidelberg, 1997.
45. H. Younes and R. Simmons, On the role of ground actions in refinement planning, in: Proceedings of the Sixth Int. Conference on AI Planning and Scheduling (AIPS '02), AAAI Press, 2002.