Plannìng-Based Control of Software Agents

Proceedings of the 3rd Artificial Intelligence Planning Systems Conference, AIPS 1996

Volumn , Issue , 1996, Pages 268-274

  Weld, Daniel S ^a  

^a University of Washington   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (73)

1. Allen, J.; Hendler, J.; and Tate, A., eds. 1990. Readings in Planning. San Mateo, CA: Morgan Kaufmann.
2. Ambros-Ingerson, J., and Steel, S. 1988. Integrating plaaining, execution, and monitoring. In Proc. 7th Nat. Conf. on A.I., 735-740.
3. Barrett, A., and Weld, D. 1994a. Partial order planning: Evaluating possible cfiBciencv gains. Artificial Intelligence 67(1):71 112.
4. Barrett, A., and Weld, D. 1994b. Task-decomposition via plan parsing. In Proc. 12th Nat. Conf. on A.I. Available via F T P from pub/ai/ at ftp.CS.Washington.edu.
5. Currie, K., and Tate, A. 1991. 0-plan: the open planning architecture. Artificial Intelligence 52(1):49-86.
6. Dent, L.; Boticario, J.; McDcrmott, J.; Mitchell, T.; and Zabowski, D. 1992. A personal learning apprentice. In Proc. 10th Nat. Conf. on A.I., 96-103.
7. Doorenbos, B.; Etzioni, O.; and Weld, D. 1996. A scalable comparison-shopping agent for the worldwide web. Technical Report 96-01-03, University of Washington, Department of Computer Science and Engineering. Available via F T P from pub/ai/ at ftp.CS.Washington.edu.
8. Draper, D.; Hanks, S.; and Weld, D. 1994. Probabilistic planning with information gathering and contingent execution. In Proc. 2nd Intl. Conf. on A.I. Planning Systems.
9. Etzioni, O., and Weld, D. 1994. A softbot-based interface to the internet. CACM 37(7):72-76. See http://www.CS.Washington.edu/research/softbots.
10. Etzioni, O.; Hanks, S.; Weld, D.; Draper, D.; Lesh, N.; and Williamson, M. 1992. An Approach to Planning with Incomplete Information. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning. San Francisco, CA: Morgan Kaufmann. Available via F T P from pub/ai/ at ftp.es.Washington.edu.
11. Etzioni, O.; Golden, K.; and Weld, D. 1994. Tractable closed-world reasoning with updates. In Proc. Ąth Int. Conf. on Principles of Knowledge Representation and Reasoning, 178 189. San Francisco, C A: Morgan Kaufmann.
12. Etzioni, O. 1993a. Intelligence without robots (a reply to brooks). AI Magazine 14(4). Available via anonymous F T P from pub/etzioni/softbots/ at CS.Washington.edu.
13. Etzioni, O. 1993b. Acquiring search-control knowledge via static analysis. Artificial Intelligence 62(2):255-302.
14. Etzioni, 0. 1993c. A structural theory of explanation-based learning. Artificial Intelligence 60(1):93-140. Firby, R. J. 1987. An investigation into reactive planning in complex domains. In Proc. 6th Nat. Conf on A.I., 202-206.
15. Friedman, M., and Weld, D. 1996. Least-commitment action selection. In Proc. 3rd Intl. Conf. on A.I. Planning Systems.
16. Ginsberg, M., ed. 1987. Readings in Nonmonotonic Reasoning. San Mateo, CA: Morgan Kaufmann. Golden, K.; Etzioni, 0.; and Weld, D. 1994. Omnipotence without omniscience: Sensor management in planning. In Proc. 12th Nat. Conf on A.I., 1048¬ 1054. Menlo Park, CA: AAAI Press.
17. Golden, K.¡ Etzioni, 0.; and Weld, D. 1996. Planning with execution and incomplete information. Technical Report 96-01-09, University of Washington, Department of Computer Science and Engineering. Available via F T P from pub/ai/ at ftp.cs.washington.edu.
18. Haddawy, P., and Hanks, S. 1992. Representations for Decision-Theoretic Planning: Utility Functions for Dealine Goals. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning.
19. Hanks, S., and Weld, D. S. 1995. A domain-independent algorithm for plan adaptation. Journal of Artificial Intelligence Research 319-360. Available via F T P from pub/ai/ at ftp.cs.washington.edu.
20. Ihrig, L., and Kambhampati, R. 1994. Derivation replay for partial-order planning. In Proc. 12th Nat. Conf. on A.I.
21. Jaffar, J.; Michaylov, S.¡ Stuckey, P.; and Yap, R. 1992. The CLP(7l) Language and System. ACM lYansactions on Programming Languages and Systems 14(3):339-395.
22. Joslin, D., and Pollack, M. 1994. Least-cost flaw repair: A plan refinement strategy for partial-order planning. In Proc. 12th Nat. Conf. on A.I.
23. Joslin, D.. and Pollack, M. 1995. Passive and active decision postponement in plan generation. In Proc. 2nd European Planning Workshop.
24. Kambhampati, S., and Chen, J. 1993. Relative utility of E B G based plan reuse in partial ordering vs. total ordering planning. In Proc. 11th Nat. Conf. on A.I.
25. Kambhampati, S.; Knoblock, C; and Yang, Q. 1995. Planning as refinement search: A unified framework for evaluating design tradeoíFs in partial order planning. Artificial Intelligence 76:167-238.
26. Karloff, H. 1991. Linear Programming. Boston: Birkhäuser.
27. Kautz, H., and Sleman, B. 1996. Pushing the envelope: Planning, propositional logic, and stochastic search. Personal Communication.
28. Kautz, H.; Selman, B.; Coen, M.; Ketchpel, S.; and Ramming, C. 1994. An experiment in the design of software agents. In Proc. ISth Nat. Conf. on A.I.
29. Knoblock, C, and Levy, A., eds. 1995. Working Notes of the AAAI Spring Symposium on Information Gathering from Heterogeneous, Distributed Environments. Stanford University: AAAI Press. To order a copy, contact sss@aaai.org.
30. Knoblock, C; Arens, Y.; and Hsu, C.-N. 1994. Cooperating agents for information retrieval. In Proceedings of the Second International Conference on Cooperative Information Systems.
31. Knoblock, C. 1990. Learning abstraction hierarchies for problem solving. In Proc. 8th Nat. Conf on A.I., 923-928.
32. Knoblock, C. A. 1995. Planning, executing, sensing, and replanning for information gathering. In Proc. 15th Int. Joint Conf. on A.I.
33. Krebsbach, K.; Olawsky, D.; and Gini, M. 1992. An empirical study of sensing and defaulting in planning. In Proc. 1st Intl. Conf. on A.I. Planning Systems, 136-144.
34. Krulwich, B. 1995. Bargain finder agent prototype. Technical report, Anderson Consulting, http://bf.estar.ac.com/bf/.
35. Kushmerick, N.; Hanks, S.; and Weld, D. 1995. An Algorithm for Probabilistic Planning. Artificial Intelligence 76:239-286.
36. Kwok, C, and Weld, D. 1996. Planning to gather information. Technical Report 96-01-04, University of Washington, Department of Computer Science and Engineering. Available via F T P from pub/ai/ at ftp.CS.Washington.edu.
37. Kwok, C; Goan, T.¡ Etzioni, O.; and Weld, D. 1995. Simon user guide. Technical report. University of Washington, http://www.CS.Washington.edu/homes/ctkwok/ s imon-manual.html.
38. Laird, J.; Newell, A.; and Rosenbloom, P. 1987. SOAR: An architecture for general intelligence. Artificial Intelligence 33(1).
39. Levy, A. Y.; Srivastava, D.; and Kirk, T. 1995. Data model and query evaluation in global information systems. Journal of Intelligent Information Systems, Special Issue on Networked Information Discovery and Retrieval 5 (2).
40. Maes, P., and Kozierok, R. 1993. Learning interface agents. In Proceedings of AAAI-93.
41. Maes, P. 1994. Agents that reduce work and information overload. Comm. of the ACM 37(7):31-0, 146.
42. McAUester, D., and Rosenblitt, D. 1991. Systematic nonlinear planning. In Proc. 9th Nat. Conf on A.I., 634-639.
43. Minton, S.; Carbonell, J. G.; Knoblock, C. A.; Kuokka, D. R.; Etzioni, O.; and Gil, Y. 1989. Explanation-based learning: A problem-solving perspective. Artificial Intelligence 40:63-118. Available as technical report CMU-CS-89-103.
44. Minton, S. 1990. Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence 42(2-3).
45. Moore, R. 1985. A Formal Theory of Knowledge and Action. In Hobbs, J., and Moore, R., eds., Formal Theories of the Commonsense World. Norwood, N J: Ablex.
46. Morgenstern, L. 1987. Knowledge preconditions for actions and plans. In Proceedings of IJCAI-87, 867¬ 874.
47. Olawsky, D., and Gini, M. 1990. Deferred planning and sensor use. In Proceedings, DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control. Morgan Kaufmann.
48. Pednault, E. 1989. A D L: Exploring the middle ground between STRIPS and the situation calculus. In Proc. 1st Int. Conf on Principles of Knowledge Representation and Reasoning, 324-332.
49. Penberthy, J., and Weld, D. 1992.UCPOP: A sound, complete, partial order planner for A D L. In Proc. 3rd Int. Conf. on Principles of Knowledge Representation and Reasoning, 103-114. Available via F T P from pub/ai/ at ftp.cs.washington.edu.
50. Penberthy, J., and Weld, D. 1994. Temporal planning with continuous change. In Proc. 12th Nat. Conf. on A.L
51. Penberthy, J. 1993. Planning with Continuous Change. Ph.D. Dissertation, University of Washington. AvaUable as UW C S E Tech Report 93-12-01.
52. Peot, M., and Smith, D. 1992. Conditional Nonlinear Planning. In Proc. 1st Intl. Conf. on A.I. Planning Systems, 189-197.
53. Peot, M., and Smith, D. 1993. Threat-removal strategies for partial-order planning. In Proc. 11th Nat. Conf. on A.I., 492-499.
54. Perkowitz, M., and Etzioni, O. 1995. Category translation: Learning to understand information on the internet. In Proc. 15th Int. Joint Conf. on A.I.
55. Rajaraman, A.; Sagiv, Y.; and Ullman, J. 1995. Answering queries using templates with binding patterns. In Principles of Database Systems.
56. Schubert, L., and Gerevini, A. 1995. Accelerating partial order planners by improving plan and goal choices. I n Proceedings of the 7th IEEE Int. Conference on Tools vHth Artificial Intelligence.
57. Selberg, E., and Etzioni, O. 1995. Multi-Service Search and Comparison Using the MetaCrawler. In Proc. 4th World Wide Web Conf, 195-208. See http://www.CS.Washington.edu/research/ metacrawler.
58. Shakes, J.; Langheinrich, M.; and Etzioni, O. 1996. Ahoy: The home page finder. Technical report. University of Washington. See http://www.cs.Washington.edn/research/ahoy.
59. Smith, D., and Peot, M. 1993. Postponing threats in partial-order planning. In Proc. 11th Nat. Conf. on A.I., 500-506.
60. Smith, D., and Peot, M. 1996. Suspending recurison in causal link planning. In Proc. 3rd Intl. Conf on A.I. Planning Systems.
61. Stefik, M. 1981a. Planning and meta-planning (MOL-G E N: Part 2). Artificial Intelligence 14(2):141-169.
62. Stefik, M. 1981b. Planning with constraints (MOL¬ G E N: Part 1). Artificial Intelligence 14(2):111 -139.
63. Tate, A. 1977. Generating project networks. In Proc. 5th Int. Joint Conf. on A.I., 888-893.
64. Ullman, J. 1988. Database and knowledge-base systems. In Database and knowledge-base systems, volume 1. Computer Science Press.
65. Ullman, J. 1989. Database and knowledge-base systems. In Database and knowledge-base systems, volume 2. Computer Science Press.
66. Veloso, M. 1994. Flexible strategy learning: Analogical replay of problem solving episodes. In Proc. 12th Nat. Conf on A.I., 595-00.
67. Weld, D., and Etzioni, O. 1994. The first law of robotics (a call to arms). In Proc. 12th Nat. Conf. on A.I. Available via F T P from pub/ai/ at ftp.es.Washington.edu.
68. Weld, D. 1994. An introduction to least-commitment planning. AI Magazine 27-61. Available via F T P from p u b / a i / at ftp.cs.washington.edu.
69. Wilkins, D. 1988a. Causal reasoning in planning. Computational Intelligence 4(4):373-380.
70. Wilkins, D. E. 1988b. Practical Planning. San Mateo, CA: Morgan Kau&iann.
71. Wilkins, D. 1990. Can AI planners solve practical problems? Computational Intelligence 6(4):232-246.
72. Williamson, M., and Hanks, S. 1994. Optimal planning with a goal-directed utility model. In Proc. 2nd Intl. Conf. on A.I. Planning Systems.
73. Williamson, M., and Hanks, S. 1996. Flaw selection strategies for value-directed planning. In Proc. 3rd Intl. Conf. on A.I. Planning Systems.