Real-Time Parametric Path Planning Algorithm for Agricultural Machinery Kinematics Model Based on Particle Swarm Optimization

• Published in: Agriculture (Basel) Vol. 13; no. 10; p. 1960
• Main Authors: Xu, Lihong, You, Jiawei, Yuan, Hongliang
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.10.2023
• Subjects: Agricultural equipment; Agricultural equipment and supplies industry; Agricultural technology; Agriculture; Algorithms; Efficiency; Energy consumption; Farm machinery; Farmworkers; Kinematics; kinematics model; Labor force; Mathematical optimization; Moving obstacles; Objective function; Obstacle avoidance; Optimization algorithms; Parametric equations; Particle swarm optimization; Path planning; path planning algorithm; Path tracking; Real time; Robots; Tracking control; unmanned agricultural machinery; unmanned farm
• ISSN: 2077-0472; 2077-0472
• DOI: 10.3390/agriculture13101960

In order to meet the obstacle avoidance requirements of unmanned agricultural machinery in operation, it is necessary to plan a path to avoid obstacles in real time after obstacles are detected. However, the traditional path planning algorithm does not consider kinematic constraints, which makes it difficult to realize the plan, thus affecting the performance of the path tracking controller. In this paper, a real-time path planning algorithm based on particle swarm optimization for an agricultural machinery parametric kinematic model is proposed. The algorithm considers the agricultural machinery kinematic model, defines the path satisfying the kinematic model through a parametric equation, and solves the initial path through the analytic method. Then, considering the constraints of obstacles, acceleration, and turning angle, two objective functions are proposed. The particle swarm optimization algorithm is used to search the path near the initial path which satisfies the obstacle avoidance condition and has a better objective function value. In addition, the influence of the algorithm parameters on the running time is analyzed, and the method of compensating the radius of the obstacle is proposed to compensate the influence of the discrete time on the obstacle collision detection. Finally, experimental results show that the algorithm can plan a path in real time that avoids any moving obstacles and has a better objective function value.