Optimization Method of Agricultural Robot Path Planning in Complex Environment

被引:0
|
作者
Yin J. [1 ]
Dong W. [1 ]
Liang L. [1 ]
Xie W. [1 ]
Xiang Z. [1 ]
机构
[1] College of Mechanical Engineering, Zhejiang University of Technology, Hangzhou
关键词
Agricultural robot; Complex environment; Heuristic search; Optimal energy consumption; Path planning;
D O I
10.6041/j.issn.1000-1298.2019.05.002
中图分类号
学科分类号
摘要
Aiming at the problem that the mobile robot operating in complex outdoor environment reduced work completion rate due to energy limitation because of consume excessive energy when moving along the shortest paths on uneven terrains which often consisted of rapid elevation changes, an improved heuristic search algorithm called ECA* algorithm was proposed, which can optimize energy loss of the path when resources were limited. Firstly, the distance traveled and the energy lost by the robot were calculated by the establishment of robot distance-energy loss model, which can also evaluate the future path and the energy consumption trend. Then, the distance-energy loss model was brought into the heuristic cost function based on the traditional A* algorithm and the extended sub-node was searched for the optimal path. In each iteration process, the path at the disadvantage was eliminated by comparison to ensure the efficiency of the algorithm. Finally, the energy loss of different paths searched by the improved algorithm as well as the traditional A* algorithm was compared though the design of simulation experiment. The improved algorithm can reduce the energy consumption by 14.87% through the simulated calculation which verified the effectiveness of the improved algorithm. © 2019, Chinese Society of Agricultural Machinery. All right reserved.
引用
收藏
页码:17 / 22
页数:5
相关论文
共 23 条
  • [1] Huang Y., Liang L., Path planning algorithms of robots navigation system, Microcomputer Information, 22, 20, pp. 267-269, (2006)
  • [2] Huang J., Research on path planning of mobile robot, (2008)
  • [3] Van D.B.J.P., Overmars M.H., Roadmap-based motion planning in dynamic environments, IEEE Transactions on Robotics, 21, 5, pp. 885-897, (2005)
  • [4] Zamirian M., Kamyad A.V., Farahi M.H., A novel algorithm for solving optimal path planning problems based on parametrization method and fuzzy aggregation, Physics Letters A, 373, 38, pp. 3439-3449, (2009)
  • [5] Hart P.E., Nilsson N.J., Raphael B., A formal basis for the heuristic determination of minimum cost paths, ACM SIGART Bulletin, 4, 37, pp. 28-29, (1972)
  • [6] Wang X., Yang C., Wang J., Hierarchical voronoi diagram-based path planning among polygonal obstacles for 3D virtual worlds, IEEE International Symposium on VR Innovation, pp. 175-181, (2011)
  • [7] Cagigas D., Abascal J., Hierarchical Path Search with Partial Materialization of Costs for a Smart Wheelchair, (2004)
  • [8] Zhang H., Su Z., Hernandez D.E., Et al., Energy optimal path planning for mobile robots based on improved AD<sup>*</sup> algorithm, Transactions of the Chinese Society for Agricultural Machinery, 49, 9, pp. 19-26, (2018)
  • [9] Zhao D., Duan J., Chen P., Et al., Optimal path planning for 3D map based on A<sup>*</sup> algorithm, Computer Systems & Applications, 26, 7, pp. 146-152, (2017)
  • [10] Rowe N.C., Ross R.S., Optimal grid-free path planning across arbitrarily contoured terrain with anisotropic friction and gravity effects, IEEE Transactions on Robotics & Automation, 6, 5, pp. 540-553, (1990)