Path Planning for On-Farm Machinery in Rectangular Fields using Genetic Algorithm
Introduction Today, most of the agricultural machines for doing agricultural operations and covering the entire farm, must move in the farm, and travel a certain distance without doing anything useful. Common agricultural machines are controlled by human beings using habits, machinery models, and pe...
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | article |
| Lenguaje: | EN FA |
| Publicado: |
Ferdowsi University of Mashhad
2018
|
| Materias: | |
| Acceso en línea: | https://doaj.org/article/b8e36ad54dd648c4a0e750774b05d4e9 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Introduction Today, most of the agricultural machines for doing agricultural operations and covering the entire farm, must move in the farm, and travel a certain distance without doing anything useful. Common agricultural machines are controlled by human beings using habits, machinery models, and personal experiences without using computer-based tools. This trend leads to repetitive patterns and affect farm efficincy. Therefore, applying optimization techniques in determining the optimum pattern and track for on-farm machinery would be very effective. One of the main problems of conventional movement patterns on farms is the time wasted on moving towards the end of the field, which will have a big impact on field efficiency. The purpose of this study is to reduce the useless distance traveled by agricultural machines using genetic algorithm while moving on the farm and going from one track to the next, and, consequently, increase farm efficiency. Materials and Methods In this study, the rectangle farm that was 80 meters wide and had an arbitrary length was selected for simulation, and different types of turning methods were tested. The calculations and simulation were based on genetic algorithm using the MATLAB 2013 software. In this case, the minimum traveled distance was set as solution evaluation criterion. The solutions were applied and simulated according to these assumptions: Each gene was considered a track number, and the algorithm’s chromosomes were produced by connecting all the tracks to each other,. The width of each track was considered equal to the width of the machine, and based on reproduction parameters such as population size and the number of repetitions, a percentage of the children were produced through point intersection and another percentage were produced through mutation. In determining the distance between the tracks, Ω or T or U were used for two adjacent tracks, U was used for two tracks that had a track between them, and a longer U was used for tracks that had more than one track between them. Based on the number of the initial population, the chromosomes that were supposed to be parents at the beginning were selected. The children produced new population was created and the above steps were repeated. During the last repetition, the best child chromosome was introduced as the answer. In order to calculate the effects of different methods of turning on the non-working distance covered during agricultural operations, the non-working distance traveled during 5 orders of movement, including 4 traditional orders (continuous, spiral, all-around, and blocked) and 1 smart order were compared to each other. In the continuous pattern, because movement continues in the next track at the end of each track, all the turnings are inevitably done in the Ω way, and thus a greater distance is travelled compared to the U way. In the spiral pattern, the distance travelled in turnings between different tracks on the farm is equal. In the all-around pattern, movements are done from the sides and the operation is concluded at the center of the farm; therefore, the long U method of movement is used at the end of all the tracks, and Ω turning is used for the last track at the center of the farm. In the blocked pattern, the farm is devided into two or more blocks, and the all-around movement pattern is used in each block as an independent farm. In the smart movement pattern, the beginning and ending of the agricultural operations are considered in the vicinity of the hypothetical road which, in addition to facilitating access to the road, had a significant impact on reducing the useless distance traveled on the farm. Results and Discussion The final optimum pattern was compared to traditional patterns in the form of charts. The optimum pattern of movement which uses smart genetic algorithm and avoids long turning methods (such as, Ω and T) leads to reduced wasted time and distance traveled by agricultural machines and increased field efficiency and also, decreasing the non-working traveled distance and waste time approximately, 45 % and 47 % respectively. This is due to avoiding turning methods of Ω and T (compared to the U method). Also, the fatigue resulting from these approaches and their wasted time is greater than U method used in the genetic algorithm pattern. Conclusions The optimum pattern of movement which uses smart genetic algorithm was compared to conventional patterns that showed significant saving in non- working distance and waste time in farm. This optimum pattern can be implemented in automatic navigation but there is the possibility of its implementation by operators in common navigation. |
|---|