Adding memory to the Evolutionary Planner/Navigator

The integration of evolutionary approaches with adaptive memory processes is emerging as a promising new area for research and practical applications. In this paper, we report our study on adding memory to the Evolutionary Planner/Navigator (EP/N), which is an adaptive planning/navigation system for mobile robots based on evolutionary computation. Preliminary results from our experiments demonstrate the potential of such extension to EP/N in improving planning effectiveness in partially-known environments.

[1]  Arthur C. Sanderson,et al.  Planning multi-paths using speciation in genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[2]  Yoram Koren,et al.  The vector field histogram-fast obstacle avoidance for mobile robots , 1991, IEEE Trans. Robotics Autom..

[3]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[4]  El-Ghazali Talbi,et al.  The "Ariadne's clew" algorithm: global planning with local methods , 1993, Proceedings of 1993 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS '93).

[5]  Ronald C. Arkin,et al.  Motor Schema — Based Mobile Robot Navigation , 1989, Int. J. Robotics Res..

[6]  Zbigniew Michalewicz,et al.  Evolutionary navigator for a mobile robot , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  Vladimir J. Lumelsky,et al.  A comparative study on the path length performance of maze-searching and robot motion planning algorithms , 1991, IEEE Trans. Robotics Autom..

[8]  Alfred M. Bruckstein,et al.  Two-dimensional robot navigation among unknown stationary polygonal obstacles , 1993, IEEE Trans. Robotics Autom..

[9]  Zbigniew Michalewicz,et al.  Evolutionary Computation: One Project, Many Directions , 1996, ISMIS.

[10]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..