Adaptive evolutionary planner/navigator for mobile robots

  • Authors:
  • Jing Xiao;Z. Michalewicz;Lixin Zhang;K. Trojanowski

  • Affiliations:
  • Dept. of Comput. Sci., North Carolina Univ., Charlotte, NC;-;-;-

  • Venue:
  • IEEE Transactions on Evolutionary Computation
  • Year:
  • 1997

Quantified Score

Hi-index 0.00

Visualization

Abstract

Based on evolutionary computation (EC) concepts, we developed an adaptive evolutionary planner/navigator (EP/N) as a novel approach to path planning and navigation. The EP/N is characterized by generality, flexibility, and adaptability. It unifies off-line planning and online planning/navigation processes in the same evolutionary algorithm which 1) accommodates different optimization criteria and changes in these criteria, 2) incorporates various types of problem-specific domain knowledge, and 3) enables good tradeoffs among near-optimality of paths, high planning efficiency, and effective handling of unknown obstacles. More importantly, the EP/N can self-tune its performance for different task environments and changes in such environments, mostly through adapting probabilities of its operators and adjusting paths constantly, even during a robot's motion toward the goal