论文部分内容阅读
利用实测轨道GPS数据生成电子地图是实现列控智能化的一个重要环节。为减少存储空间和提高列车定位的实时性,需要对大量GPS数据进行约简,找出其中的少量关键数据。通过数学建模和分析,轨道交通GPS数据约简问题是一个NP问题,难以求得最优解。本文提出一种启发式线性算法,并给出6个性能指标的定义。两个铁路区间的实测GPS数据用于对算法的性能指标进行分析比较。计算结果表明,该算法是有效的且运行速度较快。该算法能以较低的约简率在一定误差要求的前提下约简大量GPS数据。在误差约束为1 m时,约简率小于2%;误差约束为2 m时,约简率约为1%。随着轨道弯曲程度的增加,约简率有所增加。
The use of measured orbit GPS data to generate electronic maps is to achieve an important part of train control intelligence. In order to reduce the storage space and improve the real-time performance of train locating, a large amount of GPS data needs to be reduced to find out a few key data among them. Through mathematical modeling and analysis, GPS data reduction problem of rail transit is an NP problem, it is difficult to find the optimal solution. This paper presents a heuristic linear algorithm, and gives the definition of six performance indicators. The measured GPS data of two railway sections are used to analyze and compare the performance indexes of the algorithm. The calculation results show that the algorithm is efficient and fast. The algorithm can reduce a large amount of GPS data with a lower reduction rate under certain error requirements. When the error constraint is 1 m, the reduction rate is less than 2%. When the error constraint is 2 m, the reduction rate is about 1%. As the degree of orbital bending increases, the reduction rate increases.