CN105841702A - Method for planning routes of multi-unmanned aerial vehicles based on particle swarm optimization algorithm - Google Patents
Method for planning routes of multi-unmanned aerial vehicles based on particle swarm optimization algorithm Download PDFInfo
- Publication number
- CN105841702A CN105841702A CN201610135573.4A CN201610135573A CN105841702A CN 105841702 A CN105841702 A CN 105841702A CN 201610135573 A CN201610135573 A CN 201610135573A CN 105841702 A CN105841702 A CN 105841702A
- Authority
- CN
- China
- Prior art keywords
- unmanned plane
- routeing
- planning
- model
- plane
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G01—MEASURING; TESTING
- G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
- G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
- G01C21/20—Instruments for performing navigational calculations
Landscapes
- Engineering & Computer Science (AREA)
- Radar, Positioning & Navigation (AREA)
- Remote Sensing (AREA)
- Automation & Control Theory (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Control Of Position, Course, Altitude, Or Attitude Of Moving Bodies (AREA)
Abstract
The invention provides a method for planning the routes of multi-unmanned aerial vehicles based on a particle swarm optimization algorithm. The method comprises the following steps: establishing a three-dimensional map for planning space of the routes of the multi-unmanned aerial vehicles at first; then constructing multi-unmanned aerial vehicle route planning models under the three-dimensional map, wherein the models mainly comprise a barrier model, a route model, an unmanned aerial vehicle state model, a constraint model and a multi-unmanned aerial vehicle route planning mathematic model; and solving the problem of multi-unmanned aerial vehicle route planning under the three-dimensional map by using the particle swarm optimization algorithm. The method provided by the invention improves multi-unmanned aerial vehicle route planning capacity in a complex environment and provides technical support for air traffic management platforms for unmanned aerial vehicles, autonomous flight systems for multi-unmanned aerial vehicles, etc.
Description
Technical field
The present invention relates to a kind of multiple no-manned plane Route planner based on particle swarm optimization algorithm, belong to unmanned plane air route
Planning field.
Background technology
At present, unmanned plane has been succeeded in multiple fields such as electric power, communication, meteorology, monitorings application, achieves good
Economic benefit and social effect.Due to the restriction of single rack unmanned plane self software and hardware condition, it is difficult to competent day by day complicated answering
By environment and diversified mission requirements.It is the important of following Development of UAV application that multiple no-manned plane has worked in coordination with the pattern of task
Trend, is an up unmanned plane tasks carrying efficiency, expands new task state, improves the effective way of system reliability.The U.S.
SAB of air force the most once pointed out, unmanned plane should work rather than independent action in the way of a group of planes.
How man-machine the most collaborative multiple no-manned plane routeing be to realize one of key technology that is and that manage.At present, existing
Multiple no-manned plane Route planner typically uses optimum formula algorithm, mainly includes the method for exhaustion, dynamic programming, Mathematical Planning, cattle
Method and gradient method etc..There is bigger limitation in reality application in these methods, as lacked multiple no-manned plane routeing
Effective decision-making, i.e. considers deficiency to the conflicting of information observation, the redundancy of dependency between multiple no-manned plane;The power of weighting algorithm
The distribution of value, with the biggest subjectivity, lacks effective, practical weight distribution method etc..Therefore, in the urgent need to more effectively,
Practical multiple no-manned plane Route planner.
Summary of the invention
Present invention aim to address the problems referred to above existing for existing multiple no-manned plane Route planner, propose one
Multiple no-manned plane Route planner based on particle swarm optimization algorithm.
Technical scheme mainly comprises the steps that
Step 1: set up the three-dimensional map in multiple no-manned plane routeing space.Unmanned plane during flying space is entered with data mode
Row storage, the institute being denoted as in planning space a little (x, y, set z) (x, y, z) | Xmin≤x≤Xmax, Ymin≤y≤
Ymax, Zmin≤z≤Zmax, wherein (x, y) represents the horizontal level of this point, and z is altitude data.Planning space after discretization is adopted
Digital terrain elevation data is preserved by the form of grid.
Step 2: set up multiple no-manned plane routeing model under three-dimensional map.Mainly comprise the steps that
Step 2.1, set up barrier model.The obstacle of unmanned plane is divided into soft barrier and sound-hard obstacle.The softest barrier
The description hindering thing includes: the center of barrier, the operating radius of barrier, the barrier damage probability to unmanned plane.Firmly
Barrier is typically due to specific factor and limits the region that can not leap, once pass through, will damage.Sound-hard obstacle can be seen
Becoming the special circumstances of soft barrier, its description is the same with the description of soft barrier, the simply damage probability value 0 or 1 of obstacle.Always
Damage probability ω equal to each parallel damage probability ωiSuperposition, and each parallel damage probability ωiCalculating comprise with it
Serial damage probability ωijMeet following relation:
Step 2.2, set up path model.For every frame unmanned plane, feasible path can be regarded as one from starting point to end
Point, the broken line being made up of some line segments, can represent by the end points sequence of these broken lines.For avoiding with the angle being excessively sharp
Path.Use the processing method of " correction ": addition one end circular arc at sharp corner, carry out correspondence seamlessly transits process.This
The radius of individual circular arc is chosen as the min. turning radius of unmanned plane, meets the mobility constraint of unmanned plane, and ensures to constitute
Between this circular arc and two lines even tangent, replace original corner point with two point of contacts obtained.
Step 2.3, set up the state model of unmanned plane.This patent is according to the practical operation situation of unmanned plane, by unmanned plane
Divide into: ready, work, make a return voyage, 4 states out of control.
Step 2.4, set up Path Planning for Unmanned Aircraft Vehicle major constraints model.This patent selects unmanned plane vertical direction maximum to turn
Bent angle constraint, the constraint of horizontal direction maximum turning angle, maximum radius of turn constraint, the constraint of farthest flying distance, flying height are about
Bundle, special way point etc. are as the constraints carrying out routeing.Specific as follows:
(1) vertical direction maximum turning angle constraint
In formula, i represents to be currently i-th section of flight path, (xi, yi, zi) and (xi+1, yi+1, zi+1) represent current way point respectively
With the way point to be selected position coordinates in planning space, θmaxRepresent unmanned plane maximum angle of turn in vertical direction.
(2) horizontal direction maximum turning angle constraint
In formula,Represent unmanned plane maximum angle of turn in the horizontal direction.
(3) min. turning radius constraint
Ri≥Rmin
In formula, RiRadius of turn when i & lt is turned, R is carried out for planning flight pathminMaximum radius of turn for unmanned plane.
RminCalculated by following formula:
In formula, VminFor the minimum flying speed of unmanned plane, ny maxMaximum normal g-load for unmanned plane.
(4) farthest flying distance constraint
In formula, liRepresent the flying distance of i-th section of flight path, LmaxFor allowing farthest flying distance.
(5) flying height constraint
Hmin≤Hi≤Hmax
In formula, HiFor current flight height, HminHeight, H is flown for minimummaxHeight is flown for the highest.
(6) special way point
Special way point includes the charging for distributing on air route or the post house changing battery for unmanned plane, is used for improving nothing
Man-machine flying power.This type of point is regarded as special way point treat, when, after the too low warning of unmanned plane electricity, selecting corresponding nearby
Special way point, to unmanned plane battery charging or change.For just leaving the unmanned plane of special way point, to it
Carry out during routeing that it is motor-driven and flying power is considered by peak.
Step 2.5, set up multiple no-manned plane routeing mathematical model.The trajectory planning problem of multiple no-manned plane is planning space
Inside meet particular requirement, and flight Least-cost, the set of a series of flight path nodes from flight starting point to the point of flight eventually,
It is expressed as
In formula, C (p) by the cost function of planning unmanned plane during flying air route p, g (p) is constraints.
Step 3: use particle swarm optimization algorithm multiple no-manned plane routeing.Specifically include following steps:
Step 3.1, according to set up three-dimensional map under multiple no-manned plane routeing model, choose particle swarm optimization algorithm
Decision variable, and determine the bound of decision variable;
Step 3.2: according to multiple no-manned plane routeing model under the three-dimensional map set up, particle swarm optimization algorithm is set
Object function.
Step 3.3: population number in particle cluster algorithm iterative process, maximum iteration time, particle maximum flight speed are set
Degree, Studying factors, inertia weight scheduling algorithm basic parameter.
Step 3.4: under different initial condition, obtains the routeing result meeting constraint requirements by algorithm iteration.
Present invention is characterized in that
1. the multiple no-manned plane Route planner that the present invention provides realizes based on Three-dimensional Numeric Map, is not only restricted to the most unmanned
The task context of machine and working environment.By setting up different Three-dimensional Numeric Map, this method application can be realized easily
The extension of scene.
2. the present invention uses particle swarm optimization algorithm multiple no-manned plane routeing problem.Particle swarm optimization algorithm has
Do not rely on degree of the passing information of problem, need the parameter adjusted few, convergence precision high;Meanwhile, algorithm can be located simultaneously
Different constraints in reason multiple no-manned plane routeing and some particular/special requirement.
3. the present invention is when multiple no-manned plane routeing models, to some specific functions in aerial pipe platform (as given
Unmanned plane charging, the post house of replacing battery, hesitation point etc.) embodied.Therefore, the multiple no-manned plane air route that the present invention proposes
Planing method can be applicable among following unmanned plane aerial pipe platform.
Accompanying drawing explanation
Fig. 1 is the flowchart of the present invention.
Detailed description of the invention
In order to make those skilled in the art be more fully understood that the application scheme, below in conjunction with the accompanying drawing 1 in the application,
Technic relization scheme in the application is illustrated.
Step 1: set up the three-dimensional map in multiple no-manned plane routeing space.Unmanned plane during flying space is entered with data mode
Row storage, the institute being denoted as in planning space a little (x, y, set z) (x, y, z) | Xmin≤x≤Xmax, Ymin≤y≤
Ymax, Zmin≤z≤Zmax, wherein (x, y) represents the horizontal level of this point, and z is altitude data.Planning space after discretization is adopted
Digital terrain elevation data is preserved by the form of grid.
Step 2: set up multiple no-manned plane routeing model under three-dimensional map.Mainly include barrier model, path model,
Unmanned plane state model, restricted model and multiple no-manned plane routeing mathematical model.Wherein restricted model includes again vertical direction
Maximum turning angle constraint, the constraint of horizontal direction maximum turning angle, min. turning radius constraint, farthest flight-follow constraint, flight
Highly constrained and special way point etc..
Step 3: use particle swarm optimization algorithm multiple no-manned plane routeing.Specifically include selection Particle Swarm Optimization
Method decision variable also determines its bound, arranges the object function of algorithm, arrange population number in particle cluster algorithm iterative process,
Maximum iteration time, particle maximum flying speed, Studying factors, inertia weight scheduling algorithm basic parameter.Navigate for multiple no-manned plane
Circuit planning problem, the reference of particle swarm optimization algorithm major parameter arranges value and is: population population number 20~50, and algorithm is maximum
Iterations 50~100, particle maximum flying speed is the 1/10~1/5 of relevant variable hunting zone, and Studying factors is 2, used
The initial value of property weight is 0.9, and stop value is 0.4.Finally, the routeing knot of constraint requirements is met by algorithm iteration acquisition
Really.
Claims (1)
1. a multiple no-manned plane Route planner based on particle swarm optimization algorithm, mainly comprises the steps that
Step 1: set up the three-dimensional map in multiple no-manned plane routeing space.Unmanned plane during flying space is deposited with data mode
Storage, the institute being denoted as in planning space a little (x, y, set z) (x, y, z) | Xmin≤x≤Xmax, Ymin≤y≤Ymax,
Zmin≤z≤Zmax, wherein (x, y) represents the horizontal level of this point, and z is altitude data.Planning space after discretization uses grid
The form of lattice preserves digital terrain elevation data.
Step 2: set up multiple no-manned plane routeing model under three-dimensional map.Mainly comprise the steps that
Step 2.1, set up barrier model.The obstacle of unmanned plane is divided into soft barrier and sound-hard obstacle.The softest barrier
Description include: the center of barrier, the operating radius of barrier, the barrier damage probability to unmanned plane.Hard obstacle
Thing is typically due to specific factor and limits the region that can not leap, once pass through, will damage.Sound-hard obstacle can regard soft as
The special circumstances of barrier, its description is the same with the description of soft barrier, the simply damage probability value 0 or 1 of obstacle.Total damage
Hinder probability ω equal to each parallel damage probability ωiSuperposition, and each parallel damage probability ωiCalculating comprise serial with it
Damage probability ωijMeet following relation:
Step 2.2, set up path model.For every frame unmanned plane, feasible path can be regarded as one from origin-to-destination, by
The broken line of some line segments composition, can represent by the end points sequence of these broken lines.For avoiding the road with the angle being excessively sharp
Footpath,.Use the processing method of " correction ": addition one end circular arc at sharp corner, carry out correspondence seamlessly transits process.This
The radius of circular arc is chosen as the min. turning radius of unmanned plane, meets the mobility constraint of unmanned plane, and ensures that composition should
Between circular arc and two lines even tangent, replace original corner point with two point of contacts obtained
Step 2.3, set up the state model of unmanned plane.Unmanned plane, according to the practical operation situation of unmanned plane, is distinguished by this patent
For: ready, work, make a return voyage, 4 states out of control.
Step 2.4, set up Path Planning for Unmanned Aircraft Vehicle major constraints model.This patent selects unmanned plane vertical direction maximum turning angle
Retrain, horizontal direction maximum turning angle retrains, maximum radius of turn retrains, farthest flying distance retrains, flying height retrains, spy
Different way points etc. are as the constraints carrying out routeing.Specific as follows:
(1) vertical direction maximum turning angle constraint
In formula, i represents to be currently i-th section of flight path, (xi, yi, zi) and (xi+1, yi+1, zi+1) represent current way point respectively and treat
Select way point position coordinates in planning space, θmaxRepresent unmanned plane maximum angle of turn in vertical direction.
(2) horizontal direction maximum turning angle constraint
In formula,Represent unmanned plane maximum angle of turn in the horizontal direction.
(3) min. turning radius constraint
Ri≥Rmin
In formula, RiRadius of turn when i & lt is turned, R is carried out for planning flight pathminMaximum radius of turn for unmanned plane.RminBy
Following formula calculates:
In formula, VminFor the minimum flying speed of unmanned plane, nymaxMaximum normal g-load for unmanned plane.
(4) farthest flying distance constraint
In formula, liRepresent the flying distance of i-th section of flight path, LmaxFor allowing farthest flying distance.
(5) flying height constraint
Hmin≤Hi≤Hmax
In formula, HiFor current flight height, HminHeight, H is flown for minimummaxHeight is flown for the highest.
(6) special way point
Special way point includes the charging for distributing on air route or the post house changing battery for unmanned plane, is used for improving unmanned plane
Flying power.This type of point is regarded as special way point treat, when, after the too low warning of unmanned plane electricity, selecting corresponding special nearby
Different way point, to the charging of unmanned plane battery or replacing.For just leaving the unmanned plane of special way point, it is being carried out
During routeing, it is motor-driven and flying power is pressed peak and considered.
Step 2.5, set up multiple no-manned plane routeing mathematical model.The trajectory planning problem of multiple no-manned plane is full in planning space
Foot particular requirement, and flight Least-cost, the set of a series of flight path nodes from flight starting point to the point of flight eventually, represent
For
In formula, C (p) by the cost function of planning unmanned plane during flying air route p, g (p) is constraints.
Step 3: use particle swarm optimization algorithm multiple no-manned plane routeing.Specifically include following steps:
Step 3.1, according to set up three-dimensional map under multiple no-manned plane routeing model, choose the decision-making of particle swarm optimization algorithm
Variable, and determine the bound of decision variable;
Step 3.2: according to multiple no-manned plane routeing model under the three-dimensional map set up, the target of particle swarm optimization algorithm is set
Function.
Step 3.3: population number in particle cluster algorithm iterative process, maximum iteration time, particle maximum flying speed, are set
Practise the factor, inertia weight scheduling algorithm basic parameter.
Step 3.4: under different initial condition, obtains the routeing result meeting constraint requirements by algorithm iteration.
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610135573.4A CN105841702A (en) | 2016-03-10 | 2016-03-10 | Method for planning routes of multi-unmanned aerial vehicles based on particle swarm optimization algorithm |
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
CN201610135573.4A CN105841702A (en) | 2016-03-10 | 2016-03-10 | Method for planning routes of multi-unmanned aerial vehicles based on particle swarm optimization algorithm |
Publications (1)
Publication Number | Publication Date |
---|---|
CN105841702A true CN105841702A (en) | 2016-08-10 |
Family
ID=56587789
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201610135573.4A Pending CN105841702A (en) | 2016-03-10 | 2016-03-10 | Method for planning routes of multi-unmanned aerial vehicles based on particle swarm optimization algorithm |
Country Status (1)
Country | Link |
---|---|
CN (1) | CN105841702A (en) |
Cited By (29)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN106908066A (en) * | 2017-04-25 | 2017-06-30 | 西安电子科技大学 | The path planning method of the unmanned plane monitoring covering single step optimizing based on genetic algorithm |
CN106959700A (en) * | 2017-03-21 | 2017-07-18 | 北京航空航天大学 | A kind of unmanned aerial vehicle group collaboration patrol tracing path planing method based on upper limit confidential interval algorithm |
CN106996789A (en) * | 2017-03-24 | 2017-08-01 | 西安电子科技大学 | A kind of Route planner of many airborne radar collaboration detections |
CN107063255A (en) * | 2017-01-09 | 2017-08-18 | 北京工业大学 | A kind of three-dimensional Route planner based on improvement drosophila optimized algorithm |
CN107677275A (en) * | 2017-09-15 | 2018-02-09 | 北京航空航天大学 | The heterogeneous aircraft paths planning method in one kind mixing spatial domain and device |
CN108204814A (en) * | 2016-12-20 | 2018-06-26 | 南京理工大学 | No-manned plane three-dimensional scenario path navigation platform and its three-dimensional modified two-step method planing method |
CN108731684A (en) * | 2018-05-07 | 2018-11-02 | 西安电子科技大学 | A kind of Route planner of multiple no-manned plane Cooperative Area monitoring |
CN109215398A (en) * | 2018-11-05 | 2019-01-15 | 飞牛智能科技(南京)有限公司 | A kind of Path Planning for UAV and device |
CN109631900A (en) * | 2018-12-24 | 2019-04-16 | 中国矿业大学 | A kind of no-manned plane three-dimensional track multi-objective particle swarm Global Planning |
CN109683630A (en) * | 2019-01-25 | 2019-04-26 | 南京邮电大学 | Unmanned aerial vehicle flight path planing method based on population and PRM algorithm |
CN110362098A (en) * | 2018-03-26 | 2019-10-22 | 北京京东尚科信息技术有限公司 | Unmanned plane vision method of servo-controlling, device and unmanned plane |
CN110411458A (en) * | 2019-08-30 | 2019-11-05 | 深圳市道通智能航空技术有限公司 | Flight course planning method and unmanned vehicle |
CN110544296A (en) * | 2019-07-31 | 2019-12-06 | 中国矿业大学 | intelligent planning method for three-dimensional global flight path of unmanned aerial vehicle in environment with uncertain enemy threat |
CN110598926A (en) * | 2019-09-04 | 2019-12-20 | 中国航空工业集团公司沈阳飞机设计研究所 | Aircraft collaborative route planning method |
CN110617818A (en) * | 2019-10-15 | 2019-12-27 | 中国人民解放军军事科学院国防科技创新研究院 | Unmanned aerial vehicle track generation method |
CN110659771A (en) * | 2019-09-04 | 2020-01-07 | 中国航空工业集团公司沈阳飞机设计研究所 | Aircraft collaborative route planning method |
CN110967016A (en) * | 2019-11-22 | 2020-04-07 | 中国人民解放军63629部队 | Off-line planning method and device for aircraft route and computer equipment |
CN111536979A (en) * | 2020-07-08 | 2020-08-14 | 浙江浙能天然气运行有限公司 | Unmanned aerial vehicle routing inspection path planning method based on random optimization |
CN112034880A (en) * | 2020-06-11 | 2020-12-04 | 南京航空航天大学 | Novel multi-unmanned aerial vehicle collaborative route planning method |
CN112214930A (en) * | 2020-09-29 | 2021-01-12 | 中国航空工业集团公司沈阳飞机设计研究所 | Multi-machine collaborative route planning method and system based on collaborative particle swarm optimization algorithm |
CN112230678A (en) * | 2020-10-29 | 2021-01-15 | 皖江工学院 | Three-dimensional unmanned aerial vehicle path planning method and planning system based on particle swarm optimization |
CN112491094A (en) * | 2020-11-19 | 2021-03-12 | 南方电网数字电网研究院有限公司 | Hybrid-driven microgrid energy management method, system and device |
CN112650292A (en) * | 2020-12-29 | 2021-04-13 | 中国计量大学 | Multi-unmanned aerial vehicle path optimization method for industrial park pollution source monitoring |
CN112711267A (en) * | 2020-04-24 | 2021-04-27 | 江苏方天电力技术有限公司 | Unmanned aerial vehicle autonomous inspection method based on RTK high-precision positioning and machine vision fusion |
CN113483764A (en) * | 2021-07-07 | 2021-10-08 | 哈尔滨工业大学 | Intelligent aircraft task path planning method based on online sensing |
CN113900449A (en) * | 2021-10-26 | 2022-01-07 | 鹏城实验室 | Multi-unmanned aerial vehicle trajectory planning method and device, unmanned aerial vehicle and storage medium |
CN115930973A (en) * | 2023-02-08 | 2023-04-07 | 中国民航大学 | Unmanned aerial vehicle route planning method and device |
CN116126032A (en) * | 2023-04-17 | 2023-05-16 | 华南农业大学 | Unmanned aerial vehicle group path planning method based on improved multi-objective evolutionary algorithm |
CN116842736A (en) * | 2023-07-05 | 2023-10-03 | 中国人民解放军92728部队 | Route planning method based on particle targets |
Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7158877B2 (en) * | 2003-03-27 | 2007-01-02 | Saab Ab | Waypoint navigation |
CN103471592A (en) * | 2013-06-08 | 2013-12-25 | 哈尔滨工程大学 | Multi-unmanned aerial vehicle route planning method based on bee colony collaborative foraging algorithm |
EP2711913A2 (en) * | 2012-09-20 | 2014-03-26 | The Boeing Company | Optimized flight plan management system |
CN104406593A (en) * | 2014-12-03 | 2015-03-11 | 广西民族大学 | Method for determining optimal route of airway of unmanned aerial vehicle |
-
2016
- 2016-03-10 CN CN201610135573.4A patent/CN105841702A/en active Pending
Patent Citations (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US7158877B2 (en) * | 2003-03-27 | 2007-01-02 | Saab Ab | Waypoint navigation |
EP2711913A2 (en) * | 2012-09-20 | 2014-03-26 | The Boeing Company | Optimized flight plan management system |
CN103471592A (en) * | 2013-06-08 | 2013-12-25 | 哈尔滨工程大学 | Multi-unmanned aerial vehicle route planning method based on bee colony collaborative foraging algorithm |
CN104406593A (en) * | 2014-12-03 | 2015-03-11 | 广西民族大学 | Method for determining optimal route of airway of unmanned aerial vehicle |
Non-Patent Citations (2)
Title |
---|
李子杰等: "基于进化算法的多无人机协同航路规划", 《火力与指挥控制》 * |
林林等: "多无人机协同航路规划研究", 《北京邮电大学学报》 * |
Cited By (43)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN108204814A (en) * | 2016-12-20 | 2018-06-26 | 南京理工大学 | No-manned plane three-dimensional scenario path navigation platform and its three-dimensional modified two-step method planing method |
CN107063255A (en) * | 2017-01-09 | 2017-08-18 | 北京工业大学 | A kind of three-dimensional Route planner based on improvement drosophila optimized algorithm |
CN107063255B (en) * | 2017-01-09 | 2020-10-30 | 北京工业大学 | Three-dimensional route planning method based on improved drosophila optimization algorithm |
CN106959700B (en) * | 2017-03-21 | 2019-08-27 | 北京航空航天大学 | A kind of unmanned aerial vehicle group collaboration patrol tracing path planing method based on upper limit confidence interval algorithm |
CN106959700A (en) * | 2017-03-21 | 2017-07-18 | 北京航空航天大学 | A kind of unmanned aerial vehicle group collaboration patrol tracing path planing method based on upper limit confidential interval algorithm |
CN106996789A (en) * | 2017-03-24 | 2017-08-01 | 西安电子科技大学 | A kind of Route planner of many airborne radar collaboration detections |
CN106996789B (en) * | 2017-03-24 | 2020-05-05 | 西安电子科技大学 | Multi-airborne radar cooperative detection airway planning method |
CN106908066B (en) * | 2017-04-25 | 2019-12-20 | 西安电子科技大学 | Unmanned aerial vehicle monitoring covering single-step optimization flight path planning method based on genetic algorithm |
CN106908066A (en) * | 2017-04-25 | 2017-06-30 | 西安电子科技大学 | The path planning method of the unmanned plane monitoring covering single step optimizing based on genetic algorithm |
CN107677275A (en) * | 2017-09-15 | 2018-02-09 | 北京航空航天大学 | The heterogeneous aircraft paths planning method in one kind mixing spatial domain and device |
CN110362098A (en) * | 2018-03-26 | 2019-10-22 | 北京京东尚科信息技术有限公司 | Unmanned plane vision method of servo-controlling, device and unmanned plane |
CN110362098B (en) * | 2018-03-26 | 2022-07-05 | 北京京东尚科信息技术有限公司 | Unmanned aerial vehicle visual servo control method and device and unmanned aerial vehicle |
CN108731684A (en) * | 2018-05-07 | 2018-11-02 | 西安电子科技大学 | A kind of Route planner of multiple no-manned plane Cooperative Area monitoring |
CN109215398A (en) * | 2018-11-05 | 2019-01-15 | 飞牛智能科技(南京)有限公司 | A kind of Path Planning for UAV and device |
CN109631900A (en) * | 2018-12-24 | 2019-04-16 | 中国矿业大学 | A kind of no-manned plane three-dimensional track multi-objective particle swarm Global Planning |
CN109631900B (en) * | 2018-12-24 | 2022-08-26 | 中国矿业大学 | Unmanned aerial vehicle three-dimensional flight path multi-target particle swarm global planning method |
CN109683630B (en) * | 2019-01-25 | 2021-11-09 | 南京邮电大学 | Unmanned aerial vehicle flight path planning method based on particle swarm optimization and PRM algorithm |
CN109683630A (en) * | 2019-01-25 | 2019-04-26 | 南京邮电大学 | Unmanned aerial vehicle flight path planing method based on population and PRM algorithm |
CN110544296A (en) * | 2019-07-31 | 2019-12-06 | 中国矿业大学 | intelligent planning method for three-dimensional global flight path of unmanned aerial vehicle in environment with uncertain enemy threat |
CN110544296B (en) * | 2019-07-31 | 2023-05-30 | 中国矿业大学 | Intelligent planning method for three-dimensional global track of unmanned aerial vehicle in uncertain enemy threat environment |
CN110411458B (en) * | 2019-08-30 | 2021-11-09 | 深圳市道通智能航空技术股份有限公司 | Air route planning method and unmanned aerial vehicle |
WO2021037046A1 (en) * | 2019-08-30 | 2021-03-04 | 深圳市道通智能航空技术有限公司 | Route planning method and unmanned aerial vehicle |
CN110411458A (en) * | 2019-08-30 | 2019-11-05 | 深圳市道通智能航空技术有限公司 | Flight course planning method and unmanned vehicle |
CN110659771B (en) * | 2019-09-04 | 2022-11-22 | 中国航空工业集团公司沈阳飞机设计研究所 | Aircraft collaborative route planning method |
CN110598926A (en) * | 2019-09-04 | 2019-12-20 | 中国航空工业集团公司沈阳飞机设计研究所 | Aircraft collaborative route planning method |
CN110659771A (en) * | 2019-09-04 | 2020-01-07 | 中国航空工业集团公司沈阳飞机设计研究所 | Aircraft collaborative route planning method |
CN110617818A (en) * | 2019-10-15 | 2019-12-27 | 中国人民解放军军事科学院国防科技创新研究院 | Unmanned aerial vehicle track generation method |
CN110967016A (en) * | 2019-11-22 | 2020-04-07 | 中国人民解放军63629部队 | Off-line planning method and device for aircraft route and computer equipment |
CN112711267A (en) * | 2020-04-24 | 2021-04-27 | 江苏方天电力技术有限公司 | Unmanned aerial vehicle autonomous inspection method based on RTK high-precision positioning and machine vision fusion |
CN112034880A (en) * | 2020-06-11 | 2020-12-04 | 南京航空航天大学 | Novel multi-unmanned aerial vehicle collaborative route planning method |
CN111536979A (en) * | 2020-07-08 | 2020-08-14 | 浙江浙能天然气运行有限公司 | Unmanned aerial vehicle routing inspection path planning method based on random optimization |
CN112214930A (en) * | 2020-09-29 | 2021-01-12 | 中国航空工业集团公司沈阳飞机设计研究所 | Multi-machine collaborative route planning method and system based on collaborative particle swarm optimization algorithm |
CN112230678A (en) * | 2020-10-29 | 2021-01-15 | 皖江工学院 | Three-dimensional unmanned aerial vehicle path planning method and planning system based on particle swarm optimization |
CN112491094A (en) * | 2020-11-19 | 2021-03-12 | 南方电网数字电网研究院有限公司 | Hybrid-driven microgrid energy management method, system and device |
CN112650292B (en) * | 2020-12-29 | 2022-04-22 | 中国计量大学 | Multi-unmanned aerial vehicle path optimization method for industrial park pollution source monitoring |
CN112650292A (en) * | 2020-12-29 | 2021-04-13 | 中国计量大学 | Multi-unmanned aerial vehicle path optimization method for industrial park pollution source monitoring |
CN113483764A (en) * | 2021-07-07 | 2021-10-08 | 哈尔滨工业大学 | Intelligent aircraft task path planning method based on online sensing |
CN113900449A (en) * | 2021-10-26 | 2022-01-07 | 鹏城实验室 | Multi-unmanned aerial vehicle trajectory planning method and device, unmanned aerial vehicle and storage medium |
CN113900449B (en) * | 2021-10-26 | 2023-12-22 | 鹏城实验室 | Multi-unmanned aerial vehicle track planning method and device, unmanned aerial vehicle and storage medium |
CN115930973A (en) * | 2023-02-08 | 2023-04-07 | 中国民航大学 | Unmanned aerial vehicle route planning method and device |
CN115930973B (en) * | 2023-02-08 | 2023-07-14 | 中国民航大学 | Unmanned aerial vehicle route planning method and device |
CN116126032A (en) * | 2023-04-17 | 2023-05-16 | 华南农业大学 | Unmanned aerial vehicle group path planning method based on improved multi-objective evolutionary algorithm |
CN116842736A (en) * | 2023-07-05 | 2023-10-03 | 中国人民解放军92728部队 | Route planning method based on particle targets |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN105841702A (en) | Method for planning routes of multi-unmanned aerial vehicles based on particle swarm optimization algorithm | |
CN107807665B (en) | Unmanned aerial vehicle formation detection task cooperative allocation method and device | |
CN110428111B (en) | UAV/UGV (unmanned aerial vehicle/user generated Union vector) cooperative long-time multitask operation trajectory planning method | |
CN108229719B (en) | Multi-objective optimization method and device for unmanned aerial vehicle formation task allocation and flight path planning | |
CN110320930B (en) | Reliable transformation method for formation of multiple unmanned aerial vehicles based on Voronoi diagram | |
CN110488859B (en) | Unmanned aerial vehicle route planning method based on improved Q-learning algorithm | |
CN108958285B (en) | Efficient multi-unmanned aerial vehicle collaborative track planning method based on decomposition idea | |
CN110530388B (en) | Multi-AGV path planning method and system | |
CN106197426A (en) | A kind of unmanned plane emergency communication paths planning method and system | |
Edison et al. | Integrated task assignment and path optimization for cooperating uninhabited aerial vehicles using genetic algorithms | |
CN107977743B (en) | Multi-unmanned aerial vehicle cooperative task allocation method and device | |
CN110766254A (en) | Multi-unmanned aerial vehicle cooperative task allocation method based on improved genetic algorithm | |
CN104991895A (en) | Low-altitude rescue aircraft route planning method based on three dimensional airspace grids | |
CN105043379B (en) | A kind of scenic spot browse path planing method based on space-time restriction, device | |
CN105700549A (en) | Unmanned plane multi-track planning method based on sequence ecological niche PSO (particle swarm optimization) algorithm | |
CN107622327A (en) | Multiple no-manned plane path planning method based on cultural ant colony search mechanisms | |
CN106774331A (en) | A kind of distributed AC servo system unmanned boat cluster sub-clustering formation method | |
CN109917811A (en) | Unmanned aerial vehicle cluster cooperative obstacle avoidance-reconstruction processing method | |
CN103699135A (en) | Automatic planning method for flight path of unmanned helicopter for spraying pesticide in farmland operation area | |
CN104700165A (en) | Multi-UAV (unmanned aerial vehicle) helicopter and warship cooperating path planning method | |
CN109506654A (en) | Low latitude Route planner and device, aircraft | |
Hu et al. | Multi-UAV coverage path planning: A distributed online cooperation method | |
Liu et al. | Study on UAV parallel planning system for transmission line project acceptance under the background of industry 5.0 | |
CN111580561A (en) | Unmanned aerial vehicle scheduling method and system based on particle swarm optimization and readable storage medium | |
CN111813144B (en) | Multi-unmanned aerial vehicle collaborative route planning method based on improved flocks of sheep algorithm |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
C06 | Publication | ||
PB01 | Publication | ||
C10 | Entry into substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20160810 |
|
WD01 | Invention patent application deemed withdrawn after publication |