[go: up one dir, main page]

WO2021135336A1 - Cluster job task assignment method and device for plant-protection unmanned aerial vehicles - Google Patents

Cluster job task assignment method and device for plant-protection unmanned aerial vehicles Download PDF

Info

Publication number
WO2021135336A1
WO2021135336A1 PCT/CN2020/113196 CN2020113196W WO2021135336A1 WO 2021135336 A1 WO2021135336 A1 WO 2021135336A1 CN 2020113196 W CN2020113196 W CN 2020113196W WO 2021135336 A1 WO2021135336 A1 WO 2021135336A1
Authority
WO
WIPO (PCT)
Prior art keywords
matrix
plant protection
time
unmanned aircraft
protection unmanned
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/CN2020/113196
Other languages
French (fr)
Chinese (zh)
Inventor
薛新宇
徐阳
孙竹
顾伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Research Institute for Agricultural Mechanization Ministry of Agriculture
Original Assignee
Nanjing Research Institute for Agricultural Mechanization Ministry of Agriculture
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing Research Institute for Agricultural Mechanization Ministry of Agriculture filed Critical Nanjing Research Institute for Agricultural Mechanization Ministry of Agriculture
Priority to AU2020416827A priority Critical patent/AU2020416827B2/en
Publication of WO2021135336A1 publication Critical patent/WO2021135336A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06NCOMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00Computing arrangements based on biological models
    • G06N3/12Computing arrangements based on biological models using genetic models
    • G06N3/126Evolutionary algorithms, e.g. genetic algorithms or genetic programming
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations

Definitions

  • the invention relates to the technical field of plant protection unmanned aerial vehicle cluster operation, in particular to a plant protection unmanned aerial vehicle cluster operation task allocation method and device.
  • Plant protection drones are characterized by fast, high efficiency, and wide adaptability. They are flexible in operation and do not require take-off and landing tracks. They can adapt to complex terrain such as hills, mountains, slopes, and paddy fields. In recent years, they have developed rapidly in China and have accumulated annual operating area. It has exceeded 500 million mu times.
  • the plant protection drone is limited by the load of the machine (less than 20kg).
  • the operating area of a single sortie is generally not more than 30 acres.
  • the machine needs to waste 40% of the operating time for frequent take-off and landing, battery replacement and Add pesticides.
  • Some companies and scientific research teams have carried out research on the operation technology of one control and multiple machines.
  • the current research work is mainly concentrated on network communication and system hardware development. The most representative one is Guangzhou Jifei Technology Co., Ltd. in 2019.
  • the P-30XP plant protection drone was launched, and the T-20 plant protection drone launched by DJI in 2019 supports one person to control two or more machines at the same time.
  • the purpose of the present invention is to provide a method and device for planting and protecting unmanned aircraft cluster operation task allocation.
  • the two constraints of time and energy consumption are integrated to establish a two-layer decision of the shortest flight distance and optimal time allocation. Methods to reduce time conflicts and improve work efficiency.
  • the present invention proposes a planting protection unmanned aerial vehicle cluster task assignment method.
  • the assignment method includes the following steps:
  • the operation field is divided into N subfields.
  • Each subfield has the same operation requirements and corresponds to only one drone.
  • All subfields are allocated to all plant protection drones participating in the operation according to a preset allocation principle.
  • the preset allocation principle is: a single plant protection drone is allocated at least one subfield, and each subfield Can only be allocated once and all subfields are allocated;
  • the preset assembly rule is that after each UAV landed, assembly tasks including battery replacement and medicine box replacement are performed, but there is only one assembly task at the same time.
  • An unmanned aircraft performs assembly tasks;
  • step S1 the process of dividing the operation field into N subfields according to the input field parameters and plant protection drone parameters includes the following steps:
  • step S1 the allocation of all subfields to all plant protection drones participating in the operation according to the preset allocation principle refers to:
  • the assignment matrix of plant protection UAV is defined as (X) K ⁇ N , where the assignment parameter x ij is defined as:
  • j 1, 2, 3,...,N.
  • step S1 in step S3, the process of using the MOSELA algorithm to find the optimal job allocation matrix (X) K ⁇ N includes the following steps:
  • X b and X w are the best individual and the worst individual of the sub-group, respectively;
  • X g and X w are the best individual and the worst individual of the entire ethnic group, respectively;
  • rand(X) means that a decision matrix is randomly generated in the feasible solution space
  • n is the length of the array z
  • ri(n) represents any integer in the interval [1,n]
  • represents the column number ri(n) specified by z'to modify the element of X 1 in the column Keep consistent with the arrangement of B elements
  • switch (r 1 , r 2 ) represents the r 1 row and r 2 row in the switching matrix
  • swicth (c 1 , c 2 ) represents the c 1 column and c 2 column in the switching matrix
  • step S1 in step S33, the process of group division includes the following steps:
  • wd 1 is the relative parameter of flying operation distance
  • wd 2 is the operation time difference parameter
  • f 1 , f 2 and f 3 represent the UAV allocation, operation distance and operation time adaptation value respectively;
  • the fitness value of the individual is used as a reference for the division of the ethnic group, and the individuals in the i-th subgroup are arranged in descending order according to the size of FV 1 t .
  • the individuals in the i-th subgroup are:
  • i 1, 2, 3,...,s.
  • step S1 in step S34, the process of internal evolution of the ethnic group includes the following steps:
  • r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged.
  • switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged.
  • step S1 in step S35, the process of the first ethnic merging includes the following steps:
  • r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged.
  • switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged.
  • step S4 the process of defining the operation sequence matrix (SE) N ⁇ 1 of the subfield includes the following steps:
  • j 1, 2, 3,..., N;
  • S42 Define the operation sequence matrix of the field as (SE) N ⁇ 1 , and se j is a set of non-repeated integers in the interval [1,N];
  • step S5 the process of using genetic algorithm to optimize the operation sequence matrix (SE) N ⁇ 1 of the subfield includes the following steps:
  • g(SE t ) max[tl KN′ (SE t ,c)]; t represents the position of the chromosome in the population; wt is the time fitness parameter, the unit is min, and the value range is [300,600];
  • the roulette method is used to select the initial population. If the fitness of an individual t is f t , the probability of the individual being selected is expressed as P t :
  • N represents the size of the chromosome
  • Partial matching crossover method is adopted for crossover operation of chromosomes: two crossover points are randomly generated, and a matching segment is determined; two child individuals are generated according to the mapping relationship between the matching segment and the non-matching segment in the parent body;
  • the chromosome is updated based on the GA algorithm to obtain the optimal subfield operation sequence matrix (SE) N ⁇ 1 , including the following sub-steps:
  • S531 input the population size N, the maximum number of evolutionary iterations max (Gen), the crossover rate p c , and the mutation rate p m ;
  • S534 Judge the following conditions for stopping genetic calculation: (1) The number of iterations reaches max(Gen), (2) the fitness value requirement is met, and (3) the best chromosome is maintained for 10 consecutive generations; if any one of the conditions is met, Terminate the iterative process, and output the optimal individual ⁇ SE ⁇ max(f)
  • the allocation device includes an ARM embedded system, and a GPS positioning system, a temperature and humidity sensor, and a computer connected to the ARM embedded system.
  • the temperature and humidity sensor is used to detect the real-time temperature and real-time humidity of the work area, and feedback the detection result to the ARM embedded system;
  • the LCD touch screen is used to input field parameters and plant protection drone parameters to the ARM embedded system, and the field parameters include the boundary coordinates of each field;
  • the ARM embedded system combines the input field parameters and plant protection UAV parameters, as well as the environmental information fed back by the temperature and humidity sensor, and uses the aforementioned distribution method to jointly settle out all plant protection UAV coordinated task assignment models and corresponding
  • the plant protection unmanned aircraft cluster operation scheduling plan the scheduling method is sent to the flight control system of each plant protection unmanned aircraft through the data transmission module, and the input parameters and the corresponding scheduling method are stored in the buffer module;
  • the power supply module is used to provide the power required for normal operation of the ARM embedded system, GPS positioning system, temperature and humidity sensor, data transmission module, power supply module, LCD touch screen and cache module;
  • the GPS positioning system is used to obtain the position information of each plant protection unmanned aircraft, and display the obtained position information to the user through the LCD touch screen.
  • Fig. 1 is a flow chart of the task allocation method for plant protection unmanned aircraft cluster operations according to the present invention.
  • Fig. 2 is a flow chart of the allocation method according to the first embodiment of the present invention.
  • Fig. 3 is a schematic diagram of the process of dividing the work field according to the present invention.
  • Figure 4 is a flowchart of finding the optimal job allocation matrix (X) K ⁇ N based on MOSFLA.
  • Figure 5 is a schematic diagram of chromosome crossover preparation.
  • Figure 6 is a schematic diagram of the completion of chromosome crossover.
  • Figure 7 is a schematic diagram of the chromosome mutation process.
  • Fig. 8 is a flowchart of optimizing the operation sequence matrix (SE) N ⁇ 1 of the subfield block using genetic algorithm.
  • Figure 9 is a schematic structural diagram of a plant protection unmanned aircraft cluster operation task allocation device.
  • Fig. 10 is a schematic diagram of the target operation field of the plant protection unmanned aircraft in the third embodiment.
  • Fig. 11 is a schematic diagram of the preprocessing method of the target operation field in the third embodiment.
  • FIG. 12 is a schematic diagram of the comparison of the operation results of the third embodiment.
  • the present invention proposes a method for distributing tasks for planting protection unmanned aircraft cluster operations.
  • the distributing method includes the following steps:
  • the operation field is divided into N subfields.
  • Each subfield has the same operation requirements and corresponds to only one drone.
  • All subfields are allocated to all plant protection drones participating in the operation according to a preset allocation principle.
  • the preset allocation principle is: a single plant protection drone is allocated at least one subfield, and each subfield It can only be allocated once and all subfields are allocated.
  • the preset assembly rule is that after each UAV landed, assembly tasks including battery replacement and medicine box replacement are performed, but there is only one assembly task at the same time. An unmanned aircraft performs assembly tasks.
  • a single plant protection drone can be allocated to multiple fields ( ⁇ N), but each field can only be allocated once.
  • the assignment matrix of plant protection UAV operation is defined as (X) K ⁇ N , where the assignment parameter x ij is defined as
  • each field can only be operated once and all fields are allocated to the plant protection unmanned aircraft.
  • the distance matrix for entering/exiting the field is (L 1 ) K ⁇ N , (L 2 ) K ⁇ N , using MOSFLA
  • the algorithm finds the optimal assignment matrix for (X) K ⁇ N .
  • the hybrid leapfrog algorithm can realize the update of the population.
  • the definition of the way of population update is as follows.
  • Definition 3(X 1 )′ F(B, ⁇ ), which is based on the difference matrix B (ie ), update the matrix X to the matrix B. Count the element sum of each column of B, if the element sum>0, save the column number in the one-dimensional array z.
  • the operator ⁇ is defined as:
  • n is the length of the array z
  • ri(n) represents any integer in the interval [1,n]
  • represents: the column number ri(n) specified by z'(ie cut(z,ri(n)))
  • the element correction of X 1 in this column is consistent with the arrangement of B elements.
  • switch (r 1 , r 2 ) represents the r 1 row and r 2 row in the switching matrix
  • swicth (c 1 , c 2 ) represents the c 1 column and c 2 column in the switching matrix
  • X b and X w are the best individual and the worst individual of the sub-group, respectively.
  • X g and X w are the best individual and the worst individual of the entire ethnic group, respectively.
  • rand(X) means that a decision matrix is randomly generated in the feasible solution space.
  • the resulting new entity may have the problem of aircraft not being allocated to the field (i.e. ).
  • the present invention introduces mutation operators as follows to perform mutation processing on partial solutions:
  • r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged.
  • switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged.
  • the fitness value function FV 1 of an individual t is defined as follows,
  • wd 1 is the relative parameter of the flying operation distance
  • wd 2 is the operation time difference parameter
  • f 1 , f 2 and f 3 represent the UAV allocation, the operation distance and the operation time adaptation value respectively, and each is defined as follows,
  • w represents the ratio of energy loss during load flight and non-load flight.
  • x ij , And t ij are the elements of the matrices (X) K ⁇ N , (L 1 ) K ⁇ N , (L 2 ) K ⁇ N and (T) K ⁇ N , respectively.
  • the present invention uses the fitness value of an individual as a reference for the classification of ethnic groups. According to the size of FV 1 t , arrange in descending order, then the individuals in the i-th subgroup are respectively,
  • i 1, 2, 3,...,s.
  • the time matrix after sorting is defined as its for,
  • the landing time matrix of the drone is defined as (TL) K ⁇ N'
  • the take-off time matrix is (TR) K ⁇ N' , tl ij′ and tr ij′ are respectively:
  • the present invention optimizes the operation sequence through the GA algorithm.
  • the present invention takes the work sequence (SE) N ⁇ 1 as the chromosome.
  • SE work sequence
  • the final landing time tl KN' of different plant protection drones can be determined, and the fitness value selection function FV 2 of the chromosome can be defined. defined as,
  • g(SE t ) max[tl KN′ (SE t ,c)]; t represents the position of the chromosome in the population; wt is the time fitness parameter (min), with a value range of [300,600].
  • the roulette method is used to select the initial population. If the fitness of an individual t is f t , the probability of the individual being selected can be expressed as P t :
  • N represents the size of the chromosome.
  • the partial matching crossover method (PMX, Partially Matched Crossover) is used to perform the crossover operation of chromosomes: two crossover points are randomly generated, and a matching segment is determined; according to the mapping relationship between the matching segment and the non-matching segment in the parent body Generate two sub-individuals. For example, there are two parents as follows, assuming that the randomly generated matching segment is [4,6], and the repeated numbers are marked with *. Based on the intermediate mapping relationship, the number of the repeated part can be determined.
  • the initial value of the first * in the font A1 is 1, the cross-occurring 1 originates from 6, and the 6 participates in the cross, its initial value is 5, and 5 no longer participates in the cross ,
  • the first * appearing in A1 can be assigned the value 5; in the same way, the second * appearing in A1 can be assigned the value 4. In the same way, complete the assignment at subbody B1*.
  • the conditions for the chromosome to stop genetic calculation in the present invention are: 1 Iterate to max(Gen) times, and the algorithm is terminated; 2 Meet the fitness value requirement, and the algorithm is terminated; 3 The optimal chromosome is continuously maintained for 10 generations, and the algorithm is terminated.
  • the GA-based chromosome update process is shown in Figure 8.
  • the allocation device includes an ARM embedded system, and a GPS positioning system and a temperature control system respectively connected to the ARM embedded system.
  • the temperature and humidity sensor is used to detect the real-time temperature and real-time humidity of the work area, and feedback the detection result to the ARM embedded system.
  • the LCD touch screen is used to input field parameters and plant protection drone parameters to the ARM embedded system, and the field parameters include the boundary coordinates of each field.
  • the ARM embedded system combines the input field parameters and plant protection UAV parameters, as well as the environmental information fed back by the temperature and humidity sensor, and uses the aforementioned distribution method to jointly settle out all plant protection UAV coordinated task assignment models and corresponding
  • the scheduling scheme of plant protection unmanned aircraft cluster operation is sent to the flight control system of each plant protection unmanned aircraft through the data transmission module, so that the flight control system controls the equipment to perform the cluster operation according to the received instructions and input parameters And the corresponding scheduling method are stored in the cache module.
  • the power supply module is used to provide the power required for normal operation of the ARM embedded system, GPS positioning system, temperature and humidity sensor, data transmission module, power supply module, LCD touch screen and buffer module.
  • the GPS positioning system is used to obtain the position information of each plant protection unmanned aircraft, and display the obtained position information to the user through the LCD touch screen.
  • the present invention selects the target multi-field block with a total area of 330 mu as shown in Figures 10 and 11 below.
  • the selected plant protection UAV has a maximum flight time of 25min and a drug load of 15L. Based on the UAV re-division of the multi-field block in Figure 10, the results of the division are shown in Figure 11.
  • the area of the 22 subfields divided is ⁇ 15 mu to ensure that the plant protection drones can complete the spraying operation in one sortie.
  • the take-off/landing area of the unmanned aircraft is located near the center of the field, and this area also meets the requirements of facilitating take-off and transportation of liquid medicine batteries.
  • the maximum distance between the planes is 100m to ensure that the assembly work of the liquid medicine and battery is completed within the specified time.
  • the present invention compares the following two traditional multi-aircraft operation modes:
  • Unmanned aircraft have certain operating fields, and each aircraft has a fixed operating sequence.
  • the MOSFAL+GA algorithm can save up to 25 minutes.
  • the efficiency and total time of unmanned aircraft cluster operation are shown in Figure 12.

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Physics & Mathematics (AREA)
  • Economics (AREA)
  • Strategic Management (AREA)
  • Theoretical Computer Science (AREA)
  • Biophysics (AREA)
  • Life Sciences & Earth Sciences (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Health & Medical Sciences (AREA)
  • General Physics & Mathematics (AREA)
  • Operations Research (AREA)
  • Evolutionary Biology (AREA)
  • Tourism & Hospitality (AREA)
  • Quality & Reliability (AREA)
  • General Business, Economics & Management (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Bioinformatics & Cheminformatics (AREA)
  • Bioinformatics & Computational Biology (AREA)
  • Development Economics (AREA)
  • Artificial Intelligence (AREA)
  • Evolutionary Computation (AREA)
  • Genetics & Genomics (AREA)
  • Educational Administration (AREA)
  • Biomedical Technology (AREA)
  • Computational Linguistics (AREA)
  • Data Mining & Analysis (AREA)
  • Physiology (AREA)
  • General Health & Medical Sciences (AREA)
  • Molecular Biology (AREA)
  • Computing Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • Feedback Control In General (AREA)
  • Traffic Control Systems (AREA)

Abstract

A cluster job task assignment method for plant-protection unmanned aerial vehicles, comprising: dividing an job field into N sub-fields; assigning all the sub-fields to all plant-protection unmanned aerial vehicles participating in operation according to a preset assignment principle; using a MOSFLA algorithm to find an optimal job assignment matrix; determining a job time matrix of the sub-fields according to the optimal job assignment matrix and an aircraft job time matrix to define a job sequence matrix of the sub-fields in combination with a preset assembly rule; and optimizing the job sequence matrix of the sub-fields by using a genetic algorithm. The method can integrate two constraint conditions, i.e., time and energy consumption, while ensuring full coverage of air routes, to establish a double-layer decision-making method having the shortest flight distance and optimal time allocation, thereby reducing time conflicts and improving the operation efficiency.

Description

一种植保无人飞机集群作业任务分配方法和装置A method and device for distributing tasks for planting and protecting unmanned aircraft cluster operation 技术领域Technical field

本发明涉及植保无人机集群作业技术领域,具体而言涉及一种植保无人飞机集群作业任务分配方法和装置。The invention relates to the technical field of plant protection unmanned aerial vehicle cluster operation, in particular to a plant protection unmanned aerial vehicle cluster operation task allocation method and device.

背景技术Background technique

植保无人机具有快速、高效、适应性广等显著特点,其作业灵活,无需起降跑道,可以适应丘陵、山区、坡地、水田等复杂地形,近年来在中国得到迅速发展,年累积作业面积已超过5亿亩次。Plant protection drones are characterized by fast, high efficiency, and wide adaptability. They are flexible in operation and do not require take-off and landing tracks. They can adapt to complex terrain such as hills, mountains, slopes, and paddy fields. In recent years, they have developed rapidly in China and have accumulated annual operating area. It has exceeded 500 million mu times.

但植保无人机受机具载重量的限制(低于20kg),单架次作业面积一般不超过30亩,在实际作业过程中,机具需浪费40%的作业时间用于频繁起降、更换电池和加注农药。为了提高作业效率,部分企业和科研团队开展了一控多机的作业技术研究,目前的研究工作主要集中在组网通讯和系统硬件开发,其中最具代表性的为广州极飞科技公司2019年推出了P-30XP型植保无人机,大疆创新公司2019年推出的T-20型植保无人机,支持一人控制两台以上机具同时作业。但其作业路径规划方式较为单一,将田块按照机具的作业能力进行简单划分,各个机具采用各自独立的航线进行排序作业。只考虑全覆盖路径规划,很少考虑机具间的协同与配合,在实际作业中易产生起降冲突和任务分配不合理的情况。However, the plant protection drone is limited by the load of the machine (less than 20kg). The operating area of a single sortie is generally not more than 30 acres. In the actual operation process, the machine needs to waste 40% of the operating time for frequent take-off and landing, battery replacement and Add pesticides. In order to improve operational efficiency, some companies and scientific research teams have carried out research on the operation technology of one control and multiple machines. The current research work is mainly concentrated on network communication and system hardware development. The most representative one is Guangzhou Jifei Technology Co., Ltd. in 2019. The P-30XP plant protection drone was launched, and the T-20 plant protection drone launched by DJI in 2019 supports one person to control two or more machines at the same time. However, its operation path planning method is relatively simple, and the fields are simply divided according to the operating capabilities of the equipment, and each equipment uses its own independent route for sorting operations. It only considers full coverage path planning, and rarely considers coordination and cooperation between machines and tools. In actual operations, it is easy to cause take-off and landing conflicts and unreasonable task assignments.

发明内容Summary of the invention

本发明目的在于提供一种植保无人飞机集群作业任务分配方法和装置,在保证航路全覆盖的基础上,综合时间和能耗两个约束条件,建立最短飞行距离和最优时间分配双层决策方法,降低时间冲突、提高作业效率。The purpose of the present invention is to provide a method and device for planting and protecting unmanned aircraft cluster operation task allocation. On the basis of ensuring full coverage of the route, the two constraints of time and energy consumption are integrated to establish a two-layer decision of the shortest flight distance and optimal time allocation. Methods to reduce time conflicts and improve work efficiency.

为达成上述目的,结合图1,本发明提出一种植保无人飞机集群作业任务分配方法,所述分配方法包括以下步骤:In order to achieve the above-mentioned purpose, in conjunction with Fig. 1, the present invention proposes a planting protection unmanned aerial vehicle cluster task assignment method. The assignment method includes the following steps:

S1,根据输入的田块参数和植保无人飞机参数,将作业田块划分成N个子田块,每个子田块的作业要求相同,并且只对应一个无人飞机,定义N个子田块集合为H j,j=1,2,3,…,N; S1, according to the input field parameters and plant protection drone parameters, the operation field is divided into N subfields. Each subfield has the same operation requirements and corresponds to only one drone. Define the set of N subfields as H j , j=1,2,3,...,N;

S2,根据预设的分配原则将所有子田块分配给所有参与作业的植保无人飞机,所述预设的分配原则为:单个植保无人飞机被分配至少一个子田块,每个子田块只能被分配一次且所有子田块均被分配;S2. All subfields are allocated to all plant protection drones participating in the operation according to a preset allocation principle. The preset allocation principle is: a single plant protection drone is allocated at least one subfield, and each subfield Can only be allocated once and all subfields are allocated;

S3,在给定植保无人飞机数量、田块数量K、子田块数量N,以及作业时间矩阵(T) K×N和进/出田块的距离矩阵为(L 1) K×N、(L 2) K×N的基础上,采用MOSFLA算法寻找最优的作业分配矩阵(X) K ×NS3, given the number of plant protection drones, the number of fields K, the number of subfields N, and the operation time matrix (T) K×N and the distance matrix of entering/exiting the fields are (L 1 ) K×N , On the basis of (L 2 ) K×N , use the MOSFLA algorithm to find the optimal assignment matrix (X) K ×N ;

S4,根据最优作业分配矩阵(X) K×N和飞机作业时间矩阵(T) K×N,确定子田块的作业时间矩阵(T’) N×1;结合预设的装配规则,定义子田块的作业顺序矩阵(SE) N×1,所述预设的装配规则为每个无人飞机降落后,均进行包括电池更换、药箱更换在内的装配任务,但同一时刻只有一架无人飞机执行装配任务; S4, according to the optimal assignment matrix (X) K×N and the aircraft operation time matrix (T) K×N , determine the operation time matrix (T') N×1 of the subfield; combine the preset assembly rules to define The operation sequence matrix (SE) N×1 of the subfield block. The preset assembly rule is that after each UAV landed, assembly tasks including battery replacement and medicine box replacement are performed, but there is only one assembly task at the same time. An unmanned aircraft performs assembly tasks;

S5,采用遗传算法对子田块的作业顺序矩阵(SE) N×1进行优化。 S5, using genetic algorithm to optimize the operation sequence matrix (SE) N×1 of the subfield block.

作为其中的一种优选例,步骤S1中,所述根据输入的田块参数和植保无人飞机参数,将作业田块划分成N个子田块的过程包括以下步骤:As a preferred example, in step S1, the process of dividing the operation field into N subfields according to the input field parameters and plant protection drone parameters includes the following steps:

S11,将相同的作业要求的田块放入同一集合,共计M个集合;S11, put the fields required by the same operation into the same set, a total of M sets;

S12,根据植保无人飞机的一次起/降的作业面积,对M个集合内的所有田块作进一步田块处理,包括相邻小田块合并、大田块分割操作;S12, according to the operation area of the plant protection unmanned aircraft for one take-off/landing, further field processing is performed on all the fields in the M sets, including the merging of adjacent small fields and the division of large fields;

S13,提取M个集合内的所有子田块,设子田块数量为N,定义N个子田块集合为H j,j=1,2,3,…,N。 S13, extract all subfields in the M sets, set the number of subfields as N, and define the set of N subfields as H j , j=1, 2, 3,...,N.

作为其中的一种优选例,步骤S1中,步骤S2中,所述根据预设的分配原则将所有子田块分配给所有参与作业的植保无人飞机是指:As a preferred example, in step S1, in step S2, the allocation of all subfields to all plant protection drones participating in the operation according to the preset allocation principle refers to:

定义植保无人机作业分配矩阵为(X) K×N,其中分配参数x ij赋值定义为: The assignment matrix of plant protection UAV is defined as (X) K×N , where the assignment parameter x ij is defined as:

Figure PCTCN2020113196-appb-000001
Figure PCTCN2020113196-appb-000001

其中,j=1,2,3,…,N。Among them, j=1, 2, 3,...,N.

作为其中的一种优选例,步骤S1中,步骤S3中,所述采用MOSELA算法寻找最优的作业分配矩阵(X) K×N的过程包括以下步骤: As a preferred example, in step S1, in step S3, the process of using the MOSELA algorithm to find the optimal job allocation matrix (X) K×N includes the following steps:

S31,输入种群规模S、子族群数s、族群的青蛙个体num、总群迭代次数D和族群迭代次数I;S31, input the population size S, the number of subgroups s, the frog individual num of the group, the number of total group iterations D, and the number of group iterations I;

S32,初始化青蛙总群P={X 1,X 2,…,X S}; S32, initialize the total group of frogs P={X 1 ,X 2 ,...,X S };

S33,计算适应值,并按降序排列,进行族群划分;S33: Calculate the fitness value and sort it in descending order for ethnic group division;

S34,族群内部进化:根据下述公式,各子群体进行第一次跳跃:S34, evolution within the ethnic group: According to the following formula, each sub-group makes the first jump:

Figure PCTCN2020113196-appb-000002
Figure PCTCN2020113196-appb-000002

其中:X b和X w分别为子族群的最优个体和最差个体; Among them: X b and X w are the best individual and the worst individual of the sub-group, respectively;

S35,第一次族群合并:按照适应值进行降序排列,结合下述公式,整个族群进行第二次跳跃:S35, the first ethnic group merger: sort in descending order according to fitness value, combined with the following formula, the entire ethnic group jumps for the second time:

Figure PCTCN2020113196-appb-000003
Figure PCTCN2020113196-appb-000003

其中:X g和X w分别为整个族群的最优个体和最差个体; Among them: X g and X w are the best individual and the worst individual of the entire ethnic group, respectively;

S36,第二次族群合并:按照适应值进行降序排列,结合下述公式,将族群最弱个体进行第三次跳跃:S36, the second ethnic group merger: sort in descending order according to fitness value, and combine the following formula to make the third jump for the weakest individual in the ethnic group:

(X w)′=rand(X),X∈Q M×N (X w )′=rand(X),X∈Q M×N

其中:rand(X)表示在可行解空间随机产生一个决策矩阵;Among them: rand(X) means that a decision matrix is randomly generated in the feasible solution space;

S37,判断当前循环次数是否小于总群迭代次数D,如果小于,转入步骤S33,否则,输出最优个体X 1S37: Judge whether the current cycle number is less than the total group iteration number D, if it is less, go to step S33, otherwise, output the optimal individual X 1 ;

其中,种群更新相关参数定义如下:Among them, the related parameters of population update are defined as follows:

设矩阵X 1∈Q M×N、X 2∈Q M×N,其中Q M×N为可行解空间,定义矩阵

Figure PCTCN2020113196-appb-000004
表示X 2与X 1间的差异矩阵,
Figure PCTCN2020113196-appb-000005
表示矩阵间的按异位或操作符; Suppose the matrix X 1 ∈Q M×N and X 2 ∈Q M×N , where Q M×N is the feasible solution space, define the matrix
Figure PCTCN2020113196-appb-000004
Represents the difference matrix between X 2 and X 1,
Figure PCTCN2020113196-appb-000005
Represents the ectopic OR operator between matrices;

z′=cut(z,k)的含义为:截取一维数组z的前k列,保存到新的一维数组z’中;The meaning of z'=cut(z,k) is: intercept the first k columns of the one-dimensional array z and save it to the new one-dimensional array z’;

(X 1)′=F(B,φ)的含义为:根据差异矩阵B对矩阵X进行逼近矩阵B的更新,统计B各列的元素和,若元素和大于0则将该列号保存至一维数组z中,操作符φ的定义为: The meaning of (X 1 )′=F(B,φ) is: update matrix X to approximate matrix B according to difference matrix B, count the element sum of each column of B, and if the element sum is greater than 0, save the column number to In the one-dimensional array z, the operator φ is defined as:

φ=~(B,X 1,cut(z,ri(n))) φ=~(B,X 1 ,cut(z,ri(n)))

其中:n为数组z的长度,ri(n)表示区间[1,n]内的任意整数;“~”表示根据z’指定的列号ri(n),将X 1在该列的元素修正与B元素排列保持一致; Among them: n is the length of the array z, ri(n) represents any integer in the interval [1,n]; "~" represents the column number ri(n) specified by z'to modify the element of X 1 in the column Keep consistent with the arrangement of B elements;

Figure PCTCN2020113196-appb-000006
的含义为:对矩阵X 1按照操作符
Figure PCTCN2020113196-appb-000007
进行变异操作,操作符
Figure PCTCN2020113196-appb-000008
的定义为:
Figure PCTCN2020113196-appb-000006
The meaning of is: according to the operator for the matrix X 1
Figure PCTCN2020113196-appb-000007
Perform mutation operation, operator
Figure PCTCN2020113196-appb-000008
Is defined as:

Figure PCTCN2020113196-appb-000009
Figure PCTCN2020113196-appb-000009

式中:switch(r 1,r 2)表示交换矩阵中的r 1行和r 2行,swicth(c 1,c 2)表示交换矩阵中的c 1列和c 2列。 In the formula: switch (r 1 , r 2 ) represents the r 1 row and r 2 row in the switching matrix, and swicth (c 1 , c 2 ) represents the c 1 column and c 2 column in the switching matrix.

作为其中的一种优选例,步骤S1中,步骤S33中,所述进行族群划分的过程包括以下步骤:As a preferred example, in step S1, in step S33, the process of group division includes the following steps:

S331,定义个体t的适应值函数FV 1如下, S331, define the fitness function FV 1 of the individual t as follows,

Figure PCTCN2020113196-appb-000010
Figure PCTCN2020113196-appb-000010

其中wd 1是飞作业距离的相对参数;wd 2是作业时间差参数;f 1、f 2和f 3分别代表无人机分配、作业距离和作业时间适应值; Among them, wd 1 is the relative parameter of flying operation distance; wd 2 is the operation time difference parameter; f 1 , f 2 and f 3 represent the UAV allocation, operation distance and operation time adaptation value respectively;

S332,将个体的适应值作为族群划分的参照,根据FV 1 t的大小,进行降序排列,则第i个子群体内的个体分别为: In S332, the fitness value of the individual is used as a reference for the division of the ethnic group, and the individuals in the i-th subgroup are arranged in descending order according to the size of FV 1 t . The individuals in the i-th subgroup are:

{FV 1 k|k∈[(i-1)×num+1,i×num]} {FV 1 k |k∈[(i-1)×num+1,i×num]}

其中,i=1,2,3,…,s。Among them, i=1, 2, 3,...,s.

作为其中的一种优选例,步骤S1中,步骤S34中,所述族群内部进化的过程包括以下步骤:As a preferred example, in step S1, in step S34, the process of internal evolution of the ethnic group includes the following steps:

S341,根据下述公式,向子群体最优个体进行跳跃:S341: Jump to the best individual in the subgroup according to the following formula:

Figure PCTCN2020113196-appb-000011
Figure PCTCN2020113196-appb-000011

S342,引入用于检测是否存在未分配到田块的植保无人飞机的变异算子,采用变异算子进行变异检测和处理:S342. Introduce a mutation operator for detecting whether there is a plant protection unmanned aircraft that is not allocated to the field, and use the mutation operator to perform mutation detection and processing:

(X w)″=F((X w)′,switch([r 0,r m],c)) (X w )″=F((X w )′,switch([r 0 ,r m ],c))

式中:r 0表示矩阵(X w)′行元素和为0的行号;r m表示矩阵(X w)′行元素和为最大的行号;c表示r m中值为1的任意列号;switch([r 0,r m],c)表示在矩阵(X w)′的第c列中,交换r 0和r m的元素,当r 0的值不唯一时,采用第一次跳跃对应的跳跃公式进行多次变异; In the formula: r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged. When the value of r 0 is not unique, the first The jump formula corresponding to the jump has been mutated many times;

S343,更新最优、最差个体;S343, update the best and worst individuals;

S344,重复步骤S341至S343,直至循环次数达到I次。S344: Repeat steps S341 to S343 until the number of cycles reaches 1.

作为其中的一种优选例,步骤S1中,步骤S35中,所述第一次族群合并的过程包括以下步骤:As a preferred example, in step S1, in step S35, the process of the first ethnic merging includes the following steps:

S351,采用下述公式,向族群最优个体进行跳跃:S351, using the following formula to jump to the best individual in the ethnic group:

Figure PCTCN2020113196-appb-000012
Figure PCTCN2020113196-appb-000012

S352,引入用于检测是否存在未分配到田块的植保无人飞机的变异算子,采用变异算子进行变异检测和处理:S352. Introduce a mutation operator for detecting whether there is a plant protection unmanned aircraft that is not allocated to the field, and use the mutation operator to perform mutation detection and processing:

(X w)″=F((X w)′,switch([r 0,r m],c)) (X w )″=F((X w )′,switch([r 0 ,r m ],c))

式中:r 0表示矩阵(X w)′行元素和为0的行号;r m表示矩阵(X w)′行元素和为最大的行号;c表示r m中值为1的任意列号;switch([r 0,r m],c)表示在矩阵(X w)′的第c列中,交换r 0和r m的元素,当r 0的值不唯一时,采用第一次跳跃对应的跳跃公式进行多次变异; In the formula: r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged. When the value of r 0 is not unique, the first The jump formula corresponding to the jump has been mutated many times;

S353,更新最优、最差个体。S353: Update the best and worst individuals.

作为其中的一种优选例,步骤S4中,所述定义子田块的作业顺序矩阵(SE) N×1的过程包括以下步骤: As a preferred example, in step S4, the process of defining the operation sequence matrix (SE) N×1 of the subfield includes the following steps:

S41,根据飞机作业时间矩阵为(T) K×N,确定田块的作业时间矩阵(T’) N×1,t j’为: S41, according to the aircraft operation time matrix (T) K×N , determine the field operation time matrix (T') N×1 , and t j'is :

Figure PCTCN2020113196-appb-000013
Figure PCTCN2020113196-appb-000013

其中,j=1,2,3,…,N;Among them, j = 1, 2, 3,..., N;

S42,定义田块的作业顺序矩阵为(SE) N×1,se j为[1,N]区间内非重复的整数集合; S42: Define the operation sequence matrix of the field as (SE) N×1 , and se j is a set of non-repeated integers in the interval [1,N];

S43,按照作业顺序(SE) N×1的作业时间,定义排序后的时间矩阵为

Figure PCTCN2020113196-appb-000014
Figure PCTCN2020113196-appb-000015
为: S43, according to the work order (SE) N×1 work time, define the sorted time matrix as
Figure PCTCN2020113196-appb-000014
its
Figure PCTCN2020113196-appb-000015
for:

Figure PCTCN2020113196-appb-000016
Figure PCTCN2020113196-appb-000016

S44,基于(SE) N×1

Figure PCTCN2020113196-appb-000017
定义植保无人飞机-田块的作业时间为(TA) K×N’,ta ij′表示第i架飞机的第j′次作业的时间,j′=1,2,3,…,N’,N′=max{sum[x(i,:)]};(TA) K×N’每一列未赋值项用0补全; S44, based on (SE) N×1 and
Figure PCTCN2020113196-appb-000017
Define the operation time of the plant protection unmanned aircraft-field as (TA) K×N' , ta ij ′ represents the time of the j′th operation of the i-th aircraft, j′=1, 2, 3,...,N' , N'=max{sum[x(i,:)]}; (TA) K×N' each column of unassigned items is filled with 0;

S45,在不考虑多架植保无人飞机同时进行装配电池、药箱的重叠时间的情况下,定义无人飞机的降落时间矩阵为(TL)K×N’,起飞时间矩阵为(TR) K×N’,tl ij′和tr ij′分别为: S45, without considering the overlapping time of multiple plant protection drones at the same time assembling batteries and medicine boxes, define the landing time matrix of the drone as (TL)K×N', and the takeoff time matrix as (TR) K ×N' , tl ij' and tr ij' are respectively:

Figure PCTCN2020113196-appb-000018
Figure PCTCN2020113196-appb-000018

Figure PCTCN2020113196-appb-000019
Figure PCTCN2020113196-appb-000019

其中,ts ij′为飞机降落后装配至下一次起飞所需要的时间,此处设为固定长度,ts ij′=c。 Among them, ts ij' is the time required for the aircraft to be assembled to the next take-off after landing, here is set as a fixed length, ts ij' = c.

作为其中的一种优选例,步骤S5中,所述采用遗传算法对子田块的作业顺序矩阵(SE) N×1进行优化的过程包括以下步骤: As a preferred example, in step S5, the process of using genetic algorithm to optimize the operation sequence matrix (SE) N×1 of the subfield includes the following steps:

S51,对子田块作业的适应值进行评价:S51, evaluate the fitness of subfield operations:

将作业顺序(SE) N×1作为染色体,在确定(SE) N×1的情况下,确定不同植保无人机最终降落的时间为tl KN’,定义染色体的适应值选择函数FV 2为: Taking the operating sequence (SE) N×1 as the chromosome, and in the case of determining (SE) N×1 , determine the final landing time of different plant protection drones as tl KN' , and define the fitness value selection function FV 2 of the chromosome as:

Figure PCTCN2020113196-appb-000020
Figure PCTCN2020113196-appb-000020

其中,g(SE t)=max[tl KN′(SE t,c)];t表示该染色体在群体的位置;wt为时间适应值参数,单位为min,取值范围为[300,600]; Among them, g(SE t )=max[tl KN′ (SE t ,c)]; t represents the position of the chromosome in the population; wt is the time fitness parameter, the unit is min, and the value range is [300,600];

S52,遗传算子定义:S52, definition of genetic operator:

a.染色体选择运算a. Chromosome selection operation

采用轮盘赌法对初始种群进行选择,如果某个个体t的适应度为f t,则该个体被选择的概率表示为P tThe roulette method is used to select the initial population. If the fitness of an individual t is f t , the probability of the individual being selected is expressed as P t :

Figure PCTCN2020113196-appb-000021
Figure PCTCN2020113196-appb-000021

其中,N表示染色体规模;Among them, N represents the size of the chromosome;

b.染色体交叉运算b. Chromosome crossover operation

采用部分匹配交叉方法进行染色体的交叉运算:随机生成两个交叉点,确定一个匹配段;根据父体中匹配段与非匹配段的映射关系生成两个子个体;Partial matching crossover method is adopted for crossover operation of chromosomes: two crossover points are randomly generated, and a matching segment is determined; two child individuals are generated according to the mapping relationship between the matching segment and the non-matching segment in the parent body;

c.染色体变异运算c. Chromosome mutation operation

随机选取N个位置,将其对应的基因进行互换,N大于1;Randomly select N positions, exchange their corresponding genes, and N is greater than 1;

S53,基于GA算法对染色体进行更新,以获取最优的子田块的作业顺序矩阵(SE) N×1,包括以下子步骤: S53, the chromosome is updated based on the GA algorithm to obtain the optimal subfield operation sequence matrix (SE) N×1 , including the following sub-steps:

S531,输入种群规模N,进化最大迭代次数max(Gen),交叉率p c,变异率p mS531, input the population size N, the maximum number of evolutionary iterations max (Gen), the crossover rate p c , and the mutation rate p m ;

S532,生成初始群体{SE} P,总群规模为P; S532, generate an initial group {SE} P , and the total group size is P;

S533,计算种群个体的适应值;S533: Calculate the fitness value of individuals in the population;

S534,对以下遗传计算停止的条件进行判断:(1)迭代次数达到max(Gen),(2)满足适应值要求,(3)最佳染色体连续保持10代;若其中任意一项条件满足,终止迭代流程,输出最优个体{SE} max(f)|,否则,转入步骤S535; S534: Judge the following conditions for stopping genetic calculation: (1) The number of iterations reaches max(Gen), (2) the fitness value requirement is met, and (3) the best chromosome is maintained for 10 consecutive generations; if any one of the conditions is met, Terminate the iterative process, and output the optimal individual {SE} max(f) |, otherwise, go to step S535;

S535,除最优染色体外,对其余染色体进行选择计算;S535, in addition to the optimal chromosome, perform selection calculations on the remaining chromosomes;

S536,除最优染色体外,对其他染色体进行交叉运算;S536, except for the optimal chromosome, perform crossover operation on other chromosomes;

S537,除最优染色体外,对其他染色体进行变异运算,返回步骤S533。S537: In addition to the optimal chromosome, perform mutation operation on other chromosomes, and return to step S533.

基于前述分配方法,本发明还提及一种植保无人飞机集群作业任务分配装置,所述分配装置包括ARM嵌入式系统,以及分别与ARM嵌入式系统连接的GPS定位系统、温湿度传感器、数传模块、电源模块、LCD触摸屏和缓存模块;Based on the foregoing allocation method, the present invention also mentions a planting protection unmanned aircraft cluster task allocation device. The allocation device includes an ARM embedded system, and a GPS positioning system, a temperature and humidity sensor, and a computer connected to the ARM embedded system. Transmission module, power supply module, LCD touch screen and cache module;

所述温湿度传感器用于探测作业区域的实时温度和实时湿度,将探测结果反馈至ARM嵌入式系统;The temperature and humidity sensor is used to detect the real-time temperature and real-time humidity of the work area, and feedback the detection result to the ARM embedded system;

所述LCD触摸屏用于输入田块参数和植保无人飞机参数至ARM嵌入式系统,所述田块参数包括每个田块的边界坐标;The LCD touch screen is used to input field parameters and plant protection drone parameters to the ARM embedded system, and the field parameters include the boundary coordinates of each field;

所述ARM嵌入式系统结合输入的田块参数和植保无人飞机参数,以及温湿度传感器反馈的环境信息,采用如前所述分配方法,联合结算出所有植保无人飞机协同任务分配模型和对应的植保无人飞机集群作业的调度方案,将该调度方法通过数传模块发送至各个植保无人飞机的飞控系统,以及输入参数和对应的调度方法储存至缓存模块;The ARM embedded system combines the input field parameters and plant protection UAV parameters, as well as the environmental information fed back by the temperature and humidity sensor, and uses the aforementioned distribution method to jointly settle out all plant protection UAV coordinated task assignment models and corresponding The plant protection unmanned aircraft cluster operation scheduling plan, the scheduling method is sent to the flight control system of each plant protection unmanned aircraft through the data transmission module, and the input parameters and the corresponding scheduling method are stored in the buffer module;

所述电源模块用于提供ARM嵌入式系统、GPS定位系统、温湿度传感器、数传模块、电源模块、LCD触摸屏和缓存模块正常工作所需电能;The power supply module is used to provide the power required for normal operation of the ARM embedded system, GPS positioning system, temperature and humidity sensor, data transmission module, power supply module, LCD touch screen and cache module;

所述GPS定位系统用于获取每个植保无人飞机的位置信息,将获取到的位置信息通过LCD 触摸屏以展示给用户。The GPS positioning system is used to obtain the position information of each plant protection unmanned aircraft, and display the obtained position information to the user through the LCD touch screen.

以上本发明的技术方案,与现有相比,其显著的有益效果在于:Compared with the prior art, the above technical solutions of the present invention have significant beneficial effects as follows:

(1)在保证航路全覆盖的基础上,综合时间和能耗两个约束条件,建立最短飞行距离和最优时间分配双层决策方法,降低时间冲突、提高作业效率。(1) On the basis of ensuring full coverage of the route, the two constraints of time and energy consumption are integrated, and a two-layer decision-making method for the shortest flight distance and optimal time allocation is established to reduce time conflicts and improve operational efficiency.

(2)对所有植保无人飞机的整个作业过程进行自动规划,减少人力损耗,只需一个工作人员即可完成对所有无人机的维护和监控,实现真正的一控多机。(2) Automatically plan the entire operation process of all plant protection drones to reduce manpower loss. Only one staff member can complete the maintenance and monitoring of all drones, realizing one control for multiple drones.

应当理解,前述构思以及在下面更加详细地描述的额外构思的所有组合只要在这样的构思不相互矛盾的情况下都可以被视为本公开的发明主题的一部分。另外,所要求保护的主题的所有组合都被视为本公开的发明主题的一部分。It should be understood that all combinations of the aforementioned concepts and the additional concepts described in more detail below can be regarded as part of the inventive subject matter of the present disclosure as long as such concepts are not mutually contradictory. In addition, all combinations of the claimed subject matter are regarded as part of the inventive subject matter of the present disclosure.

结合附图从下面的描述中可以更加全面地理解本发明教导的前述和其他方面、实施例和特征。本发明的其他附加方面例如示例性实施方式的特征和/或有益效果将在下面的描述中显见,或通过根据本发明教导的具体实施方式的实践中得知。The foregoing and other aspects, embodiments and features of the teachings of the present invention can be more fully understood from the following description with reference to the accompanying drawings. Other additional aspects of the present invention, such as the features and/or beneficial effects of the exemplary embodiments, will be apparent in the following description, or learned from the practice of the specific embodiments taught in accordance with the present invention.

附图说明Description of the drawings

附图不意在按比例绘制。在附图中,在各个图中示出的每个相同或近似相同的组成部分可以用相同的标号表示。为了清晰起见,在每个图中,并非每个组成部分均被标记。现在,将通过例子并参考附图来描述本发明的各个方面的实施例,其中:The drawings are not intended to be drawn to scale. In the drawings, each identical or nearly identical component shown in each figure may be represented by the same reference numeral. For the sake of clarity, not every component is labeled in every figure. Now, embodiments of various aspects of the present invention will be described by way of examples and with reference to the accompanying drawings, in which:

图1是本发明的植保无人飞机集群作业任务分配方法的流程图。Fig. 1 is a flow chart of the task allocation method for plant protection unmanned aircraft cluster operations according to the present invention.

图2是本发明的具体实施例一的分配方法流程图。Fig. 2 is a flow chart of the allocation method according to the first embodiment of the present invention.

图3是本发明的对作业田块进行划分的流程示意图。Fig. 3 is a schematic diagram of the process of dividing the work field according to the present invention.

图4是基于MOSFLA的寻找最优的作业分配矩阵(X) K×N流程图。 Figure 4 is a flowchart of finding the optimal job allocation matrix (X) K×N based on MOSFLA.

图5是染色体交叉准备示意图。Figure 5 is a schematic diagram of chromosome crossover preparation.

图6是染色体交叉完成示意图。Figure 6 is a schematic diagram of the completion of chromosome crossover.

图7是染色体变异过程示意图。Figure 7 is a schematic diagram of the chromosome mutation process.

图8是采用遗传算法对子田块的作业顺序矩阵(SE) N×1进行优化流程图。 Fig. 8 is a flowchart of optimizing the operation sequence matrix (SE) N×1 of the subfield block using genetic algorithm.

图9是植保无人飞机集群作业任务分配装置结构示意图。Figure 9 is a schematic structural diagram of a plant protection unmanned aircraft cluster operation task allocation device.

图10是具体实施例三中植保无人飞机的目标作业田块示意图。Fig. 10 is a schematic diagram of the target operation field of the plant protection unmanned aircraft in the third embodiment.

图11是具体实施例三中目标作业田块预处理方式示意图。Fig. 11 is a schematic diagram of the preprocessing method of the target operation field in the third embodiment.

图12是是具体实施例三的作业结果对比示意图。FIG. 12 is a schematic diagram of the comparison of the operation results of the third embodiment.

具体实施方式Detailed ways

为了更了解本发明的技术内容,特举具体实施例并配合所附图式说明如下。In order to better understand the technical content of the present invention, specific embodiments are described in conjunction with the accompanying drawings as follows.

具体实施例一Specific embodiment one

结合图1,本发明提出一种植保无人飞机集群作业任务分配方法,所述分配方法包括以下步骤:With reference to Fig. 1, the present invention proposes a method for distributing tasks for planting protection unmanned aircraft cluster operations. The distributing method includes the following steps:

S1,根据输入的田块参数和植保无人飞机参数,将作业田块划分成N个子田块,每个子田块的作业要求相同,并且只对应一个无人飞机,定义N个子田块集合为H j,j=1,2,3,…,N。 S1, according to the input field parameters and plant protection drone parameters, the operation field is divided into N subfields. Each subfield has the same operation requirements and corresponds to only one drone. Define the set of N subfields as H j , j=1, 2, 3,...,N.

S2,根据预设的分配原则将所有子田块分配给所有参与作业的植保无人飞机,所述预设的分配原则为:单个植保无人飞机被分配至少一个子田块,每个子田块只能被分配一次且所有子田块均被分配。S2. All subfields are allocated to all plant protection drones participating in the operation according to a preset allocation principle. The preset allocation principle is: a single plant protection drone is allocated at least one subfield, and each subfield It can only be allocated once and all subfields are allocated.

S3,在给定植保无人飞机数量、田块数量K、子田块数量N,以及作业时间矩阵(T) K×N和进/出田块的距离矩阵为(L 1) K×N、(L 2) K×N的基础上,采用MOSFLA算法寻找最优的作业分配矩阵(X) K×NS3, given the number of plant protection drones, the number of fields K, the number of subfields N, and the operation time matrix (T) K×N and the distance matrix of entering/exiting the fields are (L 1 ) K×N , On the basis of (L 2 ) K×N , the MOSFLA algorithm is used to find the optimal assignment matrix (X) K×N .

S4,根据最优作业分配矩阵(X) K×N和飞机作业时间矩阵(T) K×N,确定子田块的作业时间矩阵(T’) N×1;结合预设的装配规则,定义子田块的作业顺序矩阵(SE) N×1,所述预设的装配规则为每个无人飞机降落后,均进行包括电池更换、药箱更换在内的装配任务,但同一时刻只有一架无人飞机执行装配任务。 S4, according to the optimal assignment matrix (X) K×N and the aircraft operation time matrix (T) K×N , determine the operation time matrix (T') N×1 of the subfield; combine the preset assembly rules to define The operation sequence matrix (SE) N×1 of the subfield block. The preset assembly rule is that after each UAV landed, assembly tasks including battery replacement and medicine box replacement are performed, but there is only one assembly task at the same time. An unmanned aircraft performs assembly tasks.

S5,采用遗传算法对子田块的作业顺序矩阵(SE) N×1进行优化。 S5, using genetic algorithm to optimize the operation sequence matrix (SE) N×1 of the subfield block.

请参见图1和图2,假设已知条件为:①已知田块位置、植保无人飞机的数量与起降位置;②已知飞机的飞行与作业性能、各田块的无人机飞机作业参数;③在无人飞机降落进行药箱、电池装配时只有一个劳动力(一控多机)。则在多架植保无人飞机协同下,进行作业田块的无人飞机分配、田块作业排序的过程包括以下步骤:Please refer to Figure 1 and Figure 2, assuming that the known conditions are: ①The position of the field, the number of plant protection drones and the take-off and landing positions; ②The flight and operation performance of the aircraft, and the drone aircraft in each field are known Operational parameters; ③There is only one labor force (one control for multiple aircraft) when the unmanned aircraft is landing for the assembly of the medicine box and the battery. Under the coordination of multiple plant protection unmanned aircraft, the process of unmanned aircraft allocation and field operations sequencing of operation fields includes the following steps:

一、作业田块的重新划分1. Re-division of operation fields

假设共有目标作业田共n块,对其进行划分步骤如下:(I)将相同的作业要求(农药种类与药液浓度、飞机作业参数等)的田块放入同一集合,共计M个集合;(II)根据植保无人飞机的一次起/降的作业面积,对M个集合内的所有田块进行进一步田块划分—相邻小田块合并、大田块分割操作;(III)提取M个集合内的所有子田块,计为N,重新定义N个田块集合为H j,(j=1,2,3,…,N)。划分步骤如下图3所示。 Assuming that there are a total of n blocks of target operation fields, the steps for dividing them are as follows: (1) Put fields with the same operation requirements (pesticide types and liquid concentration, aircraft operation parameters, etc.) into the same set, a total of M sets; (II) According to the operation area of one take-off/landing of the plant protection drone, further field division is performed on all fields in the M sets-adjacent small field blocks are merged, and large field blocks are divided; (III) M sets are extracted All the subfields within are counted as N, and the set of N fields is redefined as H j , (j = 1, 2, 3,..., N). The division steps are shown in Figure 3 below.

二、基于MOSFLA的无人飞机作业田块分配2. Field allocation for unmanned aircraft operations based on MOSFLA

单个植保无人飞机可以分配给多个田块(<N),但每个田块只能被分配一次。A single plant protection drone can be allocated to multiple fields (<N), but each field can only be allocated once.

定义植保无人机作业分配矩阵为(X) K×N,其中分配参数x ij赋值定义为 The assignment matrix of plant protection UAV operation is defined as (X) K×N , where the assignment parameter x ij is defined as

Figure PCTCN2020113196-appb-000022
Figure PCTCN2020113196-appb-000022

其中,j=1,2,3,…,N。无人飞机分配参数遵循约束条件:每块田只能被作业一次且所有田块都分配给了植保无人飞机。Among them, j=1, 2, 3,...,N. The allocation parameters of unmanned aircraft follow the constraints: each field can only be operated once and all fields are allocated to the plant protection unmanned aircraft.

三、基于MOSFLA的作业分配优化3. Job allocation optimization based on MOSFLA

在给定飞机、田块数量K、N,以及作业时间矩阵(T) K×N,进/出田块的距离矩阵为(L 1) K×N、(L 2) K×N,采用MOSFLA算法寻找较优的作业分配矩阵为(X) K×NGiven the number of planes and fields K, N, and the operation time matrix (T) K×N , the distance matrix for entering/exiting the field is (L 1 ) K×N , (L 2 ) K×N , using MOSFLA The algorithm finds the optimal assignment matrix for (X) K×N .

通过多族群协同进化,混合蛙跳算法可以实现种群的更新。为优化(1)式中的分配参数X,涉及种群更新方式的定义如下。Through multi-ethnic co-evolution, the hybrid leapfrog algorithm can realize the update of the population. In order to optimize the allocation parameter X in equation (1), the definition of the way of population update is as follows.

定义1设矩阵X 1∈Q M×N、X 2∈Q M×N,其中Q M×N为可行解空间,定义矩阵

Figure PCTCN2020113196-appb-000023
表示X 2与X 1间的差异矩阵,
Figure PCTCN2020113196-appb-000024
表示矩阵间的按异位或操作符。 Definition 1 Suppose matrix X 1 ∈Q M×N , X 2 ∈Q M×N , where Q M×N is the feasible solution space, define matrix
Figure PCTCN2020113196-appb-000023
Represents the difference matrix between X 2 and X 1,
Figure PCTCN2020113196-appb-000024
Represents the ectopic OR operator between matrices.

定义2z′=cut(z,k)的定义为:截取一维数组z的前k列,保存到新的一维数组z’中。Definition 2z'=cut(z,k) is defined as: intercept the first k columns of the one-dimensional array z, and save it in the new one-dimensional array z'.

定义3(X 1)′=F(B,φ),为根据差异矩阵B(即

Figure PCTCN2020113196-appb-000025
),对矩阵X进行逼近矩阵B的更新。统计B各列的元素和,若元素和>0则将该列号保存至一维数组z中。操作符φ的定义为: Definition 3(X 1 )′=F(B,φ), which is based on the difference matrix B (ie
Figure PCTCN2020113196-appb-000025
), update the matrix X to the matrix B. Count the element sum of each column of B, if the element sum>0, save the column number in the one-dimensional array z. The operator φ is defined as:

φ=~(B,X 1,cut(z,ri(n))).             (2) φ=~(B,X 1 ,cut(z,ri(n))). (2)

其中:n为数组z的长度,ri(n)表示区间[1,n]任意整数;“~”表示:根据z’(即cut(z,ri(n))) 指定的列号ri(n),将X 1在该列的元素修正与B元素排列保持一致。 Among them: n is the length of the array z, ri(n) represents any integer in the interval [1,n]; "~" represents: the column number ri(n) specified by z'(ie cut(z,ri(n))) ), the element correction of X 1 in this column is consistent with the arrangement of B elements.

定义4

Figure PCTCN2020113196-appb-000026
为对矩阵X 1按照操作符
Figure PCTCN2020113196-appb-000027
进行变异操作,操作符
Figure PCTCN2020113196-appb-000028
的定义为: Definition 4
Figure PCTCN2020113196-appb-000026
According to the operator for the pair matrix X 1
Figure PCTCN2020113196-appb-000027
Perform mutation operation, operator
Figure PCTCN2020113196-appb-000028
Is defined as:

Figure PCTCN2020113196-appb-000029
Figure PCTCN2020113196-appb-000029

式中:switch(r 1,r 2)表示交换矩阵中的r 1行和r 2行,swicth(c 1,c 2)表示交换矩阵中的c 1列和c 2列。 In the formula: switch (r 1 , r 2 ) represents the r 1 row and r 2 row in the switching matrix, and swicth (c 1 , c 2 ) represents the c 1 column and c 2 column in the switching matrix.

四、MOSFLA的蛙跳规则Fourth, MOSFLA's Leapfrog Rules

本发明中设计的有关蛙跳规则如下The relevant leapfrog rules designed in the present invention are as follows

第1次跳跃,The first jump,

Figure PCTCN2020113196-appb-000030
Figure PCTCN2020113196-appb-000030

其中:X b和X w分别为子族群的最优个体和最差个体。 Among them: X b and X w are the best individual and the worst individual of the sub-group, respectively.

第2次跳跃,The second jump,

Figure PCTCN2020113196-appb-000031
Figure PCTCN2020113196-appb-000031

其中:X g和X w分别为整个族群的最优个体和最差个体。 Among them: X g and X w are the best individual and the worst individual of the entire ethnic group, respectively.

第3次跳跃,The third jump,

(X w)′=rand(X),X∈Q M×N.        (6) (X w )′=rand(X),X∈Q M×N . (6)

其中:rand(X)表示在可行解空间随机产生一个决策矩阵。Among them: rand(X) means that a decision matrix is randomly generated in the feasible solution space.

综上体现了子族群、总族群中最差个体向族群最优个体的优化的能力,以及总族群的全局更新过程。In summary, it reflects the ability of the sub-ethnic group and the worst individual in the overall ethnic group to optimize to the best individual of the ethnic group, and the overall update process of the overall ethnic group.

所产生的新个体可能存在有飞机没有分配到田块的问题(即

Figure PCTCN2020113196-appb-000032
)。本发明引入变异算子如下,对部分解进行变异处理: The resulting new entity may have the problem of aircraft not being allocated to the field (i.e.
Figure PCTCN2020113196-appb-000032
). The present invention introduces mutation operators as follows to perform mutation processing on partial solutions:

(X w)″=F((Xw)′,switch([r 0,r m],c)).        (7) (X w )″=F((Xw)′,switch([r 0 ,r m ],c)). (7)

式中:r 0表示矩阵(X w)′行元素和为0的行号;r m表示矩阵(X w)′行元素和为最大的行号;c表示r m中值为1的任意列号;switch([r 0,r m],c)表示在矩阵(X w)′的第c列中,交换r 0和r m的元素,当r 0的值不唯一,可根据(4)式进行多次变异。 In the formula: r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged. When the value of r 0 is not unique, it can be based on (4) The formula undergoes multiple mutations.

五、个体的族群划分Five, the ethnic division of individuals

设蛙跳种群的总数为S,子群体的个数为s,子群体个数为num(满足S=s×num)。基于公式(6),定义个体t的适应值函数FV 1如下, Suppose the total number of leapfrogging populations is S, the number of sub-populations is s, and the number of sub-populations is num (satisfying S=s×num). Based on formula (6), the fitness value function FV 1 of an individual t is defined as follows,

Figure PCTCN2020113196-appb-000033
Figure PCTCN2020113196-appb-000033

其中wd 1是飞作业距离的相对参数;wd 2是作业时间差参数;f 1、f 2和f 3分别代表无人机分配、作业距离和作业时间适应值,各定义如下, Among them, wd 1 is the relative parameter of the flying operation distance; wd 2 is the operation time difference parameter; f 1 , f 2 and f 3 represent the UAV allocation, the operation distance and the operation time adaptation value respectively, and each is defined as follows,

Figure PCTCN2020113196-appb-000034
Figure PCTCN2020113196-appb-000034

其中a=round(N/K)。Where a=round(N/K).

Figure PCTCN2020113196-appb-000035
Figure PCTCN2020113196-appb-000035

其中w代表负载飞行和非负载飞行能量损耗比。Where w represents the ratio of energy loss during load flight and non-load flight.

Figure PCTCN2020113196-appb-000036
Figure PCTCN2020113196-appb-000036

x ij

Figure PCTCN2020113196-appb-000037
和t ij分别是矩阵(X) K×N、(L 1) K×N、(L 2) K×N和(T) K×N的元素。 x ij ,
Figure PCTCN2020113196-appb-000037
And t ij are the elements of the matrices (X) K×N , (L 1 ) K×N , (L 2 ) K×N and (T) K×N , respectively.

本发明将通过个体的适应值作为族群划分的参照。根据FV 1 t的大小,进行降序排列,则第i个子群体内的个体分别为, The present invention uses the fitness value of an individual as a reference for the classification of ethnic groups. According to the size of FV 1 t , arrange in descending order, then the individuals in the i-th subgroup are respectively,

{FV 1 k|k∈[(i-1)×num+1,i×num]}.        (9) {FV 1 k |k∈[(i-1)×num+1,i×num]}. (9)

其中,i=1,2,3,…,s。Among them, i=1, 2, 3,...,s.

根据上述的算法设计,本发明提出的多机协同分配问题的改进MOSFLA算法具体步骤如图4所示。According to the above algorithm design, the specific steps of the improved MOSFLA algorithm for the multi-machine cooperative allocation problem proposed by the present invention are shown in FIG. 4.

六、基于GA的田块作业排序模型Six, field job sequencing model based on GA

基于MOSFLA算法,我们已寻找较优的作业分配矩阵为(X) K×N。根据飞机作业时间矩阵为(T) K ×N,我们可以确定田块的作业时间矩阵(T’) N×1,其t j’为, Based on the MOSFLA algorithm, we have searched for a better assignment matrix of (X) K×N . According to the aircraft operation time matrix (T) K ×N , we can determine the field operation time matrix (T') N×1 , and its t j'is ,

Figure PCTCN2020113196-appb-000038
Figure PCTCN2020113196-appb-000038

其中,j=1,2,3,…,N。定义田块的作业顺序矩阵为(SE) N×1,j=1,2,3,…,N,se j为[1,N]区间内非重复的整数集合。则按照作业顺序(SE) N×1的作业时间,定义排序后的时间矩阵为

Figure PCTCN2020113196-appb-000039
Figure PCTCN2020113196-appb-000040
为, Among them, j=1, 2, 3,...,N. The work sequence matrix that defines the field is (SE) N×1 , j=1, 2, 3,..., N, se j is a non-repeated integer set in the interval [1,N]. According to the work sequence (SE) N×1 work time, the time matrix after sorting is defined as
Figure PCTCN2020113196-appb-000039
its
Figure PCTCN2020113196-appb-000040
for,

Figure PCTCN2020113196-appb-000041
Figure PCTCN2020113196-appb-000041

基于(SE) N×1

Figure PCTCN2020113196-appb-000042
定义植保无人飞机-田块的作业时间为(TA) K×N’,ta ij′表示第i架飞机的第j′次作业的时间,j′=1,2,3,…,N’,N′=max{sum[x(i,:)]}。(TA) K×N’每一列未赋值项用0补全。 Based on (SE) N×1 and
Figure PCTCN2020113196-appb-000042
Define the operation time of the plant protection drone-field as (TA) K×N' , ta ij′ represents the time of the j′th operation of the i-th aircraft, j′=1,2,3,...,N' , N′=max{sum[x(i,:)]}. (TA) The unassigned items in each column of K×N' are filled with 0.

在无人飞机降落后,需要进行电池、药箱更换。在不考虑多架植保无人飞机同时进行装配电池、药箱的重叠时间,定义无人飞机的降落时间矩阵为(TL) K×N’,起飞时间矩阵为(TR) K×N’,tl ij′和tr ij′分别为: After the drone has landed, the battery and medicine box need to be replaced. Regardless of the overlap time of multiple plant protection drones at the same time assembling batteries and medicine boxes, the landing time matrix of the drone is defined as (TL) K×N' , and the take-off time matrix is (TR) K×N' , tl ij′ and tr ij′ are respectively:

Figure PCTCN2020113196-appb-000043
Figure PCTCN2020113196-appb-000043

Figure PCTCN2020113196-appb-000044
Figure PCTCN2020113196-appb-000044

其中,ts ij′为飞机降落后装配至下一次起飞所需要的时间,不考虑装配人员装配时间差异,此处可设为固定长度,ts ij′=c,简化计算复杂度。 Among them, ts ij' is the time required for the aircraft to assemble to the next takeoff after landing, regardless of the assembly time difference of the assemblers, here can be set to a fixed length, ts ij' = c, simplifying the calculation complexity.

七、基于GA的田块作业排序优化Seven, GA-based field job sorting optimization

为减少多架无人机同时作业的整体时间,需要确定田块的作业顺序(SE) N×1。本发明通过GA算法,对作业顺序进行优化。 In order to reduce the overall time of simultaneous operation of multiple UAVs, it is necessary to determine the operation sequence (SE) N×1 of the field . The present invention optimizes the operation sequence through the GA algorithm.

7.1田块作业的适应值评价7.1 Evaluation of fitness for field operations

本发明将作业顺序(SE) N×1作为染色体,在确定(SE) N×1情况下,可以确定不同植保无人机最终降落的时间tl KN’,定义该染色体的适应值选择函数FV 2定义为, The present invention takes the work sequence (SE) N×1 as the chromosome. In the case of determining (SE) N×1 , the final landing time tl KN' of different plant protection drones can be determined, and the fitness value selection function FV 2 of the chromosome can be defined. defined as,

Figure PCTCN2020113196-appb-000045
Figure PCTCN2020113196-appb-000045

其中g(SE t)=max[tl KN′(SE t,c)];t表示该染色体在群体的位置;wt为时间适应值参数(min),取值范围为[300,600]。 Where g(SE t )=max[tl KN′ (SE t ,c)]; t represents the position of the chromosome in the population; wt is the time fitness parameter (min), with a value range of [300,600].

7.2遗传算子定义7.2 Definition of genetic operators

a.染色体选择运算a. Chromosome selection operation

采用轮盘赌法对初始种群进行选择,如果某个个体t的适应度为f t,则该个体被选择的概率可以表示为P tThe roulette method is used to select the initial population. If the fitness of an individual t is f t , the probability of the individual being selected can be expressed as P t :

Figure PCTCN2020113196-appb-000046
Figure PCTCN2020113196-appb-000046

其中N表示染色体规模。Where N represents the size of the chromosome.

b.染色体交叉运算b. Chromosome crossover operation

结合图5和图6,采用部分匹配交叉方法(PMX,Partially Matched Crossover)进行染色体的交叉运算:随机生成两个交叉点,确定一个匹配段;根据父体中匹配段与非匹配段的映射关系生成两个子个体。例如,存在两父体如下,假设随机生成的匹配段为[4,6],用*标记重复的数字。基于中间映射关系,可以确定重复部分的数字,字体A1出现的第一个*的初始值为1,交叉出现的1起源于6,而6参与交叉,其初始值为5,5不再参与交叉,则可将A1出现的第一个*赋值为5;同理A1出现的第二个*赋值为4。同理完成子体B1*处的赋值。Combining Figure 5 and Figure 6, the partial matching crossover method (PMX, Partially Matched Crossover) is used to perform the crossover operation of chromosomes: two crossover points are randomly generated, and a matching segment is determined; according to the mapping relationship between the matching segment and the non-matching segment in the parent body Generate two sub-individuals. For example, there are two parents as follows, assuming that the randomly generated matching segment is [4,6], and the repeated numbers are marked with *. Based on the intermediate mapping relationship, the number of the repeated part can be determined. The initial value of the first * in the font A1 is 1, the cross-occurring 1 originates from 6, and the 6 participates in the cross, its initial value is 5, and 5 no longer participates in the cross , The first * appearing in A1 can be assigned the value 5; in the same way, the second * appearing in A1 can be assigned the value 4. In the same way, complete the assignment at subbody B1*.

c.染色体变异运算c. Chromosome mutation operation

随机选取N(>1)个位置,将其对应的基因进行互换。如对染色体A,选取的基因位置为3,5和6,则编译后的染色体如图7所示。Randomly select N (>1) positions and exchange their corresponding genes. For chromosome A, the selected gene positions are 3, 5, and 6, then the compiled chromosome is shown in Figure 7.

八、基于GA的染色体更新流程8. GA-based chromosome update process

本发明中染色体停止遗传计算的条件为:①迭代到max(Gen)次,算法终止;②满足适应值要求,算法终止;③最佳染色体连续保持10代,算法终止。基于GA的染色体更新流程如图8所示。The conditions for the chromosome to stop genetic calculation in the present invention are: ① Iterate to max(Gen) times, and the algorithm is terminated; ② Meet the fitness value requirement, and the algorithm is terminated; ③ The optimal chromosome is continuously maintained for 10 generations, and the algorithm is terminated. The GA-based chromosome update process is shown in Figure 8.

在本发明中,种群规模数P=20~100;遗传进化迭代次数max(Gen)=100~500;交叉概率p c=0.4~0.99;变异概率p m=0.0001~0.1。 In the present invention, the population size P=20-100; the number of genetic evolution iteration max(Gen)=100-500; the crossover probability p c =0.4-0.99; the mutation probability p m =0.0001-0.1.

具体实施例二Specific embodiment two

结合图9,基于前述分配方法,本发明还提及一种植保无人飞机集群作业任务分配装置,所述分配装置包括ARM嵌入式系统,以及分别与ARM嵌入式系统连接的GPS定位系统、温湿度传感器、数传模块、电源模块、LCD触摸屏和缓存模块。With reference to Figure 9, based on the foregoing allocation method, the present invention also mentions a planting protection unmanned aircraft cluster task allocation device. The allocation device includes an ARM embedded system, and a GPS positioning system and a temperature control system respectively connected to the ARM embedded system. Humidity sensor, data transmission module, power supply module, LCD touch screen and cache module.

所述温湿度传感器用于探测作业区域的实时温度和实时湿度,将探测结果反馈至ARM嵌入式系统。The temperature and humidity sensor is used to detect the real-time temperature and real-time humidity of the work area, and feedback the detection result to the ARM embedded system.

所述LCD触摸屏用于输入田块参数和植保无人飞机参数至ARM嵌入式系统,所述田块参数包括每个田块的边界坐标。The LCD touch screen is used to input field parameters and plant protection drone parameters to the ARM embedded system, and the field parameters include the boundary coordinates of each field.

所述ARM嵌入式系统结合输入的田块参数和植保无人飞机参数,以及温湿度传感器反馈的 环境信息,采用如前所述分配方法,联合结算出所有植保无人飞机协同任务分配模型和对应的植保无人飞机集群作业的调度方案,将该调度方法通过数传模块发送至各个植保无人飞机的飞控系统,以使飞控系统依据接收到的指令控制机具进行集群作业,以及输入参数和对应的调度方法储存至缓存模块。The ARM embedded system combines the input field parameters and plant protection UAV parameters, as well as the environmental information fed back by the temperature and humidity sensor, and uses the aforementioned distribution method to jointly settle out all plant protection UAV coordinated task assignment models and corresponding The scheduling scheme of plant protection unmanned aircraft cluster operation is sent to the flight control system of each plant protection unmanned aircraft through the data transmission module, so that the flight control system controls the equipment to perform the cluster operation according to the received instructions and input parameters And the corresponding scheduling method are stored in the cache module.

所述电源模块用于提供ARM嵌入式系统、GPS定位系统、温湿度传感器、数传模块、电源模块、LCD触摸屏和缓存模块正常工作所需电能。The power supply module is used to provide the power required for normal operation of the ARM embedded system, GPS positioning system, temperature and humidity sensor, data transmission module, power supply module, LCD touch screen and buffer module.

所述GPS定位系统用于获取每个植保无人飞机的位置信息,将获取到的位置信息通过LCD触摸屏以展示给用户。The GPS positioning system is used to obtain the position information of each plant protection unmanned aircraft, and display the obtained position information to the user through the LCD touch screen.

具体实施例三Specific embodiment three

为确定基于MOSFLA+GA协同任务分配算法对多架植保无人飞机作业规划的优化性能,本发明选取总面积为330亩的目标多田块如下图10和11所示。In order to determine the optimal performance of the operation planning of multiple plant protection UAVs based on the MOSFLA+GA collaborative task allocation algorithm, the present invention selects the target multi-field block with a total area of 330 mu as shown in Figures 10 and 11 below.

选取的植保无人机的最大续航时间为25min,载药量为15L。基于无人机针对图10多田块进行重新划分,划分的结果如图11所示。所划分出的22个子田块的面积≤15亩,以保证植保无人飞机一次架次可完成喷洒作业。无人飞机的起/降区位于田块中心附近,该区域同时满足便于起飞、药液电池运输等要求。当有多架飞机同时降落时,飞机之间最大的距离为100m,以保证在规定的时间内完成药液、电池的装配工作。在本发明中,选取地块中心100m位置作为飞机的起降装配点,相邻降落点相距25m,装配时间c=6min,飞机数量u=3架。The selected plant protection UAV has a maximum flight time of 25min and a drug load of 15L. Based on the UAV re-division of the multi-field block in Figure 10, the results of the division are shown in Figure 11. The area of the 22 subfields divided is ≤15 mu to ensure that the plant protection drones can complete the spraying operation in one sortie. The take-off/landing area of the unmanned aircraft is located near the center of the field, and this area also meets the requirements of facilitating take-off and transportation of liquid medicine batteries. When there are multiple planes landing at the same time, the maximum distance between the planes is 100m to ensure that the assembly work of the liquid medicine and battery is completed within the specified time. In the present invention, the 100m position in the center of the plot is selected as the aircraft's take-off and landing assembly point, the adjacent landing points are 25m apart, the assembly time c=6min, and the number of aircraft u=3.

为对比正常情况下无人机作业下飞机进/出田块的加权距离、总飞行时间,本发明对比以下两种传统的多机作业模式:In order to compare the weighted distance and total flight time of the aircraft entering/exiting the field under normal conditions, the present invention compares the following two traditional multi-aircraft operation modes:

传统多机作业模式①:飞机不确定作业田块,但飞机完成上一田块作业后将进行下一田块的作业。Traditional multi-aircraft operation mode①: The aircraft cannot operate on the field, but after the aircraft completes the operation on the previous field, it will proceed to the next field.

传统多机作业模式②:无人飞机都有确定作业田块,每架飞机有固定的作业顺序。Traditional multi-aircraft operation mode ②: Unmanned aircraft have certain operating fields, and each aircraft has a fixed operating sequence.

两种传统的多机作业模式的实施结果如下:The implementation results of the two traditional multi-machine operation modes are as follows:

相比传统模式,采用MOSFAL+GA算法最多可以节省25min,无人飞机集群作业效率和总时间见图12。Compared with the traditional mode, the MOSFAL+GA algorithm can save up to 25 minutes. The efficiency and total time of unmanned aircraft cluster operation are shown in Figure 12.

在本公开中参照附图来描述本发明的各方面,附图中示出了许多说明的实施例。本公开的实施例不必定义在包括本发明的所有方面。应当理解,上面介绍的多种构思和实施例,以及下面更加详细地描述的那些构思和实施方式可以以很多方式中任意一种来实施,这是因为本发明所公开的构思和实施例并不限于任何实施方式。另外,本发明公开的一些方面可以单独使用,或者与本发明公开的其他方面的任何适当组合来使用。In this disclosure, various aspects of the present invention are described with reference to the accompanying drawings, in which numerous illustrated embodiments are shown. The embodiments of the present disclosure are not necessarily defined to include all aspects of the present invention. It should be understood that the various concepts and embodiments introduced above, as well as those described in more detail below, can be implemented in any of many ways, because the concepts and embodiments disclosed in the present invention are not Limited to any implementation. In addition, some aspects disclosed in the present invention can be used alone or in any appropriate combination with other aspects disclosed in the present invention.

虽然本发明已以较佳实施例揭露如上,然其并非用以限定本发明。本发明所属技术领域中具有通常知识者,在不脱离本发明的精神和范围内,当可作各种的更动与润饰。因此,本发明的保护范围当视权利要求书所界定者为准。Although the present invention has been disclosed as above in preferred embodiments, it is not intended to limit the present invention. Those with ordinary knowledge in the technical field to which the present invention belongs can make various changes and modifications without departing from the spirit and scope of the present invention. Therefore, the protection scope of the present invention shall be subject to what is defined in the claims.

Claims (10)

一种植保无人飞机集群作业任务分配方法,其特征在于,所述分配方法包括以下步骤:A method for distributing tasks for planting protection unmanned aircraft cluster operations, characterized in that the distributing method includes the following steps: S1,根据输入的田块参数和植保无人飞机参数,将作业田块划分成N个子田块,每个子田块的作业要求相同,并且只对应一个无人飞机,定义N个子田块集合为H j,j=1,2,3,…,N; S1. According to the input field parameters and plant protection drone parameters, the operation field is divided into N subfields. Each subfield has the same operation requirements and corresponds to only one drone. Define the set of N subfields as H j , j=1,2,3,...,N; S2,根据预设的分配原则将所有子田块分配给所有参与作业的植保无人飞机,所述预设的分配原则为:单个植保无人飞机被分配至少一个子田块,每个子田块只能被分配一次且所有子田块均被分配;S2. All subfields are allocated to all plant protection drones participating in the operation according to a preset allocation principle. The preset allocation principle is: a single plant protection drone is allocated at least one subfield, and each subfield Can only be allocated once and all subfields are allocated; S3,在给定植保无人飞机数量、田块数量K、子田块数量N,以及作业时间矩阵(T) K×N和进/出田块的距离矩阵为(L 1) K×N、(L 2) K×N的基础上,采用MOSFLA算法寻找最优的作业分配矩阵(X) K ×NS3, given the number of plant protection drones, the number of fields K, the number of subfields N, and the operation time matrix (T) K×N and the distance matrix of entering/exiting the fields are (L 1 ) K×N , On the basis of (L 2 ) K×N , use the MOSFLA algorithm to find the optimal assignment matrix (X) K ×N ; S4,根据最优作业分配矩阵(X) K×N和飞机作业时间矩阵(T) K×N,确定子田块的作业时间矩阵(T’) N×1;结合预设的装配规则,定义子田块的作业顺序矩阵(SE) N×1,所述预设的装配规则为每个无人飞机降落后,均进行包括电池更换、药箱更换在内的装配任务,但同一时刻只有一架无人飞机执行装配任务; S4, according to the optimal assignment matrix (X) K×N and the aircraft operation time matrix (T) K×N , determine the operation time matrix (T') N×1 of the subfield; combine the preset assembly rules to define The operation sequence matrix (SE) N×1 of the subfield block. The preset assembly rule is that after each UAV landed, assembly tasks including battery replacement and medicine box replacement are performed, but there is only one assembly task at the same time. An unmanned aircraft performs assembly tasks; S5,采用遗传算法对子田块的作业顺序矩阵(SE) N×1进行优化。 S5, using genetic algorithm to optimize the operation sequence matrix (SE) N×1 of the subfield block. 根据权利要求1所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S1中,所述根据输入的田块参数和植保无人飞机参数,将作业田块划分成N个子田块的过程包括以下步骤:The plant protection unmanned aircraft cluster operation task allocation method according to claim 1, wherein in step S1, the operation field is divided into N subfields according to the input field parameters and plant protection unmanned aircraft parameters The process includes the following steps: S11,将相同的作业要求的田块放入同一集合,共计M个集合;S11, put the fields required by the same operation into the same set, a total of M sets; S12,根据植保无人飞机的一次起/降的作业面积,对M个集合内的所有田块作进一步田块处理,包括相邻小田块合并、大田块分割操作;S12, according to the operation area of the plant protection unmanned aircraft for one take-off/landing, further field processing is performed on all the fields in the M sets, including the merging of adjacent small fields and the division of large fields; S13,提取M个集合内的所有子田块,设子田块数量为N,定义N个子田块集合为H j,j=1,2,3,…,N。 S13, extract all subfields in the M sets, set the number of subfields as N, and define the set of N subfields as H j , j=1, 2, 3,...,N. 根据权利要求1所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S1中,步骤S2中,所述根据预设的分配原则将所有子田块分配给所有参与作业的植保无人飞机是指:The plant protection unmanned aircraft cluster operation task assignment method according to claim 1, characterized in that, in step S1, in step S2, all subfields are allocated to all plant protection plants participating in the operation according to a preset allocation principle. Human plane refers to: 定义植保无人机作业分配矩阵为(X) K×N,其中分配参数x ij赋值定义为: The assignment matrix of plant protection UAV is defined as (X) K×N , where the assignment parameter x ij is defined as:
Figure PCTCN2020113196-appb-100001
Figure PCTCN2020113196-appb-100001
其中,j=1,2,3,…,N。Among them, j=1, 2, 3,...,N.
根据权利要求3所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S1中,步骤S3中,所述采用MOSELA算法寻找最优的作业分配矩阵(X) K×N的过程包括以下步骤: The plant protection unmanned aircraft cluster task assignment method according to claim 3, wherein in step S1, in step S3, the process of using the MOSELA algorithm to find the optimal assignment matrix (X) K×N includes The following steps: S31,输入种群规模S、子族群数s、族群的青蛙个体num、总群迭代次数D和族群迭代次数I;S31, input the population size S, the number of subgroups s, the frog individual num of the group, the number of total group iterations D, and the number of group iterations I; S32,初始化青蛙总群P={X 1,X 2,…,X S}; S32, initialize the total group of frogs P={X 1 ,X 2 ,...,X S }; S33,计算适应值,并按降序排列,进行族群划分;S33: Calculate the fitness value and sort it in descending order for ethnic group division; S34,族群内部进化:根据下述公式,各子群体进行第一次跳跃:S34, evolution within the ethnic group: According to the following formula, each sub-group makes the first jump:
Figure PCTCN2020113196-appb-100002
Figure PCTCN2020113196-appb-100002
其中:X b和X w分别为子族群的最优个体和最差个体; Among them: X b and X w are the best individual and the worst individual of the sub-group, respectively; S35,第一次族群合并:按照适应值进行降序排列,结合下述公式,整个族群进行第二次跳跃:S35, the first ethnic group merger: sort in descending order according to fitness value, combined with the following formula, the entire ethnic group jumps for the second time:
Figure PCTCN2020113196-appb-100003
Figure PCTCN2020113196-appb-100003
其中:X g和X w分别为整个族群的最优个体和最差个体; Among them: X g and X w are the best individual and the worst individual of the entire ethnic group, respectively; S36,第二次族群合并:按照适应值进行降序排列,结合下述公式,将族群最弱个体进行第三次跳跃:S36, the second ethnic group merger: sort in descending order according to fitness value, and combine the following formula to make the third jump for the weakest individual in the ethnic group: (X w)′=rand(X),X∈Q M×N (X w )′=rand(X),X∈Q M×N 其中:rand(X)表示在可行解空间随机产生一个决策矩阵;Among them: rand(X) means that a decision matrix is randomly generated in the feasible solution space; S37,判断当前循环次数是否小于总群迭代次数D,如果小于,转入步骤S33,否则,输出最优个体X 1S37: Judge whether the current cycle number is less than the total group iteration number D, if it is less, go to step S33, otherwise, output the optimal individual X 1 ; 其中,种群更新相关参数定义如下:Among them, the related parameters of population update are defined as follows: 设矩阵X 1∈Q M×N、X 2∈Q M×N,其中Q M×N为可行解空间,定义矩阵
Figure PCTCN2020113196-appb-100004
表示X 2与X 1间的差异矩阵,
Figure PCTCN2020113196-appb-100005
表示矩阵间的按异位或操作符;
Suppose the matrix X 1 ∈Q M×N and X 2 ∈Q M×N , where Q M×N is the feasible solution space, define the matrix
Figure PCTCN2020113196-appb-100004
Represents the difference matrix between X 2 and X 1,
Figure PCTCN2020113196-appb-100005
Represents the ectopic OR operator between matrices;
z′=cut(z,k)的含义为:截取一维数组z的前k列,保存到新的一维数组z’中;The meaning of z'=cut(z,k) is: intercept the first k columns of the one-dimensional array z and save it to the new one-dimensional array z’; (X 1)′=F(B,φ)的含义为:根据差异矩阵B对矩阵X进行逼近矩阵B的更新,统计B各列的元素和,若元素和大于0则将该列号保存至一维数组z中,操作符φ的定义为: The meaning of (X 1 )′=F(B,φ) is: update matrix X to approximate matrix B according to difference matrix B, count the element sum of each column of B, and if the element sum is greater than 0, save the column number to In the one-dimensional array z, the operator φ is defined as: φ=~(B,X 1,cut(z,ri(n))) φ=~(B,X 1 ,cut(z,ri(n))) 其中:n为数组z的长度,ri(n)表示区间[1,n]内的任意整数;“~”表示根据z’指定的列号ri(n),将X 1在该列的元素修正与B元素排列保持一致; Among them: n is the length of the array z, ri(n) represents any integer in the interval [1,n]; "~" represents the column number ri(n) specified by z'to modify the element of X 1 in the column Keep consistent with the arrangement of B elements;
Figure PCTCN2020113196-appb-100006
的含义为:对矩阵X 1按照操作符
Figure PCTCN2020113196-appb-100007
进行变异操作,操作符
Figure PCTCN2020113196-appb-100008
的定义为:
Figure PCTCN2020113196-appb-100006
The meaning of is: according to the operator for the matrix X 1
Figure PCTCN2020113196-appb-100007
Perform mutation operation, operator
Figure PCTCN2020113196-appb-100008
Is defined as:
Figure PCTCN2020113196-appb-100009
Figure PCTCN2020113196-appb-100009
式中:switch(r 1,r 2)表示交换矩阵中的r 1行和r 2行,swicth(c 1,c 2)表示交换矩阵中的c 1列和c 2列。 In the formula: switch (r 1 , r 2 ) represents the r 1 row and r 2 row in the switching matrix, and swicth (c 1 , c 2 ) represents the c 1 column and c 2 column in the switching matrix.
根据权利要求4所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S1中,步骤S33中,所述进行族群划分的过程包括以下步骤:The method for distributing plant protection unmanned aircraft cluster operation tasks according to claim 4, wherein in step S1, in step S33, the process of group division includes the following steps: S331,定义个体t的适应值函数FV 1如下, S331, define the fitness function FV 1 of individual t as follows
Figure PCTCN2020113196-appb-100010
Figure PCTCN2020113196-appb-100010
其中wd 1是飞作业距离的相对参数;wd 2是作业时间差参数;f 1、f 2和f 3分别代表无人机分配、作业距离和作业时间适应值; Among them, wd 1 is the relative parameter of flying operation distance; wd 2 is the operation time difference parameter; f 1 , f 2 and f 3 represent the UAV allocation, operation distance and operation time adaptation value respectively; S332,将个体的适应值作为族群划分的参照,根据FV 1 t的大小,进行降序排列,则第i个子群体内的个体分别为: In S332, the fitness value of the individual is used as a reference for the division of the ethnic group, and the individuals in the i-th subgroup are arranged in descending order according to the size of FV 1 t . The individuals in the i-th subgroup are: {FV 1 k|k∈[(i-1)×num+1,i×num]} {FV 1 k |k∈[(i-1)×num+1,i×num]} 其中,i=1,2,3,…,s。Among them, i=1, 2, 3,...,s.
根据权利要求4所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S1中,步骤S34中,所述族群内部进化的过程包括以下步骤:The method for distributing plant protection unmanned aircraft cluster operation tasks according to claim 4, characterized in that, in step S1, in step S34, the process of internal evolution of the group includes the following steps: S341,根据下述公式,向子群体最优个体进行跳跃:S341: Jump to the best individual in the subgroup according to the following formula:
Figure PCTCN2020113196-appb-100011
Figure PCTCN2020113196-appb-100011
S342,引入用于检测是否存在未分配到田块的植保无人飞机的变异算子,采用变异算子进行变异检测和处理:S342. Introduce a mutation operator for detecting whether there is a plant protection unmanned aircraft that is not allocated to the field, and use the mutation operator to perform mutation detection and processing: (X w)″=F((X w)′,switch([r 0,r m],c)) (X w )″=F((X w )′,switch([r 0 ,r m ],c)) 式中:r 0表示矩阵(X w)′行元素和为0的行号;r m表示矩阵(X w)′行元素和为最大的行号;c表示r m中值为1的任意列号;switch([r 0,r m],c)表示在矩阵(X w)′的第c列中,交换r 0和r m的元素,当r 0的值不唯一时,采用第一次跳跃对应的跳跃公式进行多次变异; In the formula: r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged. When the value of r 0 is not unique, the first The jump formula corresponding to the jump has been mutated many times; S343,更新最优、最差个体;S343, update the best and worst individuals; S344,重复步骤S341至S343,直至循环次数达到I次。S344: Repeat steps S341 to S343 until the number of cycles reaches 1.
根据权利要求4所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S1中,步骤S35中,所述第一次族群合并的过程包括以下步骤:The method for distributing plant protection unmanned aircraft cluster operation tasks according to claim 4, wherein in step S1, in step S35, the process of the first group merger includes the following steps: S351,采用下述公式,向族群最优个体进行跳跃:S351, using the following formula to jump to the best individual in the ethnic group:
Figure PCTCN2020113196-appb-100012
Figure PCTCN2020113196-appb-100012
S352,引入用于检测是否存在未分配到田块的植保无人飞机的变异算子,采用变异算子进行变异检测和处理:S352. Introduce a mutation operator for detecting whether there is a plant protection unmanned aircraft that is not allocated to the field, and use the mutation operator to perform mutation detection and processing: (X w)″=F((X w)′,switch([r 0,r m],c)) (X w )″=F((X w )′,switch([r 0 ,r m ],c)) 式中:r 0表示矩阵(X w)′行元素和为0的行号;r m表示矩阵(X w)′行元素和为最大的行号;c表示r m中值为1的任意列号;switch([r 0,r m],c)表示在矩阵(X w)′的第c列中,交换r 0和r m的元素,当r 0的值不唯一时,采用第一次跳跃对应的跳跃公式进行多次变异; In the formula: r 0 represents the row number of matrix (X w )′ row element sum is 0; r m represents matrix (X w )′ row element sum is the largest row number; c represents any column of r m whose value is 1 Number; switch([r 0 ,r m ],c) means that in the c-th column of the matrix (X w )′, the elements of r 0 and r m are exchanged. When the value of r 0 is not unique, the first The jump formula corresponding to the jump has been mutated many times; S353,更新最优、最差个体。S353: Update the best and worst individuals.
根据权利要求4所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S4中,所述定义子田块的作业顺序矩阵(SE) N×1的过程包括以下步骤: The plant protection unmanned aircraft cluster task assignment method according to claim 4, characterized in that, in step S4, the process of defining the operation sequence matrix (SE) N×1 of the subfield includes the following steps: S41,根据飞机作业时间矩阵为(T) K×N,确定田块的作业时间矩阵(T’) N×1,t j’为: S41, according to the aircraft operation time matrix (T) K×N , determine the field operation time matrix (T') N×1 , and t j'is :
Figure PCTCN2020113196-appb-100013
Figure PCTCN2020113196-appb-100013
其中,j=1,2,3,…,N;Among them, j = 1, 2, 3,..., N; S42,定义田块的作业顺序矩阵为(SE) N×1,se j为[1,N]区间内非重复的整数集合; S42: Define the operation sequence matrix of the field as (SE) N×1 , and se j is a set of non-repeated integers in the interval [1,N]; S43,按照作业顺序(SE) N×1的作业时间,定义排序后的时间矩阵为
Figure PCTCN2020113196-appb-100014
Figure PCTCN2020113196-appb-100015
为:
S43, according to the work order (SE) N×1 work time, define the sorted time matrix as
Figure PCTCN2020113196-appb-100014
its
Figure PCTCN2020113196-appb-100015
for:
Figure PCTCN2020113196-appb-100016
Figure PCTCN2020113196-appb-100016
S44,基于(SE) N×1
Figure PCTCN2020113196-appb-100017
定义植保无人飞机-田块的作业时间为(TA) K×N’,ta ij′表示第i架飞机的第j′次作业的时间,j′=1,2,3,…,N’,N′=max{sum[x(i,:)]};(TA) K×N’每一列未赋值项用0补全;
S44, based on (SE) N×1 and
Figure PCTCN2020113196-appb-100017
Define the operation time of the plant protection unmanned aircraft-field as (TA) K×N' , ta ij ′ represents the time of the j′th operation of the i-th aircraft, j′=1, 2, 3,...,N' , N'=max{sum[x(i,:)]}; (TA) K×N' each column of unassigned items is filled with 0;
S45,在不考虑多架植保无人飞机同时进行装配电池、药箱的重叠时间的情况下,定义无人飞机的降落时间矩阵为(TL) K×N’,起飞时间矩阵为(TR) K×N’,tl ij′和tr ij′分别为: S45, without considering the overlap time of multiple plant protection drones at the same time assembling batteries and medicine boxes, define the landing time matrix of the drone as (TL) K×N' and the takeoff time matrix as (TR) K ×N' , tl ij' and tr ij' are respectively:
Figure PCTCN2020113196-appb-100018
Figure PCTCN2020113196-appb-100018
Figure PCTCN2020113196-appb-100019
Figure PCTCN2020113196-appb-100019
其中,ts ij′为飞机降落后装配至下一次起飞所需要的时间,此处设为固定长度,ts ij′=c。 Among them, ts ij' is the time required for the aircraft to be assembled to the next take-off after landing, here is set as a fixed length, ts ij' = c.
根据权利要求8所述的植保无人飞机集群作业任务分配方法,其特征在于,步骤S5中,所述采用遗传算法对子田块的作业顺序矩阵(SE) N×1进行优化的过程包括以下步骤: The plant protection unmanned aircraft cluster task assignment method according to claim 8, characterized in that, in step S5, the process of optimizing the operation sequence matrix (SE) N×1 of the subfield by using the genetic algorithm includes the following step: S51,对子田块作业的适应值进行评价:S51, evaluate the fitness of subfield operations: 将作业顺序(SE) N×1作为染色体,在确定(SE) N×1的情况下,确定不同植保无人机最终降落的时间为tl KN’,定义染色体的适应值选择函数FV 2为: Taking the operating sequence (SE) N×1 as the chromosome, and in the case of determining (SE) N×1 , determine the final landing time of different plant protection drones as tl KN' , and define the fitness value selection function FV 2 of the chromosome as:
Figure PCTCN2020113196-appb-100020
Figure PCTCN2020113196-appb-100020
其中,g(SE t)=max[tl KN′(SE t,c)];t表示该染色体在群体的位置;wt为时间适应值参数,单位为min,取值范围为[300,600]; Among them, g(SE t )=max[tl KN′ (SE t ,c)]; t represents the position of the chromosome in the population; wt is the time fitness parameter, the unit is min, and the value range is [300,600]; S52,遗传算子定义:S52, definition of genetic operator: a.染色体选择运算a. Chromosome selection operation 采用轮盘赌法对初始种群进行选择,如果某个个体t的适应度为f t,则该个体被选择的概率表示为P tThe roulette method is used to select the initial population. If the fitness of an individual t is f t , the probability of the individual being selected is expressed as P t :
Figure PCTCN2020113196-appb-100021
Figure PCTCN2020113196-appb-100021
其中,N表示染色体规模;Among them, N represents the size of the chromosome; b.染色体交叉运算b. Chromosome crossover operation 采用部分匹配交叉方法进行染色体的交叉运算:随机生成两个交叉点,确定一个匹配段;根据父体中匹配段与非匹配段的映射关系生成两个子个体;Partial matching crossover method is adopted for crossover operation of chromosomes: two crossover points are randomly generated, and a matching segment is determined; two child individuals are generated according to the mapping relationship between the matching segment and the non-matching segment in the parent body; c.染色体变异运算c. Chromosome mutation operation 随机选取N个位置,将其对应的基因进行互换,N大于1;Randomly select N positions, exchange their corresponding genes, and N is greater than 1; S53,基于GA算法对染色体进行更新,以获取最优的子田块的作业顺序矩阵(SE) N×1,包括以下子步骤: S53, the chromosome is updated based on the GA algorithm to obtain the optimal subfield operation sequence matrix (SE) N×1 , including the following sub-steps: S531,输入种群规模N,进化最大迭代次数max(Gen),交叉率p c,变异率p mS531, input the population size N, the maximum number of evolutionary iterations max (Gen), the crossover rate p c , and the mutation rate p m ; S532,生成初始群体{SE} P,总群规模为P; S532, generate an initial group {SE} P , and the total group size is P; S533,计算种群个体的适应值;S533: Calculate the fitness value of individuals in the population; S534,对以下遗传计算停止的条件进行判断:(1)迭代次数达到max(Gen),(2)满足适应值要求,(3)最佳染色体连续保持10代;若其中任意一项条件满足,终止迭代流程,输出最优个体{SE} max(f)|,否则,转入步骤S535; S534: Judge the following conditions for stopping genetic calculation: (1) The number of iterations reaches max(Gen), (2) the fitness value requirement is met, and (3) the best chromosome is maintained for 10 consecutive generations; if any one of the conditions is met, Terminate the iterative process, and output the optimal individual {SE} max(f) |, otherwise, go to step S535; S535,除最优染色体外,对其余染色体进行选择计算;S535, in addition to the optimal chromosome, perform selection calculations on the remaining chromosomes; S536,除最优染色体外,对其他染色体进行交叉运算;S536, except for the optimal chromosome, perform crossover operation on other chromosomes; S537,除最优染色体外,对其他染色体进行变异运算,返回步骤S533。S537: In addition to the optimal chromosome, perform mutation operation on other chromosomes, and return to step S533.
一种植保无人飞机集群作业任务分配装置,其特征在于,所述分配装置包括ARM嵌入式系统,以及分别与ARM嵌入式系统连接的GPS定位系统、温湿度传感器、数传模块、电源模块、LCD触摸屏和缓存模块;A planting protection unmanned aircraft cluster operation task distribution device, characterized in that the distribution device includes an ARM embedded system, and a GPS positioning system, a temperature and humidity sensor, a data transmission module, a power supply module, and a GPS positioning system respectively connected to the ARM embedded system. LCD touch screen and buffer module; 所述温湿度传感器用于探测作业区域的实时温度和实时湿度,将探测结果反馈至ARM嵌入式系统;The temperature and humidity sensor is used to detect the real-time temperature and real-time humidity of the work area, and feedback the detection result to the ARM embedded system; 所述LCD触摸屏用于输入田块参数和植保无人飞机参数至ARM嵌入式系统,所述田块参数包括每个田块的边界坐标;The LCD touch screen is used to input field parameters and plant protection drone parameters to the ARM embedded system, and the field parameters include the boundary coordinates of each field; 所述ARM嵌入式系统结合输入的田块参数和植保无人飞机参数,以及温湿度传感器反馈的环境信息,采用如权利要求1-9中任意一项所述分配方法,联合结算出所有植保无人飞机协同任务分配模型和对应的植保无人飞机集群作业的调度方案,将该调度方法通过数传模块发送至各个植保无人飞机的飞控系统,以及输入参数和对应的调度方法储存至缓存模块;The ARM embedded system combines the input field parameters and plant protection drone parameters, as well as the environmental information fed back by the temperature and humidity sensor, and uses the distribution method according to any one of claims 1-9 to jointly settle all plant protection parameters. The human-aircraft cooperative task allocation model and the corresponding plant protection unmanned aircraft cluster operation scheduling plan, the scheduling method is sent to the flight control system of each plant protection unmanned aircraft through the data transmission module, and the input parameters and the corresponding scheduling method are stored in the cache Module 所述电源模块用于提供ARM嵌入式系统、GPS定位系统、温湿度传感器、数传模块、电源模块、LCD触摸屏和缓存模块正常工作所需电能;The power supply module is used to provide the power required for normal operation of the ARM embedded system, GPS positioning system, temperature and humidity sensor, data transmission module, power supply module, LCD touch screen and cache module; 所述GPS定位系统用于获取每个植保无人飞机的位置信息,将获取到的位置信息通过LCD触摸屏以展示给用户。The GPS positioning system is used to obtain the position information of each plant protection unmanned aircraft, and display the obtained position information to the user through the LCD touch screen.
PCT/CN2020/113196 2020-05-06 2020-09-03 Cluster job task assignment method and device for plant-protection unmanned aerial vehicles Ceased WO2021135336A1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
AU2020416827A AU2020416827B2 (en) 2020-05-06 2020-09-03 Cluster job task assignment method and device for plant-protection unmanned aerial vehicles

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202010370842.1A CN111461464B (en) 2020-05-06 2020-05-06 A method and device for allocating tasks for plant protection unmanned aircraft swarm operations
CN202010370842.1 2020-05-06

Publications (1)

Publication Number Publication Date
WO2021135336A1 true WO2021135336A1 (en) 2021-07-08

Family

ID=71679602

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/113196 Ceased WO2021135336A1 (en) 2020-05-06 2020-09-03 Cluster job task assignment method and device for plant-protection unmanned aerial vehicles

Country Status (3)

Country Link
CN (1) CN111461464B (en)
AU (1) AU2020416827B2 (en)
WO (1) WO2021135336A1 (en)

Cited By (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114020022A (en) * 2021-11-04 2022-02-08 中国人民解放军陆军工程大学 Heterogeneous UAV cooperative strike mission planning method and device
CN114020034A (en) * 2021-11-26 2022-02-08 哈尔滨工程大学 Task slice-based heterogeneous multi-unmanned aerial vehicle cooperative task allocation method
CN114047777A (en) * 2021-07-31 2022-02-15 海南微飞信息科技有限公司 Mass operation scheduling method for plant protection unmanned aerial vehicle
CN114298307A (en) * 2021-12-06 2022-04-08 南京信息工程大学 Mixed frog leaping solving method for mobile crowd sensing variable speed multi-task allocation problem
CN114326827A (en) * 2022-01-12 2022-04-12 北方工业大学 A method and system for dynamic allocation of multi-tasks in a swarm of unmanned aerial vehicles
CN114519268A (en) * 2022-01-28 2022-05-20 中山大学 Motor matching method, device, equipment and storage medium based on dual-drive system
CN114594794A (en) * 2022-03-08 2022-06-07 大连理工大学 Multi-machine collaborative task planning method considering subsystem execution capacity
CN114967764A (en) * 2022-04-28 2022-08-30 农业农村部南京农业机械化研究所 Multi-operation-area plant protection unmanned aerial vehicle air route planning and task allocation method
CN115220473A (en) * 2022-07-12 2022-10-21 中国人民解放军陆军航空兵学院 A method for dynamic assignment of multi-UAV swarm cooperative tasks
CN115309191A (en) * 2022-09-21 2022-11-08 中国人民解放军国防科技大学 EMARL's UAV Swarm Method and Device Based on Competitive Cooperation Mechanism
CN115379386A (en) * 2022-07-18 2022-11-22 深圳市人工智能与机器人研究院 Unmanned aerial vehicle cluster electromagnetic spectrum monitoring method and device based on wolf cluster algorithm
CN115421492A (en) * 2022-09-16 2022-12-02 哈尔滨工程大学 Water surface unmanned boat cluster patrol task allocation method
CN115454614A (en) * 2022-11-14 2022-12-09 安徽大学 Intelligent scheduling method for robot cluster energy supply
CN115826614A (en) * 2022-11-14 2023-03-21 中国人民解放军国防科技大学 Multi-unmanned aerial vehicle energy support task allocation method
CN115879603A (en) * 2022-11-17 2023-03-31 武汉大学 Multi-target-point-oriented multi-unmanned aerial vehicle cooperative data acquisition method and device
CN116048111A (en) * 2022-12-26 2023-05-02 航天科工智能运筹与信息安全研究院(武汉)有限公司 A blockchain-based UAV swarm task decision-making method
CN116050779A (en) * 2023-01-16 2023-05-02 农业农村部南京农业机械化研究所 Dynamic scheduling method of plant protection UAV based on Levy simulated annealing algorithm
CN116245346A (en) * 2023-05-12 2023-06-09 深圳大学 Multi-unmanned aerial vehicle task allocation method based on multiple swarm genetic algorithms and local search
CN116483128A (en) * 2023-06-19 2023-07-25 湖南林科达信息科技有限公司 Unmanned aerial vehicle multitasking load device conversion method and system
CN118195277A (en) * 2024-05-16 2024-06-14 中国人民解放军海军航空大学 Integrated dispatching method for helicopter group offshore platform sortie operations
CN118627845A (en) * 2024-08-07 2024-09-10 中国人民解放军海军航空大学 A method for scheduling aircraft offshore platform operations
CN119012058A (en) * 2024-10-25 2024-11-22 国网山东省电力公司经济技术研究院 Method, device, equipment, terminal and storage medium for dynamically allocating bandwidth
CN119356359A (en) * 2024-10-22 2025-01-24 山东衡昊信息技术有限公司 Intelligent collaborative control method for drone swarm
CN119784082A (en) * 2024-12-31 2025-04-08 同济大学 Aircraft pulsation assembly line balancing method and medium considering complex constraints

Families Citing this family (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111461464B (en) * 2020-05-06 2021-06-08 农业农村部南京农业机械化研究所 A method and device for allocating tasks for plant protection unmanned aircraft swarm operations
CN112949292B (en) * 2021-01-21 2024-04-05 中国人民解放军61540部队 Method, device, equipment and storage medium for processing return data of cluster unmanned aerial vehicle
CN115081663B (en) * 2021-03-11 2025-01-28 南京林业大学 A multi-forest area route scheduling planning method based on double-layer nested genetic algorithm
CN112799432B (en) * 2021-04-08 2021-07-02 北京三快在线科技有限公司 Obstacle avoidance control method and device for unmanned aerial vehicle, storage medium and electronic equipment
CN114021914B (en) * 2021-10-22 2024-07-09 北京市农林科学院信息技术研究中心 Unmanned aerial vehicle cluster flight protection scheduling method and device
CN116542468B (en) * 2023-05-06 2023-10-20 中国人民解放军32370部队 Unmanned aerial vehicle cluster task planning method

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106547276A (en) * 2016-10-19 2017-03-29 上海圣尧智能科技有限公司 The three-back-shaped paths planning method of automatic spraying and fog machine spraying operation method
CN106597850A (en) * 2016-12-16 2017-04-26 新疆疆天航空科技有限公司 Plant protection unmanned plane formation object distribution method based on chaotic leapfrog
CN106997209A (en) * 2016-01-25 2017-08-01 深圳市鼎创旭飞科技有限公司 Plant protection unmanned plane sprays operational method and system
CN107037827A (en) * 2017-04-14 2017-08-11 合肥工业大学 Unmanned plane aviation job task is distributed and trajectory planning combined optimization method and device
US20190371184A1 (en) * 2016-05-27 2019-12-05 Guangzhou Xaircraft Technology Co., Ltd Method and device for controlling flight of unmanned aerial vehicle and remote controller
CN111461464A (en) * 2020-05-06 2020-07-28 农业农村部南京农业机械化研究所 A method and device for allocating tasks for plant protection unmanned aircraft swarm operations

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
SG11201806440WA (en) * 2016-01-29 2018-08-30 Garuda Robotics Pte Ltd System and method for controlling an unmanned vehicle and releasing a payload from the same
CN106873629B (en) * 2017-04-14 2019-10-29 合肥工业大学 Unmanned plane aviation job task distribution method and device
CN107238388B (en) * 2017-05-27 2018-02-23 合肥工业大学 Multiple no-manned plane task is distributed and trajectory planning combined optimization method and device
CN107633105B (en) * 2017-07-12 2020-09-08 西北工业大学 Improved hybrid frog-leaping algorithm-based quad-rotor unmanned aerial vehicle parameter identification method
CN109760846B (en) * 2017-11-09 2024-01-23 湖南农业大学 Plant protection drone field automatic supply device and method
CN109814597A (en) * 2019-02-03 2019-05-28 唐山坤翼创新科技有限公司 The control method of concentrating type plant protection drone control system
CN110288075A (en) * 2019-06-26 2019-09-27 电子科技大学 A Feature Selection Method Based on Improved Hybrid Leapfrog Algorithm

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106997209A (en) * 2016-01-25 2017-08-01 深圳市鼎创旭飞科技有限公司 Plant protection unmanned plane sprays operational method and system
US20190371184A1 (en) * 2016-05-27 2019-12-05 Guangzhou Xaircraft Technology Co., Ltd Method and device for controlling flight of unmanned aerial vehicle and remote controller
CN106547276A (en) * 2016-10-19 2017-03-29 上海圣尧智能科技有限公司 The three-back-shaped paths planning method of automatic spraying and fog machine spraying operation method
CN106597850A (en) * 2016-12-16 2017-04-26 新疆疆天航空科技有限公司 Plant protection unmanned plane formation object distribution method based on chaotic leapfrog
CN107037827A (en) * 2017-04-14 2017-08-11 合肥工业大学 Unmanned plane aviation job task is distributed and trajectory planning combined optimization method and device
CN111461464A (en) * 2020-05-06 2020-07-28 农业农村部南京农业机械化研究所 A method and device for allocating tasks for plant protection unmanned aircraft swarm operations

Cited By (33)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114047777A (en) * 2021-07-31 2022-02-15 海南微飞信息科技有限公司 Mass operation scheduling method for plant protection unmanned aerial vehicle
CN114020022A (en) * 2021-11-04 2022-02-08 中国人民解放军陆军工程大学 Heterogeneous UAV cooperative strike mission planning method and device
CN114020022B (en) * 2021-11-04 2023-08-18 中国人民解放军陆军工程大学 Heterogeneous unmanned aerial vehicle collaborative hit task planning method and device
CN114020034A (en) * 2021-11-26 2022-02-08 哈尔滨工程大学 Task slice-based heterogeneous multi-unmanned aerial vehicle cooperative task allocation method
CN114298307A (en) * 2021-12-06 2022-04-08 南京信息工程大学 Mixed frog leaping solving method for mobile crowd sensing variable speed multi-task allocation problem
CN114326827A (en) * 2022-01-12 2022-04-12 北方工业大学 A method and system for dynamic allocation of multi-tasks in a swarm of unmanned aerial vehicles
CN114326827B (en) * 2022-01-12 2023-06-09 北方工业大学 A method and system for multi-task dynamic allocation of unmanned aerial vehicle cluster
CN114519268A (en) * 2022-01-28 2022-05-20 中山大学 Motor matching method, device, equipment and storage medium based on dual-drive system
CN114594794A (en) * 2022-03-08 2022-06-07 大连理工大学 Multi-machine collaborative task planning method considering subsystem execution capacity
CN114594794B (en) * 2022-03-08 2023-05-23 大连理工大学 A Multi-machine Cooperative Mission Planning Method Considering Subsystem Execution Capabilities
CN114967764A (en) * 2022-04-28 2022-08-30 农业农村部南京农业机械化研究所 Multi-operation-area plant protection unmanned aerial vehicle air route planning and task allocation method
CN115220473A (en) * 2022-07-12 2022-10-21 中国人民解放军陆军航空兵学院 A method for dynamic assignment of multi-UAV swarm cooperative tasks
CN115379386A (en) * 2022-07-18 2022-11-22 深圳市人工智能与机器人研究院 Unmanned aerial vehicle cluster electromagnetic spectrum monitoring method and device based on wolf cluster algorithm
CN115379386B (en) * 2022-07-18 2024-05-14 深圳市人工智能与机器人研究院 Unmanned plane cluster electromagnetic spectrum monitoring method and device based on wolf's swarm algorithm
CN115421492A (en) * 2022-09-16 2022-12-02 哈尔滨工程大学 Water surface unmanned boat cluster patrol task allocation method
CN115309191A (en) * 2022-09-21 2022-11-08 中国人民解放军国防科技大学 EMARL's UAV Swarm Method and Device Based on Competitive Cooperation Mechanism
CN115826614A (en) * 2022-11-14 2023-03-21 中国人民解放军国防科技大学 Multi-unmanned aerial vehicle energy support task allocation method
CN115454614A (en) * 2022-11-14 2022-12-09 安徽大学 Intelligent scheduling method for robot cluster energy supply
CN115879603A (en) * 2022-11-17 2023-03-31 武汉大学 Multi-target-point-oriented multi-unmanned aerial vehicle cooperative data acquisition method and device
CN115879603B (en) * 2022-11-17 2024-05-14 武汉大学 A method and device for multi-unmanned aerial vehicle collaborative data acquisition for multiple target points
CN116048111A (en) * 2022-12-26 2023-05-02 航天科工智能运筹与信息安全研究院(武汉)有限公司 A blockchain-based UAV swarm task decision-making method
CN116050779A (en) * 2023-01-16 2023-05-02 农业农村部南京农业机械化研究所 Dynamic scheduling method of plant protection UAV based on Levy simulated annealing algorithm
CN116050779B (en) * 2023-01-16 2024-01-30 农业农村部南京农业机械化研究所 Plant protection unmanned aerial vehicle dynamic scheduling method based on train-dimensional simulated annealing algorithm
CN116245346B (en) * 2023-05-12 2023-07-28 深圳大学 Multi-unmanned aerial vehicle task allocation method based on multiple swarm genetic algorithms and local search
CN116245346A (en) * 2023-05-12 2023-06-09 深圳大学 Multi-unmanned aerial vehicle task allocation method based on multiple swarm genetic algorithms and local search
CN116483128B (en) * 2023-06-19 2023-10-27 湖南林科达信息科技有限公司 Unmanned aerial vehicle multitasking load device conversion method and system
CN116483128A (en) * 2023-06-19 2023-07-25 湖南林科达信息科技有限公司 Unmanned aerial vehicle multitasking load device conversion method and system
CN118195277A (en) * 2024-05-16 2024-06-14 中国人民解放军海军航空大学 Integrated dispatching method for helicopter group offshore platform sortie operations
CN118627845A (en) * 2024-08-07 2024-09-10 中国人民解放军海军航空大学 A method for scheduling aircraft offshore platform operations
CN119356359A (en) * 2024-10-22 2025-01-24 山东衡昊信息技术有限公司 Intelligent collaborative control method for drone swarm
CN119012058A (en) * 2024-10-25 2024-11-22 国网山东省电力公司经济技术研究院 Method, device, equipment, terminal and storage medium for dynamically allocating bandwidth
CN119784082A (en) * 2024-12-31 2025-04-08 同济大学 Aircraft pulsation assembly line balancing method and medium considering complex constraints
CN119784082B (en) * 2024-12-31 2025-09-23 同济大学 Aircraft pulsation assembly production line balancing method and medium considering complex constraint

Also Published As

Publication number Publication date
CN111461464B (en) 2021-06-08
AU2020416827B2 (en) 2022-07-07
CN111461464A (en) 2020-07-28
AU2020416827A1 (en) 2021-11-25

Similar Documents

Publication Publication Date Title
WO2021135336A1 (en) Cluster job task assignment method and device for plant-protection unmanned aerial vehicles
CN114172942B (en) Collaborative task allocation and track optimization method for multi-unmanned aerial vehicle auxiliary Internet of things
CN112766813B (en) A complex task scheduling method for space-space collaborative observation
CN113009934A (en) Multi-unmanned aerial vehicle task dynamic allocation method based on improved particle swarm optimization
CN106020230B (en) A kind of multiple no-manned plane method for allocating tasks under power consumption constraint
CN116127857B (en) Classification-oriented household garbage collection and transportation path multi-objective optimization method and system
CN110428111A (en) Trajectory Planning Method for UAV/UGV Cooperative Long-duration Multi-task Operation
CN113487264B (en) Logistics distribution method and system based on heterogeneous multi-unmanned aerial vehicles
CN107784472B (en) A multi-stacker collaborative feeding optimization method for warehouse-type broiler breeding
CN112434857B (en) A UAV airport network site selection and layout method based on GA-PSO optimization
CN111967672A (en) Lion group evolution algorithm-based path planning method for space crowdsourcing platform
CN114565239B (en) Integrated low-carbon energy scheduling method and system for industrial parks
CN118857324A (en) Path planning method for collaborative operation of unmanned sanitation vehicles
CN113727275B (en) Unmanned aerial vehicle-assisted wireless sensor network node charging selection method
Xu et al. Facilities layout design optimization of production workshop based on the improved PSO algorithm
Wei et al. Hierarchical task assignment of multiple UAVs with improved firefly algorithm based on simulated annealing mechanism
CN116364262A (en) A charging scheduling method for delivery robots based on aggregation game
Xing et al. Partiele Swarm Optimization Algorithm Based on Different Inertia Weights for Solving the P-Hub Allocation Problem
Jiang et al. An adaptive immune‐following algorithm for intelligent optimal schedule of multiregional agricultural machinery
CN118071088A (en) Multi-region unmanned aerial vehicle task allocation method and device based on topological structure
CN119090104A (en) Trajectory planning and data acquisition method for multiple UAVs based on multi-traveling salesman problem
CN118605610A (en) A method for UAV cooperative defense mission planning in complex electromagnetic environment
CN118839830A (en) Ecological path self-learning optimization method integrating multiple strategies and knowledge distillation
Liu et al. Modelling of optimal transportation route selection based on artificial bee colony algorithm
Zhu et al. Group Merging Particle Swarm Optimization Algorithm for Rural Base Station Deployment

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20909652

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2020416827

Country of ref document: AU

Date of ref document: 20200903

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20909652

Country of ref document: EP

Kind code of ref document: A1