Abstract
Optimization of expected values in a stochastic domain is common in real world applications. However, it is often difficult to solve such optimization problems without significant knowledge about the surface defined by the stochastic function. In this paper we examine the use of local search techniques to solve stochastic optimization. In particular, we analyze assumptions of smoothness upon which these approaches often rely. We examine these assumptions in the context of optimizing search heuristics for a planner/scheduler on two problem domains. We compare three search algorithms to improve the heuristic sets and show that the two chosen local search algorithms perform well. We present empirical data that suggests this is due to smoothness properties of the search space for the search algorithms.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bishop, 1995. Neural Networks for Pattern Recognition. Clarendon Press, Oxford.
Box, G.E.P., Draper, N. R. 1987. Empirical Model-Building and Response Surfaces. Wiley.
Chien, S., Gratch, J., Burl, M. 1995. “On the Efficient Allocation of Resources for Hypothesis Evaluation: A Statistical Approach.” In Proceedings of the IEEE Transactions on Pattern Analysis and Machine Intelligence 17(7), p. 652–665.
Chien, S., Stechert, A., Mutz, D. 1999. “Efficient Heuristic Hypothesis Ranking.” Journal ofArtificial Intelligence Research Vol 10: 375–397.
Chien, S., Rabideau, G., Knight, R., Sherwood, R., Engelhardt, B. Mutz, D., Estlin, T., Smith, B. Fisher, F., Barrett, T., Stebbins, G., Tran, D. 2000. “ASPEN-Automating Space Mission Operations using Automated Planning and Scheduling.” SpaceOps 2000, Toulouse, France.
Fink, E. 1998. “How to Solve it Automatically: Selection among Problem-Solving Methods.” In Proceedings of the Fifth International Conf.AI Planning Systems, 128–136.
Goldberg, D. 1989. Genetic Algorithms: In Search, Optimization and Machine Learning. Reading, Massachusetts: Addison-Wesley.
Gratch, J.M. and Chien, S. “Adaptive Problem-solving for Large Scale Scheduling Problems: A Case Study,” Journal of Artificial Intelligence Research Vol. 4 (1996), pp. 365–396.
Heckerman, David. 1996. A Tutorial on Learning with Bayesian Networks. MSR-TR-95-06, Microsoft Corporation.
Horvitz, E. 1988. “Reasoning under Varying and Uncertain Resource Constraints.” In Proceedings of the Seventh National Conference on Artificial Intelligence, 111–116.
Lin, S., and Kernighan, B. 1973. “An Effective Heuristic for the Traveling Salesman Problem,” Operations Research Vol. 21.
Minton, S. 1996. “Automatically Configuring Constraint Satisfaction Programs: A Case Study.” In Constraints 1:1(7-43).
Moore, A., Schneider, T., Boyan, J., Lee, M. S. 1998. “Q2: Memory-based Active Learning for Optimizing Noisy Continuous Functions. ” Proc. ICML 1998.
Russell, S., Norvig, P. 1995. Artificial Intelligence: A Modern Approach. Upper Saddle River, NJ: Prentice Hall.
Russell, S., Subramanian, D., Parr, R. 1993. “Provably Bounded Optimal Agents.” In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence.
Zhang, W., Deitterich, T.G., (1996). “High-Performance Job-Shop Scheduling With a Time-Delay TD(λ) Network Proc. NIPS 8, 1024–1030.
Zweben, M., Daun, Davis, E., and Deale, M. 1994. “Scheduling & Rescheduling with Iterative Repair.” In Intelligent Scheduling. Morgan Kaufmann. 241–256.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Engelhardt, B., Chien, S. (2001). Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment. In: Nareyek, A. (eds) Local Search for Planning and Scheduling. LSPS 2000. Lecture Notes in Computer Science(), vol 2148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45612-0_7
Download citation
DOI: https://doi.org/10.1007/3-540-45612-0_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42898-5
Online ISBN: 978-3-540-45612-4
eBook Packages: Springer Book Archive