K.H. Sedighi,∗ T.W. Manikas,∗∗ K. Ashenayi,∗∗∗ and R.L. Wainwright∗∗∗∗


  1. [1] J.C. Latombe, Robot motion planning (Boston, USA: KluwerAcademic Publishers, 1991).
  2. [2] S.S. Ge, X. Lai, & A.A. Mamun, Boundary following andglobally convergent path planning using instant goals, IEEETransactions on Systems, Man and Cybernetics, Part B, 35(2),2005, 240–254.
  3. [3] C. Hocaoglu & A.C. Sanderson, Planning multiple paths withevolutionary speciation, IEEE Transactions on EvolutionaryComputation, 5(3), 2001, 169–191.
  4. [4] A. Howard, H. Seraji, & B. Werger, Global and regional pathplanners for integrated planning and navigation, Journal ofRobotic Systems, 22(12), 2005, 767–778.
  5. [5] R. Huq, G.K.I. Mann, & R.G. Gosine, Behavior-modulationtechnique in mobile robotics using fuzzy discrete event system,IEEE Transactions on Robotics, 22(5), 2006, 903–916.
  6. [6] E. Masehian & D. Sedighizadeh, Classic and heuristic ap-proaches in robot motion planning: A chronological review,Proc. World Academy of Science, Engineering and Technology,23, 2007, 101–106.
  7. [7] S.S. Ge & Y.J. Cui, New potential functions for mobilerobot path planning, IEEE Transactions on Robotics andAutomation, 16(5), 2000, 615–620.
  8. [8] Y.K. Hwang & N. Ahuja, Gross motion planning: A survey,ACM Computing Surveys, 24(3), 1992, 219–291.
  9. [9] J.Y. Hwang, J.S. Kim, S.S. Lim, & K.H. Park, A fast pathplanning by path graph optimization, IEEE Transactions onSystems, Man and Cybernetics, Part A, 33(1), 2003, 121–129.
  10. [10] B. Stilman, Network languages for complex systems, Computers& Mathematics with Applications, 26(8), 1993, 51–79.
  11. [11] R. Glasius, A. Komoda, & S.C.A.M. Gielen, Neural networkdynamics for path planning and obstacle avoidance, NeuralNetworks, 8(1), 1995, 125–133.
  12. [12] S.X. Yang & C. Luo, A neural network approach to completecoverage path planning, IEEE Transactions on Systems, Manand Cybernetics, Part B, 34(1), 2004, 718–724.
  13. [13] E.A. Antonelo, B. Schrauwen, & D. Stroobandt, Event detec-tion and localization for small mobile robots using reservoircomputing, Neural Networks, 21(6), 2008, 862–871.
  14. [14] A. Zou, Z. Hou, L. Zhang, & M. Tan, A neural network-based camera calibration method for mobile robot localizationproblems, Proc. 2nd International Symp. on Neural Networks,Chongquin, China, 2005, 277–284.
  15. [15] A. Alvarez, A. Caiti, & R. Onken, Evolutionary path planningfor autonomous underwater vehicles in a variable ocean, IEEEJournal of Oceanic Engineering, 29(2), 2004, 418–429.
  16. [16] M. Mitchell, An introduction to genetic algorithms (Cambridge,USA: MIT Press, 1996).
  17. [17] K. Sugihara & J. Smith, Genetic algorithms for adaptivemotion planning of an autonomous mobile robot, Proc. 1997IEEE International Symp. on Computational Intelligence inRobotics and Automation (CIRA ’97), Monterey, CA, 1997,138–143.
  18. [18] T. Geisler & T.W. Manikas, Autonomous robot navigationsystem using a novel value encoded genetic algorithm, 45thIEEE International Midwest Symp. on Circuits and Systems,Tulsa, OK, 2002, 45–48.
  19. [19] A. Hermanu, T.W. Manikas, K. Ashenayi, & R.L. Wainwright,Autonomous robot navigation using a genetic algorithm withan efficient genotype structure, in C.H. Dagli, A.L. Buczak,D.L. Enke, M.J. Embrechts, & O. Ersoy, (Eds.), Intelligentengineering systems through artificial neural networks: Smartengineering systems design: Neural networks, fuzzy logic,evolutionary programming, complex systems and artificial life,14 (New York: ASME Press, 2004), 319–324.
  20. [20] K.H Sedighi, K. Ashenayi, T.W. Manikas, R.L. Wainwright,& H.M. Tai, Autonomous local path planning for a mobilerobot using a genetic algorithm, Proc. 2004 IEEE Cong. on372Evolutionary Computation (CEC2004), Portland, OR, 2004,1338–1345.
  21. [21] P. Galiasso & R.L. Wainwright, A hybrid genetic algorithm forthe point to multipoint routing problem with single split paths,Proc. 2001 ACM Symp. on Applied Computing (SAC01), LasVegas, NV, 2001, 327–332.
  22. [22] D. Whitley, The genitor algorithm and selection pressure: Whyrank-based allocation of reproductive trials is best, Proc. 3rdInternational Conf. on Genetic Algorithms, Fairfax, VA, 1989,116–121.
  23. [23] P.W. Poon & J.N. Carter, Genetic algorithm crossover op-erators for ordering applications, Computers and OperationsResearch, 22(1), 1995, 135–147.

Important Links:

Go Back