Multi-objective route planning approach for timely searching tasks of a supervised robot

Peng Liu, Guang Ming Xiong*, Yong Li, Yan Jiang, Jian Wei Gong

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

To performance efficient searching for an operator-supervised mobile robot, a multiple objectives route planning approach is proposed considering timeliness and path cost. An improved fitness function for route planning is proposed based on the multi-objective genetic algorithm (MOGA) for multiple objectives traveling salesman problem (MOTSP). Then, the path between two route nodes is generated based on the heuristic path planning method A*. A simplified timeliness function for route nodes is proposed to represent the timeliness of each node. Based on the proposed timeliness function, experiments are conducted using the proposed two-stage planning method. The experimental results show that the proposed MOGA with improved fitness function can perform the searching function well when the timeliness of the searching task needs to be taken into consideration.

Original languageEnglish
Pages (from-to)481-489
Number of pages9
JournalJournal of Beijing Institute of Technology (English Edition)
Volume23
Issue number4
Publication statusPublished - 1 Dec 2014

Keywords

  • Multi-objective genetic algorithm
  • Multiple objective optimization
  • Route planning
  • Supervised robots
  • Timeliness

Fingerprint

Dive into the research topics of 'Multi-objective route planning approach for timely searching tasks of a supervised robot'. Together they form a unique fingerprint.

Cite this

Liu, P., Xiong, G. M., Li, Y., Jiang, Y., & Gong, J. W. (2014). Multi-objective route planning approach for timely searching tasks of a supervised robot. Journal of Beijing Institute of Technology (English Edition), 23(4), 481-489.