Constraints and AI planning

IEEE Intelligent Systems

Volumn 20, Issue 2, 2005, Pages 62-72

  Nareyek, Alexander ^a,h   Freuder, Eugene C ^a   Fourer, Robert ^b,i   Giunchiglia, Enrico ^c,j   Goldman, Robert P ^d   Kautz, Henry ^e,k   Rintanen, Jussi ^f   Tate, Austin ^g  

^a UNIVERSITY COLLEGE CORK   (Ireland)

^b NORTHWESTERN UNIVERSITY   (United States)

^c UNIVERSITY OF GENEVA   (Switzerland)

^d SMART INFORMATION FLOW TECHNOLOGIES   (United States)

^e UNIVERSITY OF WASHINGTON   (United States)

^f UNIVERSITY OF FREIBURG   (Germany)

^g UNIVERSITY OF EDINBURGH   (United Kingdom)

^h IGDA's Artif Intell Interface SC   (United Kingdom)

ⁱ Northwestern University   (United States)

^j UNIVERSITY OF GENOA   (Italy)

^k Università di Geneva ^*  (United States)

more..

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; DATA STRUCTURES; DECISION MAKING; FUNCTIONS; HIERARCHICAL SYSTEMS; INTEGER PROGRAMMING; OPTIMIZATION; PLANNING; PROBLEM SOLVING; SCHEDULING;

CONSTRAINT PROGRAMMING (CP); CONSTRAINT SATISFACTION; GLOBAL CONSTRAINTS; HIERARCHICAL TASK NETWORK (HTN);

COMPUTER PROGRAMMING;

EID: 17444413791     PISSN: 15411672     EISSN: None     Source Type: Journal    
DOI: 10.1109/MIS.2005.25     Document Type: Review

References (61)

1. J. Allen, J. Hendler, and A. Tate, eds., Readings in Planning, Morgan Kaufmann, 1990.
2. R. Dechter, I. Meiri, and J. Pearl, "Temporal Constraint Networks," Artificial Intelligence, vol. 49, nos. 1-3, 1991, pp. 61-95.
3. C. Gomes, B. Selman, and H. Kautz, "Boosting Combinatorial Search through Randomization," Proc. 15th Nat'l Conf. Artificial Intelligence (AAAI 98), AAAI Press, 1998, pp. 431-437.
4. M. Moskewicz et al., "Chaff: Engineering an Efficient SAT Solver," Proc. 38th Design Automation Conf. (DAC 01), IEEE CS Press, 2001, pp. 667-672.
5. M. Davis and H. Putnam, "A Computation Procedure for Quantification Theory," J. ACM, vol. 7, no. 3, 1960, pp. 201-215.
6. B. Selman, H. Levesque, and D. Mitchell, "A New Method for Solving Hard Satisfiability Problems," Proc. 10th Nat'l Conf. Artificial Intelligence (AAAI 92), AAAI Press, 1992, pp. 440-446.
7. D. Schuurmans and F. Southey, "Local Search Characteristics of Incomplete SAT Procedures," Proc. 17th Nat'l Conf. Artificial Intelligence (AAAI 00), AAAI Press, 2000, pp. 297-302.
8. H. Kautz and B. Selman, "Planning as Satisfiability," Proc. 19th European Conf. Artificial Intelligence (ECAI 92), Wiley, 1992, pp. 359-363.
9. R.E. Fikes and N. Nilsson, "STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving," Artificial Intelligence, vol. 5, no. 2, 1971, pp. 189-208.
10. H. Kautz and B. Selman, "Pushing the Envelope: Planning, Prepositional Logic, and Stochastic Search," Proc. 13th Nat'l Conf. Artificial Intelligence (AAAI 96), AAAI Press, 1996, pp. 1194-1201.
11. A. Biere et al., "Symbolic Model Checking without BDDs," Proc. 5th Int'l Conf. Tools and Algorithms for the Analysis and Construction of Systems (TACAS 99), LNCS 1579, Springer-Verlag, 1999, pp. 193-207.
12. A. Tate, "Generating Project Networks," Proc. 5th Int'l Joint Conf. Artificial Intelligence (IJCAI 77), Morgan Kaufmann, 1977, pp. 888-893.
13. J.S. Penberthy and D.S. Weld, "Temporal Planning with Continuous Change," Proc. 12th Nat'l Conf. Artificial Intelligence (AAAI 94), AAAI Press, 1994, pp. 1010-1015.
14. L.A. Wolsey, Integer Programming, John Wiley, 1998.
15. T. Vossen et al., "Applying Integer Programming to AI Planning," Knowledge Eng. Rev., vol. 16, no. 1, 2001, pp. 85-100.
16. H. Kautz and B. Selman, "Blackbox: A New Approach to the Application of Theorem Proving to Problem Solving," Working Notes of the AIPS-98 Workshop on Planning as Combinatorial Search, 1998, pp. 58-60.
17. S.A. Wolfman and D.S. Weld, "The LPSAT Engine & Its Application to Resource Planning," Proc. 16th Int'l Joint Conf. Artificial Intelligence (IJCAI 99), 1999, pp. 310-316.
18. J. Bisschop and A. Meeraus, "On the Development of a General Algebraic Modeling System in a Strategic Planning Environment," Mathematical Programming Study, no. 20, 1982, pp. 1-29.
19. R. Fourer, "Modeling Languages versus Matrix Generators for Linear Programming," ACM Trans. Mathematical Software, no. 9, 1983, pp. 143-183.
20. C. A.C. Kuip, "Algebraic Languages for Mathematical Programming," European J. Operational Research, vol. 67, no. 1, 1993, pp. 25-51.
21. R. Fourer, D.M. Gay, and B.W. Kernighan, AMPL; A Modeling Language for Mathematical Programming, 2nd ed., Thomson Brooks/Cole, 2003.
22. M. Milano et al., "The Benefits of Global Constraints for the Integration of Constraint Programming and Integer Programming," Working Notes AAAI-2000 Workshop Integration of AI and OR Techniques for Combinatorial Optimization, 2000.
23. J. Hooker et al., "A Scheme for Unifying Optimization and Constraint Satisfaction Methods," Knowledge Eng. Rev., vol. 15, no. 1, 2000, pp. 11-30.
24. P. Refalo, "Tight Cooperation and Its Application in Piecewise Linear Optimization," Proc. 5th Int'l Conf. Principles and Practice of Constraint Programming (CP 99), 1999, pp. 375-389.
25. M.J. Stefik, "Planning with Constraints (MOLGEN: Part 1)," Artificial Intelligence, vol. 16, no. 2, 1981, pp. 111-140.
26. D. Joslin, Passive and Active Decision Postponement in Plan Generation, doctoral dissertation, Univ. of Pittsburgh, 1996.
27. J.M. Lever and B. Richards, "parcPLAN: A Planning Architecture with Parallel Action, Resources and Constraints," Proc. 9th Int'l Symp. Methodologies for Intelligent Systems (ISMIS 94), 1994, pp. 213-222.
28. V. Liatsos, Scaleability in Planning with Limited Resources, doctoral dissertation, IC-Parc, Imperial College, 2000.
29. P. Van Beek and X. Chen, "CPlan: A Constraint Programming Approach to Planning," Proc. 16th Nat'l Conf. Artificial Intelligence (AAAI 99), AAAI Press, 1999, pp. 585-590.
30. J. Rintanen and H. Jungholt, "Numeric State Variables in Constraint-Based Planning," Proc. 5th European Conf. Planning (ECP 99), 1999, pp. 109-121.
31. B. Do and S. Kambhampati, "Solving Planning Graph by Compiling it into a CSP," Proc. 5th Int'l Conf. Artificial Intelligence Planning and Scheduling (AIPS 2000), 2000, pp. 82-91.
32. É. Jacopin and J. Penon, "On the Path from Classical Planning to Arithmetic Constraint Satisfaction," Papers from the AAAI-2000 Workshop on Constraints and AI Planning, tech. report WS-00-02, AAAI Press, 2000, pp. 18-24.
33. R.P. Goldman et al., "MACBeth: A Multi-Agent Constraint-Based Planner," Papers from the AAAI-2000 Workshop on Constraints and AI Planning, tech. report WS-00-02, AAAI Press, 2000, pp. 11-17.
34. A. Nareyek, Constraint-Based Agents - An Architecture for Constraint-Based Modeling and Local-Search-Based Reasoning for Planning and Scheduling in Open and Dynamic Worlds, LNAI2062, Springer-Verlag, 2001.
35. J. Frank and A. Jónsson, "Constraint-Based Attribute and Interval Planning," Constraints, vol. 8, no. 4, 2003, pp. 339-364.
36. N. Hyafil and F. Bacchus, "Conformant Probabilistic Planning via CSPs," Proc. 13th Int'l Conf. Automated Planning and Scheduling (ICAPS 03), 2003, pp. 205-214.
37. A. Lopez and F. Bacchus, "Generalizing GraphPlan by Formulating Planning as a CSP," Proc. 18th Int'l Joint Conf. Artificial Intelligence (IJCAI03), 2003, pp. 954-960.
38. K. Currie and A. Tate, "O-Plan: The Open Planning Architecture," Artificial Intelligence, vol. 52, no. 1, 1991, pp. 49-86.
39. A. Tate, B. Drabble, and R. Kirby, "O-Plan2: An Open Architecture for Command, Planning, and Control," Intelligent Scheduling, M. Zweben and M.S. Fox, eds., Morgan Kaufmann, 1994, pp. 213-239.
40. A. Tate et al., "Using AI Planning Technology for Army Small Unit Operations," Poster Paper in Proc. 5th Int'l Conf. Artificial Intelligence Planning and Scheduling (AIPS 2000), 2000, pp. 379-386.
41. P. Laborie and M. Ghallab, "Planning with Sharable Resource Constraints," Proc. 14th Int'l Joint Conf. Artificial Intelligence (IJCAI 95), 1995, pp. 1643-1649.
42. N. Muscettola, "HSTS; Integrating Planning and Scheduling," Intelligent Scheduling, M. Zweben and M.S. Fox, eds., Morgan Kaufmann, 1994, pp. 169-212.
43. K. Erol, J. Hendler, and D.S. Nau, "UMCP: A Sound and Complete Procedure for Hierarchical Task Network Planning," Proc. 2nd Int'l Conf. AI Planning Systems (AIPS 94), 1994, pp. 249-254.
44. M. Paolucci, O. Shehory, and K. Sycara, "Interleaving Planning and Execution in a Multiagent Team Planning Environment," Electronic Trans. Artificial Intelligence, section A, no. 4, 2000, pp. 23-43; www.ep.liu.se/ej/etai/2000/003.
45. K. Erol, J. Hendler, and D.S. Nau, "HTN Planning: Complexity and Expressivity," Proc. 12th Nat'l Conf. Artificial Intelligence (AAAI 94), AAAI Press, 1994, pp. 1123-1128.
46. E.D. Sacerdoti, "The Nonlinear Nature of Plans," Proc. 4th Int'l Joint Conf. Artificial Intelligence (IJCAI 75), Morgan Kaufmann, 1975, pp. 206-214.
47. D. Wilkins, Practical Planning: Extending the Classical AI Planning Paradigm, Morgan Kaufmann, 1988.
48. S. Mittal and B. Falkenhainer, "Dynamic Constraint Satisfaction Problems," Proc. 8th Nat'l Conf. Artificial Intelligence (AAAI 90), AAAI Press, 1990, pp. 25-32.
49. P. Van Hentenryck, The OPL Optimization Programming Language, MIT Press, 1999.
50. P. Laborie, "Algorithms for Propagating Resource Constraints in AI Planning and Scheduling: Existing Approaches and New Results," Proc. 6th European Conf. Planning (ECP 01), 2001.
51. H.J. Levesque etl al, "GOLOG: A Logic Programming Language for Dynamic Domains," J. Logic Programming, vol. 31, nos. 1-3, 1997, pp. 59-83.
52. C. Boutilier et al., "Decision-Theoretic, High-Level Agent Programming in the Situation Calculus," Proc. 17th Nat'l Conf. Artificial Intelligence (AAAI00), AAAI Press, 2000, pp. 355-362.
53. A.L. Blum and M.L. Furst, "Fast Planning Through Planning Graph Analysis," Artificial Intelligence, vol. 90, nos. 1-2, 1997, pp. 281-300.
54. M.L. Ginsberg, "Do Computers Need Common Sense?" Proc. 5th Int'l Conf. Principles of Knowledge Representation and Reasoning (KR 96), 1996, pp. 620-626.
55. G. Verfaillie and T. Schiex, "Solution Reuse in Dynamic Constraint Satisfaction Problems," Proc. 12th Nat'l Conf. Artificial Intelligence (AAAI 94), AAAI Press, 1994, pp. 307-312.
56. M.H. Sqalli and B.C. Freuder, "Inference-Based Constraint Satisfaction Supports Explanation," Proc. 13th Nat'l Conf. Artificial Intelligence (AAAI 96), AAAI Press, 1996, pp. 318-325.
57. E.C. Freuder and R.J. Wallace, "Partial Constraint Satisfaction," Artificial Intelligence, vol. 58, nos. 1-3, 1992, pp. 21-70.
58. Z. Ruttkay, "Fuzzy Constraint Satisfaction," Proc. 3rd IEEE Int'l Conf. Fuzzy Systems, 1994, pp. 1263-1268.
59. S. Bistarelli et al., "Semiring-Based CSPs and Valued CSPs: Frameworks, Properties, and Comparison," Constraints, vol. 4, no. 3, 1999, pp. 199-240.
60. T. Walsh, "Stochastic Constraint Programming," Proc. 15th European Conf. Artificial Intelligence (ECAI02), 2002, pp. 111-115.
61. M. Yokoo, Distributed Constraint Satisfaction - Foundations of Cooperation in Multiagent Systems, Springer-Verlag, 2001.