Abstract
Recently, there has been an increasing interest in applying evolutionary computation to path planning [15]. To date, these evolutionary path planners have been single agent planners. In real-world environments where the knowledge of obstacles is naturally distributed, it is possible for single agent path planners to become overwhelmed by the volume of information needed to be processed in order to develop accurate paths quickly in non-stationary environments. In this paper, a new adaptive replacement strategy (ARS) is presented that allows steady-state evolutionary path planners to search efficiently in non-stationary environments. We compare this new ARS with another ARS using a test suite of 5 non-stationary path planning problems. Both of replacement strategies compared in this paper work by allowing an influx of diversity rather than increasing mutation rates. We refer to this influx of diversity as hyper-diversity.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brown, D. E., Huntley, C. L., and Spillane, A. R. (1989). A Parallel Genetic Heuristic for the Quadratic Assignment Problem, Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 406–415.
Cobb, H. G. (1990). An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments, NRL Memorandum Report 6760.
Cobb, H. G., and Grefenstette, J. J. (1993). Genetic Algorithms for Tracking Changing Environments, Proceedings of the Fifth International Conference on Genetic Algorithms, pp.523–530.
Dozier, G. (2000). Distributed Steady-State Neuro-Evolutionary Path Planning in Non-Stationary Environments Using Adaptive Replacement, to appear in: Proceedings of GECCO-2000.
Eshelman, L. J. and Shaffer, J. D. (1993). Real-Coded Genetic Algorithms and Interval-Schemata, in Foundations of Genetic Algorithms II, pp. 187–202, ed. L. Darrell Whitley, Morgan Kaufman Publishers.
Goldberg, D. E. and Smith, R. E. (1987). Nonstationary Function Optimization Using Genetic Dominance and Diploidy, Proceedings of the Second International Conference on Genetic Algorithms, pp. 59–68.
Grefenstette, J. J. (1992). Genetic Algorithms for Changing Environments, Proceedings of Parallel Problem Solving from Nature-PPSN II, pp.137–144.
Jang, J.-S. R., Sun, C.-T. and Mizutani, E. (1997). Neuro-Fuzzy and Soft Computing: A Computational Approach to Learning and Machine Intelligence, Prentice Hall.
Michalewicz, Z. (1994). Genetic Algorithms + Data Structures = Evolution Programs, 2nd Edition, Springer-Verlag.
Potter, M.A., De Jong, K.A., and Grefenstette, J.J. (1995). A Coevolutionary Approach to Learning Sequential Decision Rules, Proceedings of the 6th International Conference on Genetic Algorithms, pp. 366–372.
Sarma, J. and De Jong, K. (1999). The Behavior of Spatially Distributed Evolutionary Algorithms in Non-Stationary Environments, Proceedings the 1999 Genetic and Evolutionary Computation Conference (GECCO-99), pp. 572–578.
Smith, J. E., and Vavak, F. (1999). Replacement Strategies in Steady-State Genetic Algorithms: Dynamic Environments, The Journal of Computing and Information Technology — CIT, vol. 7 no. 1, pp. 49–59.
Vavak, F., Fogarty, T. C, and Jukes, K. (1996). A Genetic Algorithm with Variable Range of Local Search for Tracking Changing Environments, Proceedings of Parallel Problem Solving from Nature — PPSN IV, pp. 376–385.
Vavak, F. and Fogarty, T.C. (1996). Comparison of Steady State and Generational Genetic Algorithms for Use in Nonstationary Environments, Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pp. 192–195.
Xiao, J., Michalewicz, Z., Zhang, L., and Trojanowski, K. (1997). Adaptive Evolutionary Planner/Navigator for Mobile Robots, IEEE Transactions on Evolutionary Computation, pp. 18–28, Vol. 1, No. 1, April 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dozier, G. (2000). Steady-State Evolutionary Path Planning, Adaptive Replacement, and Hyper-Diversity. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_55
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_55
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive