ANALYSIS ON PATH OPTIMIZATION OF AGRICULTURAL HANDLING ROBOTS BASED ON ANT COLONY-IMPROVED ARTIFICIAL POTENTIAL FIELD METHOD-Reference-Cited by-同舟云学术

ANALYSIS ON PATH OPTIMIZATION OF AGRICULTURAL HANDLING ROBOTS BASED ON ANT COLONY-IMPROVED ARTIFICIAL POTENTIAL FIELD METHOD

Published:2023-12-31 Issue: Volume: Page:548-557
ISSN:2068-2239
Container-title:INMATEH Agricultural Engineering
language:en
Short-container-title:INMATEH

Author:

CHU Hexia¹

Affiliation:

1. Department of Mathematics Education, Zhumadian Preschool Education College, Zhumadian, Henan, China

Abstract

Aiming at the problems of low efficiency and slow function convergence of the ant colony algorithm in path planning of agricultural transport robots, a fusion algorithm combined with the artificial potential field method was proposed. Firstly, the function of each parameter was analyzed according to the mathematical model of the traditional ant colony algorithm, followed by the simulation analysis of the optimal parameters through grid map modeling in MATLAB and data recording. Secondly, the deficiency of the classical artificial potential field method in agriculture, i.e., it could not arrive at the endpoint or realize local locking, was improved by introducing the intermediate point and the relative distance of the target. Finally, the features of the two algorithms were combined and the improved artificial potential field method was integrated with the traditional ant colony algorithm so that the improved artificial potential field method could play a dominant role in the initial path planning stage of agricultural transport robots while the ant colony algorithm exerted the main effect in the later stage with the increase in the pheromone concentration. It was verified through simulation analysis, it was verified that the fusion algorithm of ant colony algorithm and improved artificial potential field method outperforms traditional ant colony algorithm in terms of farthest path, optimal path, running time, and iteration number.

Publisher

INMA Bucharest-Romania

Subject

Industrial and Manufacturing Engineering,Mechanical Engineering,Food Science

Reference22 articles.

1. Ames B, Beveridge A, Carlson R, Djang C, Isler V, Ragain S, Savage M., (2015), A leapfrog strategy for pursuit-evasion in a polygonal environment, International Journal of Computational Geometry and Applications, vol. 25, no. 2, ISSN 0218-1959, pp. 77-100, Singapore;

2. Das P. K, Behera H. S, Das S, Tripathy H. K, Panigrahi B. K, Pradhan S. K., (2016), A hybrid improved PSO-DV algorithm for multi-robot path planning in a clutter environment, Neurocomputing, vol. 207, ISSN 0925-2312, pp. 735-753, Netherlands;

3. Duan W, Gu J, Wen M, Zhang G, Ji Y, Mumtaz S., (2020), Emerging technologies for 5G-IoV networks: applications, trends and opportunities, IEEE Network, vol. 34, no. 5, ISSN 0890-8044, pp. 283-289, United States;

4. Javidrad F, Nazari M., (2017), A new hybrid particle swarm and simulated annealing stochastic optimization method, Applied Soft Computing, vol. 60, ISSN 1568-4946, pp. 634-654, Netherlands;

5. Kyaw P. T, Paing A, Thu T. T, Mohan R. E, Le A. V, Veerajagadheswar P., (2020), Coverage path planning for decomposition reconfigurable grid-maps using deep reinforcement learning based travelling salesman problem, IEEE Access, vol. 8, ISSN 2169-3536, pp. 225945-225956, United States;