Abstract
This paper proposes a novel Genetic Algorithms (GAs) approach for a near-optimal path planning of a mobile robot in a greenhouse. The chromosome encoding features in inverse proportion between research spaces of GAs and complexity of obstacles. The fitness evaluation is designed for both incomplete and complete paths to guide the evolutional direction. The crossover and mutation operators are trimmed to he path planning problem. Two operators were presented to promote the effectiveness of evolution of problem-specific GAs. The simulation results obtained is satisfactory.
Chapter PDF
Similar content being viewed by others
5. References
Sugihara, K. et al. (1997). Genetic Algorithms for Adaptive Motion Planning of an autonomous Mobile Robot, Proceedings of the IEEE international Symposium on Computational Intelligence in Robotics and Automation, pp. 138–146.
Gemeinder, M. et al. (2003), GA-based path planning for mobile robot systems employing an active search algorithm, Applied Soft Computing Journal, (3), p 149–158.
Gihan, N. et al. (2004), Path planning for a mobile robot using genetic algorithms, Proceedings of ICEEC’04, p 185–189.
Wang, K. (2005), Applied Computational Intelligence to Intelligence Manufacturing Systems, Advanced Knowledge International (ISBN 0-9751004-9-1).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 International Federation for Information Processing
About this paper
Cite this paper
Liu, X., Yuan, J., Wang, K. (2006). A Problem-Specific Genetic Algorithm for Path Planning of Mobile Robot in Greenhouse. In: Wang, K., Kovacs, G.L., Wozny, M., Fang, M. (eds) Knowledge Enterprise: Intelligent Strategies in Product Design, Manufacturing, and Management. PROLAMAT 2006. IFIP International Federation for Information Processing, vol 207. Springer, Boston, MA . https://doi.org/10.1007/0-387-34403-9_28
Download citation
DOI: https://doi.org/10.1007/0-387-34403-9_28
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-34402-7
Online ISBN: 978-0-387-34403-4
eBook Packages: Computer ScienceComputer Science (R0)