Sunteți pe pagina 1din 4

2018 the International Conference of Intelligent Robotic and Control Engineering

The Exploration of the Trajectory Planning of Plant Protection Robot for Small
Planting Crops in Western Mountainous Areas

Ma Jiayi Sun Bugong


Gansu Agricultural University Gansu Agricultural University
The International Conference on Intelligent Robotics The International Conference on Intelligent Robotics
and Control Engineering and Control Engineering
Lanzhou, China Lanzhou, China
e-mail: 490779024@qq.com e-mail: 781525954@qq.com

Abstract—Based on the arrangement of crops in crop planting


in western China and the characteristics of single small area
planting, the working trajectory planning method for plant
protection robot in arid areas in western China is discussed.
First of all, the paper analyzes the distribution patterns of west
mountain characteristic planting crops; The motion path of the
robot is determined according to the arrangement form of crop
planting, and the working path of spray robot is simplified for
the postman. Finally, the ant colony algorithm was used to
solve the optimal spraying path, which provided some
technical support for the application and technical promotion
of agricultural robot in western hilly region.

Keywords-western; trajectory; plan; crops; plant protection


robot

Figure 1. The hills are planted with crops.


I. PREFACE
With the continuous development of agricultural
technology, the mechanization of agricultural planting has II. TWO BASIC PLANTING MODES OF SMALL-AREA
been basically realized in the alpine areas of western China. CROPS
As shown in Fig. 1, agricultural machinery use in western Due to the geographical nature, crop planting in the
China tends to be small, because crop cultivation in western western region is mostly in the form of small pieces of
China is mainly scattered in small areas. However, there are continuous cropping, as shown in Fig. 2.
many factors that are not conducive to safety when manually
operated agricultural equipment works in hilly areas.
Especially when it is necessary to spray pesticide for the
prevention and control of crop diseases and insect pests, it
will take more labor and time to transport agricultural
equipment to the field or carry spraying equipment into the
field manually. In addition, artificial spraying has obvious
randomness, which often leads to waste of pesticide,
excessive spraying of pesticide causes environmental
pollution, and people directly participate in long-term
operations. If the protection is not enough, inhaling more
pesticides may cause pesticide poisoning and seriously
damage the health of the body.
Therefore, it is of great significance to study and use the
small agricultural plant protection robot in western hilly area.
In view of the characteristics of small area planting of crops
in western regions, this paper proposes the application of Figure 2. Western crops were planted in succession.
small agricultural plant protection robot to realize
agricultural spraying work. In order to obtain the best Each small piece is mainly rectangular or approximately
spraying effect, a method to solve the trajectory planning of rectangular. According to the investigation, the arrangement
plant protection robot is proposed. method of crops planted in this small area is shown in Fig.

978-1-5386-7416-1/18/$31.00 ©2018 IEEE 42


3,in which the graph is based on a long side arrangement of curve algorithm is shown in Fig. 4. The algorithm is simple
planting form (horizontal configuration), the graph is based and easy to implement, which is suitable for simple robot
on the short side arrangement of planting form b trajectory planning. However, this kind of algorithm has a
(longitudinal configuration). great disadvantage in the case of strict requirement of
acceleration and high requirement of stability.

a. horizontal configuration
Figure 4. The ladder speed curve algorithm diagram

The second trajectory planning algorithm is the combined


polynomial velocity curve algorithm. The characteristics of
the algorithm is a common combination into a period of
polynomial function more speed curve of robot trajectory
planning implementation, which will be two quadratic
polynomial combination of s type curve is a typical feature
of the algorithm, can better solve problems of acceleration
mutation, planning result can achieve relatively satisfactory
degree.
The third is the higher order polynomial speed curve
algorithm. In the process of the algorithm, to ensure the
continuity of the acceleration curve, the algorithm USES a
higher order polynomial simulation of the speed curve, and
b. longitudinal configuration the main character of the algorithm is to have a high degree
Figure 3.Crop planting arrangement drawing. of accuracy in the movement of the robot, and the algorithm
brings in the complexity and the added conditions of the
The basic difference of crop arrangement in Fig. 3 is that calculation.
the number of turning points in the working trajectory of the For this reason, the work trajectory planning problem of
robot is different. It is generally believed that the lower the plant protection robot is simplified as follows: crop
number of turning points in the working trajectory of the arrangement is mainly in the mode of a graph, so as to
robot, the higher the working efficiency. reduce the number of turning points of the robot. The
The practice shows that in order to improve the stability problem of track connection between regional plantings can
of the robot, reduce the shock vibration and work noise, be simplified as postman problem [1].
improve the accuracy of the robot, and extend the service life
of the robot, a well-designed trajectory planning algorithm is III. THE SIMULATION ANALYSIS
needed. The first traditional trajectory planning algorithm is In order to improve the efficiency of plant protection
the trapezoidal velocity curve algorithm, which is the robot, the method of solving the shortest working trajectory
simplest planning algorithm. In the path planning of the of plant protection robot is adopted here, and ant colony
robot, the velocity change is divided into three stages [9]: algorithm [1-8] is selected to solve the problem, as shown in
The first stage: the starting value of the velocity v of the Fig. 5.
motion is 0 and increases to a constant value at a certain rate. The nature of ant colony algorithm is a parallel
The second stage: the running speed of this stage is algorithm [9-15].The search process of each ant is
constant, and the speed curve is shown as a horizontal line. independent from each other in the process of performing the
The third stage: speed from the constant value to zero, calculation, and communication is realized between the ants
the speed curve of a downward sloping straight line. through pheromones. It can be seen that ant colony algorithm
Therefore, the speed curve shape of the trapezoid velocity can be regarded as a distributed multi-agent system.

43
In the process of calculation, the algorithm starts to In the fourth step, ant x USES tabu table to record all the
conduct independent solution search at the same time in current positions in the process of movement, so as to
multiple points of the problem space, which strengthens the improve the calculation efficiency.
reliability of the algorithm and makes the algorithm have As the understanding and searching of solution space
strong global search ability. Therefore, it has been used and becomes regular, it gradually approaches and finally reaches
studied by many scholars. the global optimal solution.
In the process of robot trajectory planning, the
parameters to be considered in general are as follows: time,
distance, speed, addition and subtraction speed and impact
vibration. The third parameter can be obtained by knowing
any two parameters: time, distance and speed. The practice
shows that the combination of path and time is superior to
time segmentation and displacement segmentation.
In general, the path and time of evaluation parameters
are defined as follows [9]:
(1) Distance refers to the fact that when the parameter
coordinates of the first and last two points are known, the
shorter the planned distance is, the shorter the actual
movement path of the corresponding robot will be. Therefore,
when evaluating algorithms, which algorithm has the
shortest path is the basis of evaluation.
(2) Time refers to the sum of time for the robot to
complete the known trajectory in the known trajectory
planning. The shorter the planning time, the shorter the time
for the robot to reach the designated point, and the higher the Figure 5. Trajectory of cloud.
efficiency of the robot to complete the task. Therefore, it is
necessary to evaluate which algorithm has the shortest The initial population size was 100, pheromone volatility
planning time for the same planning track. factor was 0.5, the number of iterations was 100, pheromone
(3) The speed of addition and subtraction refers to that intensity factor was 1, departure intensity factor was 5,
in the known trajectory planning, the better the continuity of pheromone intensity factor was 1, pheromone volatility
the set speed change, the more stable the robot will walk, and coefficient was 0.5, initial coordinates (86mm,56.9mm), and
the smaller the rigid impact. Therefore, the continuity of termination coordinates (78.9mm,66mm). The optimal
velocity change rate of which algorithm is the best indicator trajectory length is 711.1691mm.
to evaluate the algorithm, that is, the continuity of the
acceleration curve. IV. CONCLUSION
(4) Impact vibration refers to that in the known To simplify the trajectory of the link between the small
trajectory planning, the better the set continuity of plots of the western hill farm and the small piece of the field
acceleration change, the smaller the flexible impact of the to the postman problem, using the ant colony algorithm to
robot. Therefore, for the same segment trajectory planning, solve the problem of the trajectory planning of the arbor
the continuity of acceleration rate of which algorithm is the robot technology to the western regions of the western region,
best indicator to evaluate the algorithm, that is, the continuity it provides a certain technical reference to the applications of
of jump curve. the agricultural robots in the agricultural area and the
Because of the small scale of farming in the hills and technology of the implantation robot.
the main form of farming, it is necessary to solve the
problem of the sequence and the connection between the REFERENCES
small piece of the growing area, and the ant colony algorithm [1] Lifa Z, Zhao D, Ji W, et al. Trajectory optimization of spray gun for
can do a good job of solving the problem of the sequence spraying robot based on improved genetic algorithm [J]. Journal of
and the way of connecting to the path, so the algorithm is agricultural mechanization, 2008, 12:160-162.
using the algorithm to work out the optimal work path of the [2] Licui M, Gong J, Niuwan C, etc. Spray robot trajectory combination
robot [16-19]. optimization based on improved ant colony algorithm of recorded
The basic algorithm idea is as follows [4]. cloud model [J]. Journal of Shanghai jiaotong university, 2015, 49(3):
388-391.
In the first step, several ants are randomly placed at
[3] Hexue J, Wang J, Luguo D, et al. Robot image rendering sequence
different starting points; optimization based on ant colony algorithm [J]. Journal of zhejiang
The second step sets the initial time to 0 and determines university, 2015, 49(6): 1140-1145.
the pheromone value on each motion path; [4] Zhao D, Qi L. Research on uav 3d trajectory planning based on ant
The third step is to select the path motion of any ant x colony - particle swarm fusion algorithm [J]. Journal of jilin
according to the information element quantity; university of chemical technology, 2007,34(03):93-98.

44
[5] Zhaokai X, Wei Y, Wang D. Research on improving ant colony [12] Zhulin H. A study on path planning of agricultural information
algorithm in path planning of mobile robot [J]. Computer acquisition robot based on ant colony algorithm [D]. Northeast
measurement and control, 2014, 22(11): 3725-3725. forestry university,2017.
[6] Tang B, Wangxi H, Liu F. Path planning of search robot based on [13] Zhutie X, Donggui J, Yanbing X, Guokai M, Xiexue G, Guozhi Q.
improved ant colony algorithm [J]. Journal of jilin university, 2014, Study on path planning of agricultural robots based on improved ant
44(4): 1063-1068. colony algorithm [J]. Agricultural mechanization
[7] Lihao Y, Lumei B. A 3d spatial path search algorithm based on research,2016,38(09):48-52.
improved ant colony optimization algorithm [J]. Journal of northwest [14] Zhou B, Qian L, Meng Z, Daixian Z. Path sequencing optimization of
university of technology, 2014, 32(4): 564-567. spraying robot based on ant colony algorithm [J]. Computer
[8] Qu H, Huangli W, Ke X. Research on robot path planning based on engineering,2012,38(01):192-194+207.
improved ant colony algorithm in dynamic environment [J]. Journal [15] Chen W, Zhaode A, Pingxiang Y. Path planning of spraying robot
of university of electronic science and technology, 2015, 44(2): 261- gun based on ant colony algorithm [J]. Mechanical design and
265. manufacturing,2011(07):67-69.
[9] Jiang H. Research on stacking robot trajectory planning algorithm [D]. [16] Chen W, Zhaode A, Lifa Z. Trajectory optimization and test of
Shanghai jiaotong university,2014. spraying robot gun with complex curved surface [J]. Journal of
[10] Zhaohong C, Guojia L, Xuxiao J, Diaoshao W. Research on trajectory agricultural machinery,2011,42(01):204-208.
planning of mobile robot based on fuzzy ant colony algorithm [J]. [17] Fanzhen Q, Kongwei Z. Industrial robot simulation and trajectory
Computer simulation, 2008,35(05):318-321. planning [J]. Shanxi electronics technology,2018(01):42-44+64.
[11] Chenshun L. Path optimization and track tracking of agricultural [18] Xue L, Zhou J. Visual servo control of picking arm of agricultural
robot -- based on genetic algorithm [J]. Agricultural mechanization robot in parallel [J]. Sensor and micro system, 2007,36(05):123-126.
research,2017,39(08):17-21. [19] Gao J, Li H, Miaozhong H, Hanke L. Research and design of seedling
recognition system based on agricultural robot vision [J]. Industrial
control computer,2017,30(09):103-104+106.

45

S-ar putea să vă placă și