A rough set GA-based hybrid method for robot path planning

  • Cheng-Dong WuEmail author
  • Ying Zhang
  • Meng-Xin Li
  • Yong Yue


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.


Rough sets genetic algorithms robot path planning 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    K. Sugibara, J. Smith. Genetic algorithms for adaptive motion planning of an autonomous mobile robot. In Proceedings of 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation, Hawaii, HI, USA, IEEE Press, pp. 138–143, 1997.CrossRefGoogle Scholar
  2. [2]
    H. Surmann, J. Huser, J. Wehking. Path planning for a fuzzy controlled autonomous mobile robot. In Proceedings of the 5th IEEE International Conference on Fuzzy Systems, St.Augustin, Germany, IEEE Press, vol. 8–11, pp. 1660–1665, 1996.CrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    Z. Pawlak. Rough Sets: Theoretical Aspects of Reasoning about Data. Nowowiejska, Warsaw, Poland, pp. 15–19, 1990.Google Scholar
  5. [5]
    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
  6. [6]
    T. Shibata, T. Fukuda. Intelligent motion planning by genetic algorithm with fuzzy critic. In Proceedings of the 8th IEEE International Symposium on Intelligent Control, Tsukuba, Japan, IEEE Press, vol. 25–27, pp. 565–570, 1993.CrossRefGoogle Scholar
  7. [7]
    T. Ozyer, R. Alhajj, K. Barker. Utilizing rough sets and multi-objective genetic algorithms for automated clustering. In Proceedings of 4th International Conference on Rough Sets and Current Trends in Computing, RSCTC 2004, Uppsala, Sweden, vol. 1–5, pp. 567–572, 2004.MathSciNetGoogle Scholar
  8. [8]
    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
  9. [9]
    Z. Cai, Z. Peng. Cooperative coevolutionary adaptive genetic algorithm in path planning of cooperative multi-mobile robot systems. Journal of Intelligent and Robotic Systems, vol. 33, no. 1, pp. 61–71, 2002.CrossRefGoogle Scholar
  10. [10]
    D. Goldberg. Genetic Algorithms in Search, Optimisation and Machine Learning. Addison-Wesley, New York, USA, pp. 1–25, 1989.Google Scholar
  11. [11]
    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
  12. [12]
    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

Copyright information

© Institute of Automation, Chinese Academy of Sciences 2006

Authors and Affiliations

  • Cheng-Dong Wu
    • 1
    Email author
  • Ying Zhang
    • 1
  • Meng-Xin Li
    • 1
  • Yong Yue
    • 2
  1. 1.Shenyang Jianzhu UniversityShenyangPRC
  2. 2.University of LutonLutonUK

Personalised recommendations