CN106528314B - A kind of processing method for the concussion of aircraft flight path data jump - Google Patents
A kind of processing method for the concussion of aircraft flight path data jump Download PDFInfo
- Publication number
- CN106528314B CN106528314B CN201610941076.3A CN201610941076A CN106528314B CN 106528314 B CN106528314 B CN 106528314B CN 201610941076 A CN201610941076 A CN 201610941076A CN 106528314 B CN106528314 B CN 106528314B
- Authority
- CN
- China
- Prior art keywords
- point
- data
- height
- latitude
- longitude
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/0703—Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
- G06F11/0793—Remedial or corrective actions
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention discloses a kind of processing methods for the concussion of aircraft flight path data jump, including the processing to height jump point in flight path data and the processing shaken longitude and latitude in flight path data.Flight path data processing method of the invention, by using the data of a upper available point, including longitude and latitude, height, the speed of both direction, time, judging whether effective and the point the height of the current point needs to change during reading in point；Invalid data is deleted, valid data are the problem of being stored in after needing the data of more new high degree to update, be able to solve height jump point.In addition, the problem of being compared using it with the longitude and latitude data of current point by searching two available points being stored in every time, judging whether the sequence of these three points needs to change, update the sequence of all data, be able to solve longitude and latitude concussion.Complete and relatively correct flight path can be drawn out in the case where excalation data.
Description
Technical field
The present invention relates to a kind of processing methods for the concussion of aircraft flight path data jump, belong to aircraft flight path
Data-optimized processing method technical field.
Background technique
Aircraft is in flight course, the data of collected aircraft flight path, partially there is shortage of data and data are wrong
Accidentally the problems such as, wherein longitude and latitude height, horizontal velocity, vertical speed and the time of a shortage of data i.e. point may not all deposit
Data that, error in data is longitude and latitude or height are wrong, concussion etc. back and forth.Based on above-mentioned technical problem, it is necessary to provide
A kind of processing method for the concussion of aircraft flight path data jump, can mend the data lacked in aircraft flight path
Entirely, wrong data modification in aircraft flight path is updated, for can not modified data directly delete, it is final to realize in portion
Complete and relatively correct flight path can be drawn out in the case where dividing missing data.
Summary of the invention
The present invention is exactly in view of the deficienciess of the prior art, provide a kind of for the concussion of aircraft flight path data jump
Processing method, the Supplementing Data that can will be lacked in aircraft flight path, by data modification wrong in aircraft flight path
Update, for can not modified data directly delete, can be drawn out in the case where excalation data complete and relatively just
True flight path.
To solve the above problems, the technical solution used in the present invention is as follows:
A kind of processing method for the concussion of aircraft flight path data jump, including to highly being jumped in flight path data
The processing of point, and the following steps are included:
S1, input longitude and latitude containing aircraft, height, horizontal velocity, vertical speed, the discrete point set of temporal information；
S2, using previous available point compared with current point, calculate distance between two points with speed and time, the original with reading
Beginning data comparison, if having big difference, corrigendum or deletion；
S3, discrete point set of the output without height jump point.
It as an improvement of the above technical solution, further include the processing shaken longitude and latitude in flight path data, and including
Following steps:
S ' 1, the discrete point set for inputting the latitude and longitude information containing aircraft；
S ' 2, each of discrete point set point is handled: given sequentially adjacent three points: ..., Pi,Pi+1,
Pi+2,...；
If with intermediate point Pi+1For vertex, Pi+1Pi,Pi+1Pi+2For the angle too small on side, then P is exchangedi+1And Pi+2..., Pi,
Pi+2,Pi+1,...；A point and these three points before reexamining these three points exchange later the first two point, i.e. Pi-1,Pi,
Pi+2；Conversely, three dot sequencies are constant, latter two point and a next point, i.e. P of these three points are checkedi+1,Pi+2,Pi+3；
The discrete point set that S ' 3, output are shaken without longitude and latitude.
Compared with prior art, implementation result of the invention is as follows by the present invention:
A kind of processing method for the concussion of aircraft flight path data jump of the present invention, by reading in point
In the process, the current point is judged including longitude and latitude, height, the speed of both direction, time using the data of a upper available point
Whether whether effective and the point height needs to change；Invalid data is deleted, valid data are the number for needing more new high degree
The problem of according to being stored in after update, being able to solve height jump point.In addition, being utilized by searching two available points being stored in every time
It is compared with the longitude and latitude data of current point, judges whether the sequence of these three points needs to change, and updates all data
Sequentially, the problem of being able to solve longitude and latitude concussion.
Detailed description of the invention
Fig. 1 is the processing method schematic diagram shaken in specific embodiment longitude and latitude in flight path data；
Fig. 2 and Fig. 3 is the specific processing example handled in specific embodiment height jump point in flight path data
Figure；
Fig. 4 and Fig. 5 is that the specific processing handled in specific embodiment longitude and latitude concussion in flight path data is shown
Example diagram.
Specific embodiment
Illustrate the contents of the present invention below in conjunction with specific embodiments.
A kind of processing method for the concussion of aircraft flight path data jump provided by the present embodiment, including to flight
The processing of height jump point and the processing that longitude and latitude in flight path data is shaken in track data.Wherein:
One, as follows to the processing method of height jump point in flight path data:
1, it inputs:
Discrete point
Wherein: (x, y): longitude and latitude, height: height (m), sv: horizontal velocity (km/h), hv: vertical speed (ft/
Min), time: time (s).
The longitude and latitude time certainly exists, and height velocity is not necessarily.
2, it exports:
New discrete point
So that each Pi *Data are as complete as possible, and without height jump point.
3, core algorithm:
Using previous available point compared with current point, distance between two points are calculated with speed and time, it is original with reading
Data comparison, if having big difference, corrigendum or deletion.
4, specific algorithm:
Read in a discrete point Pi(∈ Original_Cdata) is moved if longitude and latitude shortage of data or height are negative
It removes；Otherwise:
4.1, if first data, Cdata*.pushback(Pi)。
If not 4.2, first data, with previous discrete point exP (∈ Cdata*) it is compared:
If two o'clock time interval is more than δ t, Cdata*.pushback(Pi)。
Otherwise:
RealDistance: the distance that earth surface is parallel between two o'clock is calculated with three-dimensional coordinate；
φ=arcos [cos (90-y2)cos(90-y1)+sin(90-y2)sin(90-y1)cos(x1-x2)] (2)
Wherein R=6371004 meters are earth radius, P1(x1, y1, h1), P2(x2, y2, h2) is that given two o'clock three-dimensional is sat
Mark.
ComputedDistance: the distance between two o'clock is calculated with horizontal velocity and time；
RealHeight=Pi.height: initial data PiHeight；ComputedHeight: with erecting for previous data
The height that straight speed and time calculate.
ComputedHeight=exP.height+000508 × exP.hv × time_interval (4)
If: d < ds and h < dv, Cdata*.pushback(Pi)。
If: d<ds and h>=dv update the height of Cdata with speed and time calculated height computedHeight
Degree evidence, Cdata*.pushback(Pi)。
Otherwise it removes.
Here δ t=10, ds=0.25, dv=0.1 are taken.That is, interval did not compared more than 10 seconds and is directly stored in, distance is accidentally
Difference is respectively smaller than 25% and 10% with height error.
Two, as follows to the processing method of longitude and latitude concussion in flight path data:
1, it inputs:
Discrete point
Wherein, (x, y): longitude and latitude.
2, it exports:
Discrete pointδ i is to resequence to subscript i, so that this group of data
Cdata*It will not knock-on under the latitude and longitude coordinates.
3, core algorithm:
Given sequentially adjacent three points: ..., Pi,Pi+1,Pi+2,...；
If with intermediate point Pi+1For vertex, Pi+1Pi,Pi+1Pi+2For the angle too small on side, then P is exchangedi+1And Pi+2..., Pi,
Pi+2,Pi+1,...；A point and these three points before reexamining these three points exchange later the first two point, i.e. Pi-1,Pi,
Pi+2.Conversely, three dot sequencies are constant, latter two point and a next point, i.e. P of these three points are checkedi+1,Pi+2,Pi+3。
4, specific algorithm:
4.1, first classify to data, the identical point of longitude and latitude is put together in chronological order.
Qi={ Pi| all PiLongitude and latitude is identical }
4.2, in order to adjacent three set Qi,Qi+1,Qi+2It is analyzed, respectively takes a point, P from three setl∈
Qi, Pj∈Qi+1, Pk∈Qi+2:
(a) the distance between every two point d is calculatedlj=| Pj-Pl|,dlk=| Pk-Pl|,djk=| Pk-Pj| given two o'clock Pj
(xj,yj), Pk(xk,yk), distance djkCalculation formula:
φ=arccos [cos (90-yk)cos(90-yj)+sin(90-yk)sin(90-yj)cos(xj-xk)] (8)
Wherein R=6371004 meters are earth radius.
(b) P is calculatedjPlWith PjPkAngle
IfIt is too small, Qi+1With Qi+2Position is exchanged, to Qi-1,Qi,Qi+2It is analyzed, goes to (a) (b)；
If Qi+1With Qi+2Exchange position is not needed, to Qi+1,Qi+2,Qi+3It is analyzed, goes to (a) (b).
4.3, it exports.
5, points for attention:
If saving the classification of step 4.1, it is possible to result inaccuracy.Here we lift a counter-example to illustrate:
...,Pi(x1,y1,hi),Pi+1(x1,y1,hi+1),Pi+2(x1,y1,hi+2),Pi+3(x3,y3,hi+3),Pi+4(x3,y3,
hi+4),Pi+5(x3,y3,hi+5),Pi+6(x6,y6,hi+6),Pi+7(x6,y6,hi+7),...
Be easy to obtain: Pi to Pi+7 every three continuous points all meet angle conditions, do not have to exchange sequence；
However it can be seen that by figure Fig. 1, (xi,yi),(xi+3,yi+3),(xi+6,yi+6) in (xi+3,yi+3) at angle compare
It is small, so (xi+3,yi+3) and (xi+6,yi+6) two points need exchange sequence.
Three, specific processing example:
30 points are given, if only being denoised to height, 2 points (height of the two points is negative) is deleted, has updated 2 points
Height.
Fig. 2 and Fig. 3 is the time of remaining 28 point and height map after deleting the point that two height are negative.
In Fig. 2: broken line above is 28 points before updating, after broken line below is update.
In Fig. 3: the amplification of 24 points of right end of Fig. 2.Blue is 24 points before updating, after red is updates.It gives
Fixed 30 points denoise total data and are updated to height with the above-mentioned processing method to height jump point in flight path data
Afterwards, remaining 23 available points.
About longitude and latitude, with the above-mentioned processing method shaken longitude and latitude in flight path data, to the suitable of this 23 points
Sequence updates, and sees Fig. 4 and Fig. 5.
In Fig. 4: broken line above is the track before updating, after broken line below is update.
In Fig. 5: being amplified to the right end of Fig. 4.Before broken line above is update, broken line below is after updating.
During reading point, by mistake and the data that can not correct directly are deleted, by mistake but the data that can correct
It is stored in after update, solves the problems, such as height jump point.It calls the first two point to make comparisons with current point every time, solves longitude and latitude concussion
Problem.
The method be in the case where known all the points it is applicable, read in point during search two be stored in data
In the case where also can be used.But it is not allowed to due to searching two points during reading point, current focus is each
It attempts to solve the problems, such as the longitude and latitude to knock-on in the case of only calling one has been stored in a little.
The foregoing is a detailed description of the present invention in conjunction with specific embodiments, and it cannot be said that the present invention is specifically real
It applies and is only limitted to these explanations.For those skilled in the art to which the present invention belongs, before not departing from present inventive concept
It puts, a number of simple deductions or replacements can also be made, all shall be regarded as belonging to the scope of protection of the invention.
Claims (3)
1. a kind of processing method for the concussion of aircraft flight path data jump, characterized in that including to flight path data
The processing of middle height jump point, and the following steps are included:
S1, input longitude and latitude containing aircraft, height, horizontal velocity, vertical speed, the discrete point set of temporal information:
Wherein: (x, y): longitude and latitude, height: height, sv: horizontal velocity, hv: vertical speed, time: time；
S2, each of discrete point set point is handled: reads in a discrete point Pi(∈ Original_Cdata) if
Longitude and latitude shortage of data or height are negative, and remove；Otherwise:
If first data, Cdata*.pushback(Pi)；
If not first data, with previous discrete point exP (∈ Cdata*) it is compared:
If two o'clock time interval is more than δ t, Cdata*.pushback(Pi)；
Otherwise:
RealDistance: the distance that earth surface is parallel between two o'clock is calculated with three-dimensional coordinate；
φ=arccos [cos (90-y2)cos(90-y1)+sin(90-y2)sin(90-y1)cos(x1-x2)]
Wherein R=6371004 meters are earth radius, P1(x1, y1, h1), P2(x2, y2, h2) it is given two o'clock three-dimensional coordinate；
ComputedDistance: the distance between two o'clock is calculated with horizontal velocity and time；
RealHeight=Pi.height: initial data PiHeight；ComputedHeight: with the vertical speed of previous data
The height that degree and time calculate；
ComputedHeight=exP.height+0.00508 × exP.hv × time_interval
If: d < ds and h < dv, Cdata*.pushback(Pi)；
If: d<ds and h>=dv update the high degree of Cdata with speed and time calculated height computedHeight
According to Cdata*.pushback(Pi)；
Otherwise it removes；
Here δ t=10, ds=0.25, dv=0.1 are taken；That is, interval did not compared more than 10 seconds and is directly stored in, range error and
Height error is respectively smaller than 25% and 10%；
S3, discrete point set of the output without height jump point:
So that each Pi *Data are as complete as possible, and without height jump point.
2. a kind of processing method for the concussion of aircraft flight path data jump as described in claim 1, characterized in that also
Including the processing shaken longitude and latitude in flight path data, and the following steps are included:
S ' 1, the discrete point set for inputting the latitude and longitude information containing aircraft；
S ' 2, each of discrete point set point is handled: given sequentially adjacent three points: ..., Pi,Pi+1,
Pi+2,...；
If with intermediate point Pi+1For vertex, Pi+1Pi,Pi+1Pi+2For the angle too small on side, then P is exchangedi+1And Pi+2..., Pi,Pi+2,
Pi+1,...；A point and these three points before reexamining these three points exchange later the first two point, i.e. Pi-1,Pi,Pi+2；
Conversely, three dot sequencies are constant, latter two point and a next point, i.e. P of these three points are checkedi+1,Pi+2,Pi+3；
The discrete point set that S ' 3, output are shaken without longitude and latitude.
3. a kind of processing method for the concussion of aircraft flight path data jump as claimed in claim 2, characterized in that packet
Include following steps:
S ' 1, input discrete point
Wherein, (x, y): longitude and latitude；
S ' 2, first classify to data, the identical point of longitude and latitude put together in chronological order,
In order to adjacent three set Qi,Qi+1,Qi+2It is analyzed, respectively takes a point, P from three setl∈Qi, Pj∈
Qi+1, Pk∈Qi+2:
(a) the distance between every two point dl is calculatedj=| Pj-Pl|,dlk=| Pk-Pl|,djk=| Pk-Pj| given two o'clock Pj(xj,
yj), Pk(xk,yk), distance djkCalculation formula:
φ=arccos [cos (90-yk)cos(90-yj)+sin(90-yk)sin(90-yj)cos(xj-xk)]
Wherein R=6371004 meters are earth radius；
(b) P is calculatedjPlWith PjPkAngle
IfIt is too small, Qi+1With Qi+2Position is exchanged, to Qi-1,Qi,Qi+2It is analyzed, goes to (a) (b)；
If Qi+1With Qi+2Exchange position is not needed, to Qi+1,Qi+2,Qi+3It is analyzed, goes to (a) (b)；
S ' 3, output discrete pointδiTo resequence to subscript i, so that this group of number
According to Cdata*It will not knock-on under the latitude and longitude coordinates.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610941076.3A CN106528314B (en) | 2016-11-02 | 2016-11-02 | A kind of processing method for the concussion of aircraft flight path data jump |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610941076.3A CN106528314B (en) | 2016-11-02 | 2016-11-02 | A kind of processing method for the concussion of aircraft flight path data jump |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106528314A CN106528314A (en) | 2017-03-22 |
| CN106528314B true CN106528314B (en) | 2019-05-17 |
Family
ID=58292565
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610941076.3A Active CN106528314B (en) | 2016-11-02 | 2016-11-02 | A kind of processing method for the concussion of aircraft flight path data jump |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106528314B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110017838A (en) * | 2019-02-13 | 2019-07-16 | 浩亚信息科技有限公司 | Schedule flight trajectory predictions method, equipment, medium and system |
| CN112070305B (en) * | 2020-09-07 | 2024-07-12 | 民航数据通信有限责任公司 | Method for evaluating quality of ADS-B four-dimensional track |
| CN116520868B (en) * | 2023-04-14 | 2024-08-13 | 成都飞机工业（集团）有限责任公司 | Aircraft attitude angle boundary mutation correction method |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007127914A (en) * | 2005-11-07 | 2007-05-24 | Mitsubishi Electric Corp | Flight training support system |
| CN101251388A (en) * | 2008-03-13 | 2008-08-27 | 北京东方中讯联合认证技术有限公司 | Method and system for intercomparison of route |
| CN104598747A (en) * | 2015-01-29 | 2015-05-06 | 中国航空无线电电子研究所 | Method for evaluating flight performance of aviator |
-
2016
- 2016-11-02 CN CN201610941076.3A patent/CN106528314B/en active Active
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2007127914A (en) * | 2005-11-07 | 2007-05-24 | Mitsubishi Electric Corp | Flight training support system |
| CN101251388A (en) * | 2008-03-13 | 2008-08-27 | 北京东方中讯联合认证技术有限公司 | Method and system for intercomparison of route |
| CN104598747A (en) * | 2015-01-29 | 2015-05-06 | 中国航空无线电电子研究所 | Method for evaluating flight performance of aviator |
Non-Patent Citations (1)
| Title |
|---|
| "基于监视数据修正的航空器飞行轨迹推算模型";康瑞等;《航空航天》;20140228;第14卷(第6期);第256-259页 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106528314A (en) | 2017-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106528314B (en) | A kind of processing method for the concussion of aircraft flight path data jump | |
| CN110634291B (en) | High-precision map topology automatic construction method and system based on crowdsourcing data | |
| WO2022252398A1 (en) | Ship trajectory feature point extraction-based spatio-temporal dp method | |
| CN111914813B (en) | Power transmission line inspection image naming method and system based on image classification | |
| CN107195180B (en) | Traffic travel track extraction method and device based on electric police data | |
| CN106156387B (en) | Rail line drawing data is derived automatically from method | |
| CN106323301A (en) | Road information obtaining method and device | |
| CN106780524A (en) | A kind of three-dimensional point cloud road boundary extraction method | |
| CN107241512A (en) | Intercity Transportation trip mode determination methods and equipment based on data in mobile phone | |
| CN106203491A (en) | A kind of fusion update method of highway vector data | |
| CN106918311A (en) | Isolated tree crown mapping area automatic calculating method based on vehicle-mounted laser cloud data | |
| CN110807496A (en) | Dense target detection method | |
| CN104657968A (en) | Automatic vehicle-mounted three-dimensional laser point cloud facade classification and outline extraction method | |
| CN109241138A (en) | A kind of motion track construction method and device | |
| WO2021254019A1 (en) | Method, device and system for cooperatively constructing point cloud map | |
| CN103455322A (en) | Method and system for providing real-time information regarding objects in a network | |
| CN105893577A (en) | Road network data processing method and apparatus | |
| CN103150326A (en) | Skyline query method orienting to probability data flow | |
| CN111275807A (en) | 3D road modeling method and system | |
| CN114443794A (en) | Data processing and map updating method, device, equipment and storage medium | |
| CN112732860B (en) | Road extraction method, device, readable storage medium and equipment | |
| Zhang et al. | Robust extraction of multiple-type support positioning devices in the catenary system of railway dataset based on MLS point clouds | |
| CN107038857A (en) | A kind of public transport data capture method and public transport data platform | |
| CN108562298A (en) | A kind of map updating method and device using big data | |
| CN110390224A (en) | A kind of recognition methods of traffic sign and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 230001 Anhui City, Hefei Province, No. 4 Suzhou Road, Xin building, room 3009 Applicant after: Flying friend Technology Co., Ltd. Address before: 230001 Anhui City, Hefei Province, No. 4 Suzhou Road, Xin building, room 3009 Applicant before: Hefei Feiyou Network Technology Co., Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: Room 813, Kechuang building, 860 Wangjiang West Road, hi tech Zone, Hefei City, Anhui Province Patentee after: VARIFLIGHT TECHNOLOGY Co.,Ltd. Address before: 3009, room 4, Xin Xin building, No. 230001, Suzhou Road, Hefei, Anhui Patentee before: VARIFLIGHT TECHNOLOGY Co.,Ltd. |