首页 | 本学科首页   官方微博 | 高级检索  
     


Multi-objective route planning approach for timely searching tasks of a supervised robot
Authors:LIU Peng  XIONG Guang-ming  LI Yong  JIANG Yan and GONG Jian-wei
Affiliation:School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China;School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China;School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China;School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China;School of Mechanical Engineering, Beijing Institute of Technology, Beijing 100081, China
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.
Keywords:multiple objective optimization  multi-objective genetic algorithm  supervised robots  route planning  timeliness
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《北京理工大学学报(英文版)》浏览原始摘要信息
点击此处可从《北京理工大学学报(英文版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号