The role of simulation in planning
Pages 530 - 533
Abstract
Theoretical work in automated planning research has shown that the popular methods used for doing automated planning either cannot be extended into real world domains, or are computationally intractable. This paper discusses the paradigm of simulation-based planning which attempts to overcome these difficulties. Simulation-based planning uses some simulation techniques to gather information for guiding the planner. The resulting system can handle more complex domains with much improved performance over previous systems, while making only a small compromise in completeness. Implemented systems are described.
References
[1]
Chapman, D., Planning for Conjunctive Goals, Artificial Inte.!ligence, vol 32 #3, (1987), pp. 333-378.
[2]
Dean, T., Firby, R.J., Miller, D.P., The FORBIN Paper, Yale University Department of Computer Science Technical Report RR#550, July, 1987.
[3]
Ernst, George W. and NewelI, Allen, GPS: a Case Study in Generality and Problem Solving, Academic Press, 1969.
[4]
Fikes, Richard and Nilsson, Nils J., STRIPS: A new approach to the applications of theorem proving to problem solving, Artificial Intelligence, 2 (197 I), pp. 189-208.
[5]
Fox, Mark S., Constraint-Directed Search: A Case Study of Job-Shop Scheduling, Technical Report CMU-RI-TR-83-22, CMU Robotics Institute, December 1983.
[6]
Graham, R.L., Lawler, E.L., Lenstra, J.K., J.K., Kan, A.H.G., Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey, Proc. of Disctrete Optimization 1977, Vancouver, B.C., Canada, August 1977.
[7]
Hanks, S., McDermott, D., Default Reasoning, Nonmonotonic Logics, and the Frame Problem, in Proceeding of the Fifth National Conference on Artificial Intelligence, AAAI, Philadelphia, PA, 1986.
[8]
Joslin, D.E., Roach, J.W., An Analysis of Conjunctive Goal Planning, Technical report TR-86-34, Virginia Tech Computer Science, 1986.
[9]
Korf, R., Learning to Solve Problems by Searching Jbr Macro-operators, Pittman Publishing, 1985.
[10]
Lowerre, B., The HARPY Speech Recognition System, Ph.D.Thesis, Carnegie-Mellon University, 1976.
[11]
Miller, D., Firby, R.J., Dean, T., Deadlines, Travel Time, and Robot Problem Solving, Proceedings of the Ninth International Joint Conference on Artificial intelligence, IJCAI, AAAI, Los Angeles, CA, August 1985, pp. 1052-1054.
[12]
Miller, D.P., Planning by Search Through Simulations, Yale University, Department of Computer Science, Research Report #423, October 1985.
[13]
Miller, D~P., A Plan Language for Dealing with the Physical World, Proceedings of the Third AnnuaI Computer Science Symposium on Knowledge Based Systems, Columbia, SC, March 1986.
[14]
Miller, D. P., A Task and Resource Scheduling System for Automated Planning, in The Annals of Operations Research: Approaches to {ntelIigent Decision Support, Jeroslow, R.G., editor, 1987.
[15]
Sacerdoti, Earl, A Structure for Plans and Behavior, American Elsevier Publishing Company, Inc., 1977.
[16]
Tate, Austin, Generating Project Networks, Proc. of the 5th Int. Joint Conf. on Artificial Intelligence, IJCAI, Cambridge Ma, U.S.A, August 1977, pp. 888-893.
[17]
Vere, Steven A. Planning in Time: Windows and Durartions for Activities and Goals, IEEE Trans. on Pattern Analysis and Machine Intelligence, PAMI-5/3 May (1983), pp. 246--267.
Index Terms
- The role of simulation in planning
Recommendations
Simulation and strategic planning: A case study effectiveness evaluation
ANSS '84: Proceedings of the 17th annual symposium on SimulationStrategic Planning, especially planning related to the long-term allocation of organizational resources, is a difficult and complex task. Particularly difficult is the allocation of field service resources with its multitude of variables and operating ...
Fast planning through planning graph analysis
IJCAI'95: Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2We introduce a new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure we call a Planning Graph. We describe a new planner, Graphplan, that uses this paradigm. Graphplan always returns a shortest-possible ...
Comments
Information & Contributors
Information
Published In
December 1987
963 pages
Copyright © 1987 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 December 1987
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 3,413 of 5,075 submissions, 67%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 167Total Downloads
- Downloads (Last 12 months)26
- Downloads (Last 6 weeks)2
Reflects downloads up to 26 Jul 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in