CN111895998A - Large-scale fixed-wing unmanned aerial vehicle segmented stack type route planning method - Google Patents
Large-scale fixed-wing unmanned aerial vehicle segmented stack type route planning method Download PDFInfo
- Publication number
- CN111895998A CN111895998A CN202010554052.9A CN202010554052A CN111895998A CN 111895998 A CN111895998 A CN 111895998A CN 202010554052 A CN202010554052 A CN 202010554052A CN 111895998 A CN111895998 A CN 111895998A
- Authority
- CN
- China
- Prior art keywords
- route
- flight
- unmanned aerial
- aerial vehicle
- stacking
- 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.)
- Granted
Links
Images
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
Abstract
The application relates to the technical field of unmanned aerial vehicles, and discloses a large-scale fixed wing unmanned aerial vehicle segmentation stack formula route planning method, can effectual improvement planning work efficiency itself, the time of revising the adjustment in a large number of iterations has been reduced, and, adopt the planning data that this method obtained to compare with actual flight result, accuracy when navigating can be reduced to within 1% by original 10% left and right sides error, consequently, the coincidence degree of corresponding planning data and the actual flight data of journey and oil consumption has also obtained great promotion.
Description
Technical Field
The application relates to the technical field of unmanned aerial vehicles, in particular to a large-scale fixed-wing unmanned aerial vehicle segmented stack type route planning method.
Background
Early course planning for large fixed-wing unmanned aerial vehicles was performed with simple additional tasks such as simple straight lines and hovering in small areas. With the increasing maturity of aircraft technology, the unmanned aerial vehicle test flight faces the brand-new challenges different from human-machine test flight, such as long dead time, wide task area, complex flight environment, airspace use conflict, how to effectively utilize the existing resources such as aircraft, stations, chains, airspace and the like in the test flight process, efficiently completes verification including tasks such as aircraft platform verification, aerial reconnaissance monitoring, communication relay, anti-latency, electronic interference, air combat drilling and the like, reduces the number of times of the unmanned aerial vehicle in the test flight process as much as possible, improves the test flight safety, and meets the requirements of development of an air route planning method.
At present, the domestic air route planning method mainly comprises the steps of rotating to and fro in repeated air routes in an available airspace, adding flight tasks as much as possible in the rotating process, as shown in figure 1, enabling an airplane to enter the airspace for flying according to a specified route after taking off, and completing the flight tasks required to be executed in repeated rotation. Therefore, the above method has the following disadvantages: (1) a large number of mission-free flat flight sections and connection sections waste valuable flight time and flight number; (2) when complex flight tasks are carried out, such as task load use, reconnaissance, attack and the like, the situation of repeated derivation iteration for many times can occur, and the efficiency of planning work per se is influenced; (3) the derived data obtained by planning with the existing method, such as flight time, oil consumption and the like, have larger deviation from the actual value, not only influence the flight efficiency, but also increase the difficulty and risk for navigation management coordination, thereby having negative influence on the air flight safety.
Disclosure of Invention
In order to overcome the problems and the defects in the prior art, the application provides a large-scale fixed-wing unmanned aerial vehicle segmented stacking type route planning method aiming at the problems that planning data information acquired by the existing extensive planning method has larger access with an actual flight result and leads to a large number of air meaningless sections, so that the flight time and the flight number are wasted.
In order to realize the purpose of the invention, the method develops the route planning work according to the following steps:
a large-scale fixed-wing unmanned aerial vehicle subsection stack type route planning method specifically comprises the following steps:
s1, classifying the whole air flight state of the unmanned aerial vehicle in detail:
setting points of the unmanned aerial vehicle, which need to be subjected to manual parameter setting so as to realize flight state change, as segmentation points of the air route, setting the air section between every two adjacent segmentation points as an air section to be calculated, and determining a leading calculation parameter of each air section to be calculated;
s2, carrying out segmentation calculation on the to-be-calculated flight segment between the segmentation points:
accurately calculating basic information and expansion information of each classified flight segment according to the leading parameters of the flight segment to be calculated among each segmentation point and the performance index parameters of the unmanned aerial vehicle;
s3, drawing a complete aerial route map in a stacking mode:
drawing a complete air route map in a stacking mode in the usable area according to the result of the segmented calculation in the step S2 and the air management information of the flight airspace;
s4, position information of nodes of the navigation road map is deduced in detail:
according to the sectional information in the navigation map, with the actually mapped airport ground point information as a reference, deriving the geographical position information of all actual navigation points in the airspace, and giving corresponding control parameters except the position information to each navigation point;
and S5, data inspection and correction.
And finally checking and correcting the planning data and the air route information generated in the planning process, and perfecting the binding data used by the unmanned aerial vehicle and the flight reference data used by the flight decision.
Preferably, in step S3, the rout graph stack specifically includes the following steps:
s3.1, firstly, drawing an airport according to the known airport points;
s3.2, stacking a take-off and landing route:
designing a takeoff route: calculating corresponding range according to the climbing rate of the airplane, and stacking takeoff and departure routes under the condition of considering course adjustment;
designing a landing route: calculating the horizontal distance from the point where the airplane starts to glide down to the landing point according to the landing point position, the glide angle of the descending control of the airplane, the initial height of the airplane starting to enter the near-path landing glide and the available trigonometric function relation, stacking the landing routes in sequence, and then stacking the landing routes from the homing point to the initial point of the landing route of the airplane and accessing the routes from the airport to the initial point of the landing route of the airplane;
s3.3. Stack task area route:
and arranging and stacking in sequence according to the calculated effective range of the effective range according to the sequence of the heights.
Preferably, in step S1, the dominant calculation parameter is a relatively fixed main calculation parameter in the flight segment to be calculated, and if there is no fixed calculation parameter, the average value of the main variables is taken as the dominant calculation parameter.
Preferably, in step S4, according to the longitude and latitude coordinates of the known initial point, the aircraft heading and the flight distance, the longitude and latitude lines of the earth distributed in the ellipsoid are respectively calculated by the arc value, so as to calculate the longitude and latitude position information of the target position.
Preferably, in step S3.3, a linking leg is added during stacking, if necessary.
The beneficial effect of this application:
(1) the routing in this application provides flexibility in that building routes in a stack allows the flight routes to be extended or combined in any desired manner within the available airspace.
(2) The route planning in the application is simplified, and the route is constructed in a stacking mode, so that the proportion of effective routes in the route is greatly increased, the effective time of each route can be optimized, and the overall route effectiveness can be greatly improved.
(3) The method can effectively improve the efficiency of planning work per se, reduces a large amount of time for repeatedly revising and adjusting, and compared with the actual flight result, the accuracy of the flight can be reduced to within 1% from the original error of about 10% by adopting the method, so that the conformity between the planning data of corresponding flight and oil consumption and the actual flight data is greatly improved.
Drawings
FIG. 1 is an example of a prior art planning method route diagram;
fig. 2 is an example of a route chart of the planning method of the present application.
Detailed Description
The present application will be described in further detail with reference to examples, but the embodiments of the present application are not limited thereto.
The embodiment discloses a large-scale fixed-wing unmanned aerial vehicle segmented stack type route planning method, which specifically comprises the following steps:
s1, classifying the whole air flight state of the unmanned aerial vehicle in detail:
under the condition that the position of the unmanned aerial vehicle changes, all flight changes related to conditions that the unmanned aerial vehicle needs to manually set parameters to control the flight state, such as height, speed, attitude, flight state, task point switching and the like, are set as segmentation points of the airway, namely points, where the unmanned aerial vehicle needs to manually set parameters to realize the flight state change, are set as segmentation points of the airway, and further, the airway between every two adjacent airway segmentation points is a segment to be calculated, and the dominant calculation parameter of each airway to be calculated is determined;
s2, carrying out segmentation calculation on the to-be-calculated flight segment between the segmentation points:
accurately calculating basic information and expansion information of each classified flight segment according to the leading parameters of the flight segment to be calculated among each segmentation point and the performance index parameters of the unmanned aerial vehicle;
s3, drawing a complete aerial route map in a stacking mode:
drawing a complete air route map in a stacking mode in the usable area according to the result of the segmented calculation in the step S2 and the air management information of the flight airspace;
s4, position information of nodes of the navigation road map is deduced in detail:
according to the sectional information in the navigation map, with the actually mapped airport ground point information as a reference, deriving the geographical position information of all actual navigation points in the airspace, and giving corresponding control parameters except the position information to each navigation point;
and S5, data inspection and correction.
And finally checking and correcting the planning data and the air route information generated in the planning process, and perfecting the binding data used by the unmanned aerial vehicle and the flight reference data used by the flight decision.
Further, in step S3, referring to fig. 2 for explanation, the routemark stack specifically includes the following steps:
s3.1, firstly, drawing an airport according to the known airport points 1 and 2 in the known map;
s3.2, stacking a take-off and landing route:
designing a takeoff route: since the flight control requires that the aircraft must depart from the airspace at a height of 5700m at 7 points and enter the mission airspace, the flight path stack of takeoff and departure is performed in consideration of the course adjustment according to the course calculated from the aircraft climb rate in step S2, i.e., 1 → 2 → 3 → 4 → 5 → 6 → 7 in fig. 2. In the process, the aircraft finishes the climbing at the height of 5700m, and the heading is adjusted to pass through an exit point to enter a mission airspace from a local airspace.
Designing a landing route: according to the requirement of air traffic control, the airplane also needs to descend after 7 points return at 5700m and complete the standard five-sided flight and then land. Therefore, according to the g point position of the landing point, the glide angle of the descending control of the airplane, the initial height of the airplane starting to enter the approach landing glide and the available trigonometric function relation, the horizontal distance from the f point of the starting glide point of the airplane to the g point of the landing point is calculated, and the landing route g → f → e → d → c → b → a is stacked in sequence, then the descending height from the homing point to the a point of the initial point of the landing route of the airplane is stacked, and the route accessing the a point of the initial point of the landing route of the airplane is accessed in the approach, as shown in FIG. 2: 45 → 46 → 47 → 48 → 49 → 50 → 51 → 52 → 53 → a;
s3.3. Stack task area route:
the effective voyages of the effective voyage segments calculated in step S2 are arranged in the order of height and stacked in turn, and if necessary, the engaged voyage segments are added in the stacking process, as shown in fig. 2, 7 → 8 → 9 → 10 → … → 42 → 43 → 44 → 45.
The mission area routes in FIG. 2 are described briefly below:
7 → 8 → 9 → 10 → 11 → 12 plane climbs from 5700m to 7000m, because the distance of the straight line connecting segment from 7 to 12 does not meet the requirement of climbing distance according to calculation, thus stacking the flight line of such a turn; combining the aircraft climbing requirement and the task load requirement for the flight calibration, designing a flight path 12 → 13 → 14 → 15 → 16 → 17 for the aircraft climbing from 7000m to 8000m and carrying out the task load calibration for the flight calibration at points 13 → 14, 15 → 16; similarly, the aircraft is designed to climb from 8000m to 10000m route 17 → 18 → 19 → 20, from 10000m to 11000m route 20 → 21 → 22, from 11000m to 12000m route 22 → 23 → 24; 24 → 25 → 26 stacking the airplane out of the airplane to adjust the speed to 265 at the height of 12000m and level flight state data acquisition route at the timing of 265 speed point; 26 → 27 → 28 stacking the aircraft to adjust the speed to 250 and accelerate the straight line segment to 300 for the test acceleration pattern; 28 → 29 → 30 → 31 → 32 stacking out the climbing segment that the airplane climbs to 13000 m; 32 → 33 → 34 → 35 → 36 stack plane at 13000m mission route (not shown); 36 → 37 → 38 stack plane descends from 13000m to 6500m descending route; 38 → 39 → 40 stack plane descends 6500m to a descending route of 5700m homing altitude and approaches the homing point as close as possible. The rest is omitted.
The above is the process of air route map stacking.
Further, in step S3.2, the design of the departure route and the design of the approach route are also included.
Further, in the design of the landing route, f point is a glide starting point, g point is a landing point, h is the height of the glide starting point, L is the distance of the glide section, and α is the glide angle, so that the trigonometric function relationship can be used specifically to obtain the glide section distance L by using the known glide starting point height h and the known glide angle α and using trigonometric function solution, that is, the distance L is the distance L of the glide section, that is, the distance L is obtained
Further, in step S1, the leading calculation parameter should be a relatively fixed main calculation parameter in the flight segment to be calculated, for example, the leading calculation parameter of the climbing segment with the fixed climbing rate should be the climbing rate of the corresponding altitude of the unmanned aerial vehicle, the leading calculation parameter of the descending segment is the descending rate, and the leading calculation parameter of the level flight segment is the true speed corresponding to the binding speed; if the calculation parameters are not fixed, such as an acceleration section or a deceleration section, the average value of the main variables is taken as the dominant calculation parameter, such as the average value of the initial speed of the acceleration and deceleration section and the speed after the acceleration and deceleration is finished.
Further, in step S2, the performance index parameters of the unmanned aerial vehicle mainly include: the method comprises the following steps of automatically controlling climbing rate of an airplane under different standard air pressure altitudes, automatically controlling descending rate of the airplane under different standard air pressure altitudes, automatically controlling turning radius of the airplane under different real speeds, automatically controlling a glide angle of the airplane in a near diameter stage, average automatically controlling speed of the airplane after the airplane is added into a landing route, automatically controlling oil consumption rate of the airplane under different altitudes and different real speeds, and using an air-slide forced landing ratio when the airplane is automatically subjected to air-slide forced landing.
Further, in step S2, the basic information mainly refers to the voyage data and the time-of-flight data of the unmanned aerial vehicle.
Further, in step S2, the expansion information is data calculated by the basic information, theoretically, after the route planning completes setting all parameters, the flight distance, flight time consumption (total time consumption or sectional time consumption), flight oil consumption (total oil consumption or sectional oil consumption), and arrival time and other information of each position of the aircraft flying in the air can be calculated according to the basic information, and what the expansion information is mainly determined by the actual flight requirement, and the specific demand parties are generally pilots, flight commanders, navigation management systems, flight organization parties and the like.
Further, in step S4, according to the longitude and latitude coordinates of the known initial point, the aircraft heading and the flight distance, the longitude and latitude lines of the earth distributed in the ellipsoid are respectively subjected to arc value calculation, and the longitude and latitude position information of the target position is calculated. In actual practice, the above-described process is usually implemented by software.
Further, in step S5, the planning data generated in the planning process mainly includes two parts, the first part is to arrange the parameter of each flight state control point according to the flight sequence of the flight plan to obtain the state data, and the second part is to derive the position information of all the actual waypoints in the airspace.
In the description of the present application, it is to be understood that the terms "center", "longitudinal", "lateral", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", and the like indicate orientations or positional relationships based on those shown in the drawings, and are used merely for convenience in describing the present application and for simplifying the description, and do not indicate or imply that the referenced device or element must have a particular orientation, be constructed in a particular orientation, and be operated, and therefore should not be construed as limiting the scope of the present application.
The foregoing is directed to embodiments of the present invention, which are not limited thereto, and any simple modifications and equivalents thereof according to the technical spirit of the present invention may be made within the scope of the present invention.
Claims (5)
1. A large-scale fixed wing unmanned vehicles segmentation stack formula route planning method which characterized in that: the method specifically comprises the following steps:
s1, classifying the whole air flight state of the unmanned aerial vehicle in detail:
setting points of the unmanned aerial vehicle, which need to be subjected to manual parameter setting so as to realize flight state change, as segmentation points of the air route, setting the air section between every two adjacent segmentation points as an air section to be calculated, and determining a leading calculation parameter of each air section to be calculated;
s2, carrying out segmentation calculation on the to-be-calculated flight segment between the segmentation points:
accurately calculating basic information and expansion information of each classified flight segment according to the leading parameters of the flight segment to be calculated among each segmentation point and the performance index parameters of the unmanned aerial vehicle;
s3, drawing a complete aerial route map in a stacking mode:
drawing a complete air route map in a stacking mode in the usable area according to the result of the segmented calculation in the step S2 and the air management information of the flight airspace;
s4, position information of nodes of the navigation road map is deduced in detail:
according to the sectional information in the navigation map, with the actually mapped airport ground point information as a reference, deriving the geographical position information of all actual navigation points in the airspace, and giving corresponding control parameters except the position information to each navigation point;
s5, data inspection and correction:
and finally checking and correcting the planning data and the air route information generated in the planning process, and perfecting the binding data used by the unmanned aerial vehicle and the flight reference data used by the flight decision.
2. The method for planning the sectional stacking type route of the large-scale fixed-wing unmanned aerial vehicle according to claim 1, wherein the method comprises the following steps: in step S3, the routing diagram stack specifically includes the following steps:
s3.1, firstly, drawing an airport according to the known airport points;
s3.2, stacking a take-off and landing route:
designing a takeoff route: calculating corresponding range according to the climbing rate of the airplane, and stacking takeoff and departure routes under the condition of considering course adjustment;
designing a landing route: calculating the horizontal distance from the point where the airplane starts to glide down to the landing point according to the landing point position, the glide angle of the descending control of the airplane, the initial height of the airplane starting to enter the near-path landing glide and the available trigonometric function relation, stacking the landing routes in sequence, and then stacking the landing routes from the homing point to the initial point of the landing route of the airplane and accessing the routes from the airport to the initial point of the landing route of the airplane;
s3.3. Stack task area route:
and arranging and stacking in sequence according to the calculated effective range of the effective range according to the sequence of the heights.
3. The method for planning the sectional stacking type route of the large-scale fixed-wing unmanned aerial vehicle according to claim 1, wherein the method comprises the following steps: in the step S1, the dominant calculation parameter is a relatively fixed main calculation parameter in the flight segment to be calculated, and if there is no fixed calculation parameter, the average value of the main variables is taken as the dominant calculation parameter.
4. The method for planning the sectional stacking type route of the large-scale fixed-wing unmanned aerial vehicle according to claim 1, wherein the method comprises the following steps: in step S4, according to the longitude and latitude coordinates of the known initial point, the aircraft heading and the flight distance, the longitude and latitude lines of the earth distributed on the ellipsoid are respectively subjected to arc value calculation, and the longitude and latitude position information of the target position is calculated.
5. The large-scale fixed-wing unmanned aerial vehicle segmented stack route planning method according to claim 1, characterized in that: in step S3.3, a linking leg is added during stacking, if necessary.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010554052.9A CN111895998B (en) | 2020-06-17 | 2020-06-17 | Segmented stacking type route planning method for large-scale fixed-wing unmanned aerial vehicle |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010554052.9A CN111895998B (en) | 2020-06-17 | 2020-06-17 | Segmented stacking type route planning method for large-scale fixed-wing unmanned aerial vehicle |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111895998A true CN111895998A (en) | 2020-11-06 |
| CN111895998B CN111895998B (en) | 2022-07-15 |
Family
ID=73207657
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010554052.9A Active CN111895998B (en) | 2020-06-17 | 2020-06-17 | Segmented stacking type route planning method for large-scale fixed-wing unmanned aerial vehicle |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111895998B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113190024A (en) * | 2021-03-31 | 2021-07-30 | 成都飞机工业（集团）有限责任公司 | Decision and guidance method for forced landing of airborne sliding of manned fixed wing aircraft |
| CN116412831A (en) * | 2023-06-12 | 2023-07-11 | 中国电子科技集团公司信息科学研究院 | Multi-unmanned aerial vehicle dynamic obstacle avoidance route planning method for recall and anti-dive |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE19836214A1 (en) * | 1998-08-11 | 2000-02-24 | Dfs Deutsche Flugsicherung Gmb | Landing approach guidance system for aircraft using electronic radio navigation system specifying electronic guide path with predetermined glide path angle |
| US20100017114A1 (en) * | 2007-05-24 | 2010-01-21 | Honeywell International Inc. | Flight Path Planning to Reduce Detection of an Unmanned Aerial Vehicle |
| CN102582826A (en) * | 2011-01-06 | 2012-07-18 | 佛山市安尔康姆航拍科技有限公司 | Driving method and system of four-rotor-wing unmanned flight vehicle |
| CN103294062A (en) * | 2012-02-23 | 2013-09-11 | 通用电气航空系统有限责任公司 | Method for flying an aircraft along a flight path |
| CN103529851A (en) * | 2013-10-29 | 2014-01-22 | 航宇救生装备有限公司 | Finely segmented parafoil homing control method |
| CN106846926A (en) * | 2017-04-13 | 2017-06-13 | 电子科技大学 | A kind of no-fly zone unmanned plane method for early warning |
| CN109085849A (en) * | 2018-08-28 | 2018-12-25 | 成都飞机工业（集团）有限责任公司 | A kind of autonomous control method of Shipborne UAV accuracy |
| CN110027564A (en) * | 2018-01-12 | 2019-07-19 | 福特全球技术公司 | Personalized congestion in road notice |
| CN110243359A (en) * | 2019-05-31 | 2019-09-17 | 南京航空航天大学 | Safe path planning method based on Low level wind prediction model |
| CN110956334A (en) * | 2019-12-10 | 2020-04-03 | 中国民航科学技术研究院 | Aircraft takeoff performance optimization method and system based on ultra-long obstacle crossing path |
-
2020
- 2020-06-17 CN CN202010554052.9A patent/CN111895998B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE19836214A1 (en) * | 1998-08-11 | 2000-02-24 | Dfs Deutsche Flugsicherung Gmb | Landing approach guidance system for aircraft using electronic radio navigation system specifying electronic guide path with predetermined glide path angle |
| US20100017114A1 (en) * | 2007-05-24 | 2010-01-21 | Honeywell International Inc. | Flight Path Planning to Reduce Detection of an Unmanned Aerial Vehicle |
| CN102582826A (en) * | 2011-01-06 | 2012-07-18 | 佛山市安尔康姆航拍科技有限公司 | Driving method and system of four-rotor-wing unmanned flight vehicle |
| CN103294062A (en) * | 2012-02-23 | 2013-09-11 | 通用电气航空系统有限责任公司 | Method for flying an aircraft along a flight path |
| CN103529851A (en) * | 2013-10-29 | 2014-01-22 | 航宇救生装备有限公司 | Finely segmented parafoil homing control method |
| CN106846926A (en) * | 2017-04-13 | 2017-06-13 | 电子科技大学 | A kind of no-fly zone unmanned plane method for early warning |
| CN110027564A (en) * | 2018-01-12 | 2019-07-19 | 福特全球技术公司 | Personalized congestion in road notice |
| CN109085849A (en) * | 2018-08-28 | 2018-12-25 | 成都飞机工业（集团）有限责任公司 | A kind of autonomous control method of Shipborne UAV accuracy |
| CN110243359A (en) * | 2019-05-31 | 2019-09-17 | 南京航空航天大学 | Safe path planning method based on Low level wind prediction model |
| CN110956334A (en) * | 2019-12-10 | 2020-04-03 | 中国民航科学技术研究院 | Aircraft takeoff performance optimization method and system based on ultra-long obstacle crossing path |
Non-Patent Citations (2)
| Title |
|---|
| SANGJUN BAE 等: "A New Multiple Flights Routing and Scheduling Algorithm in Terminal Manoeuvring Area", 《2018 IEEE/AIAA 37TH DIGITAL AVIONICS SYSTEMS CONFERENCE (DASC)》 * |
| 吕锦涛 等: "基于航路堆栈的航线自动生成方法", 《计算机应用》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113190024A (en) * | 2021-03-31 | 2021-07-30 | 成都飞机工业（集团）有限责任公司 | Decision and guidance method for forced landing of airborne sliding of manned fixed wing aircraft |
| CN116412831A (en) * | 2023-06-12 | 2023-07-11 | 中国电子科技集团公司信息科学研究院 | Multi-unmanned aerial vehicle dynamic obstacle avoidance route planning method for recall and anti-dive |
| CN116412831B (en) * | 2023-06-12 | 2023-09-19 | 中国电子科技集团公司信息科学研究院 | Multi-unmanned aerial vehicle dynamic obstacle avoidance route planning method for recall and anti-dive |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111895998B (en) | 2022-07-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7904213B2 (en) | Method of assisting in the navigation of an aircraft with an updating of the flight plan | |
| EP3598262B1 (en) | Method and system for determining a climb profile | |
| US10041809B2 (en) | Aircraft intent processor | |
| Atkins et al. | Emergency flight planning applied to total loss of thrust | |
| JP6033549B2 (en) | Providing data to predict the flight path of an aircraft | |
| CN106385442B (en) | Method for integrating new navigation services into an open architecture avionics on-board system | |
| US11619953B2 (en) | Three dimensional aircraft autonomous navigation under constraints | |
| EP3550394B1 (en) | Efficient flight profiles with multiple rta constraints | |
| US20120158280A1 (en) | Computing route plans for routing around obstacles having spatial and temporal dimensions | |
| EP3470786B1 (en) | A computer-implemented method and a system for generating a 3d path to a landing location for an aerial vehicle | |
| CN104991895A (en) | Low-altitude rescue aircraft route planning method based on three dimensional airspace grids | |
| CN110059863B (en) | Aircraft four-dimensional track optimization method based on required arrival time | |
| CN107402576A (en) | Method for the reference Vertical Profile of automatic reclosing aircraft | |
| CN111895998B (en) | Segmented stacking type route planning method for large-scale fixed-wing unmanned aerial vehicle | |
| You et al. | A guidance and control law design for precision automatic take-off and landing of fixed-wing UAVs | |
| CN111192481B (en) | Method for determining boundary of unmanned aerial vehicle control area of approach and departure procedure based on collision risk | |
| CN105366059A (en) | Fixed-point parachuting method of fixed-wing unmanned aerial vehicle | |
| Malaek et al. | Dynamic based cost functions for TF/TA flights | |
| Ramée et al. | Aircraft flight plan optimization with dynamic weather and airspace constraints | |
| US10867521B2 (en) | Aircraft mission computing system, comprising a computing engine for computing an aircraft trajectory during the mission and related process | |
| CN112396298A (en) | Unmanned helicopter multi-machine cooperative task planning method | |
| CN114489135B (en) | Multitasking route design method | |
| CN103680213A (en) | Method for determining suitable waypoint locations | |
| Xue et al. | Noise-minimum runway-independent aircraft approach design for baltimore-washington international airport | |
| KR20230078097A (en) | 3d visualization method based on digital twin technology to manage urban air mobility substantiation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |