A rough set GA-based hybrid method for robot path planning
- 124 Downloads
In this paper, a hybrid method based on rough sets and genetic algorithms, is proposed to improve the speed of robot path planning. Decision rules are obtained using rough set theory. A series of available paths are produced by training obtained minimal decision rules. Path populations are optimised by using genetic algorithms until the best path is obtained. Experiment results show that this hybrid method is capable of improving robot path planning speed.
KeywordsRough sets genetic algorithms robot path planning
Unable to display preview. Download preview PDF.
- J. Yu, K. Valeri, Z. Sun, N. Hiroyuki. Fast algorithm for path planning based on neural networks. Robots, vol. 23, no. 3, pp. 201–205, 2001.Google Scholar
- Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data. Nowowiejska, Warsaw, Poland, pp. 15–19, 1990.Google Scholar
- H. D. Zhang, R. Zheng, Y.W. Chen. Present situation and future development of mobile robot path planning technology. Journal of System Simulation, vol. 17, no. 2, pp. 439–443, 2005.Google Scholar
- M. Inuiguchi, T. Tanino. Generalized rough sets and rule extraction. In Proceedings of the 3rd International Conference on Rough Sets and Current Trends in Computing, RSCTC 2002, Malvern, PA, USA, vol. 14–16, pp. 105–112, 2002.Google Scholar
- D. Goldberg. Genetic Algorithms in Search, Optimisation and Machine Learning. Addison-Wesley, New York, USA, pp. 1–25, 1989.Google Scholar
- D. Beasley, R. D. Bull, R. Ralph. An overview of genetic algorithms. University Computing, vol. 15, no. 2, pp. 58–69 and vol. 15, no. 4, pp. 170–181, 1993.Google Scholar
- X. Xu, Y. Chen. A method for trajectory planning of robot manipulators in Cartesian space. In Proceedings of the 3rd World Congress on Intelligent Control and Automation, Indianapolis, USA, IEEE Press, vol. 28, pp. 1220–1225, 2000.Google Scholar