轨道交通GPS数据约简的数学模型与算法研究概要.docVIP

第30卷第4期铁　　道　　学　　报Vol. 30　No. 4 2008年8月J OURNAL OF T H E CHINA RA IL WA Y SOCIET Y August 2008 文章编号:100128360(2008 0420116204 轨道交通GPS 数据约简的数学模型与算法研究 陈德旺, 　蔡伯根, 　王　剑, 　唐　涛 (北京交通大学轨道交通控制与安全国家重点实验室, 北京　100044 摘　要:利用实测轨道GPS 数据生成电子地图是实现列控智能化的一个重要环节。为减少存储空间和提高列 车定位的实时性, 需要对大量GPS 数据进行约简, 找出其中的少量关键数据。通过数学建模和分析, 轨道交通 GPS 数据约简问题是一个N P 问题, 难以求得最优解。本文提出一种启发式线性算法, 并给出6个性能指标的定 义。两个铁路区间的实测GPS 数据用于对算法的性能指标进行分析比较。计算结果表明, 该算法是有效的且运 行速度较快。该算法能以较低的约简率在一定误差要求的前提下约简大量GPS 数据。在误差约束为1m 时, 约 简率小于2%; 误差约束为2m 时, 约简率约为1%。随着轨道弯曲程度的增加, 约简率有所增加。 关键词:轨道交通; 全球定位系统; 电子地图; 数据约简; 启发式算法 中图分类号:U284　　文献标志码:A Mathem atical Model and R eduction C EN 　CA I , G Jian , 　TAN G Tao (of Rail and Safety , Beijing Jiaotong University , Beijing 100044, China Abstract :data of railway GPS (Global Po sition System to generate an elect ronic map is an improtant step to realize t he intelligent train cont rol. To decrease t he memory space and enhance t he real 2time p roperty of t rain po sitioning , it is necessary to find an effective data reduction algorit hm for huge GPS data. Modeling and analysis indicate t hat t he p roblem of railway GPS data reduction is a N P p roblem and it is hard to get t he optimal solution. A heuristic algorit hm was p ut forward and 6performance indexes were defined in t his paper. The surveyed GPS data of two railway sections were used to analyze t he performance index of t he algo 2 rit hm. The comp utational result s show t hat t he algorit hm is effective and t he running speed of t he algorit hm is very high. The algorit hm can reduce t he huge GPS data in a very low reduction rate under certain error require 2 ment. When t he error requirement is 1m , t he reduction rate is less t han 2%; when t he error requirement is 2 m , t he reduction rate is about 1%.Wit h t he increase of t he camber of railway , t he reduction rate increases. K ey w ords :rail traffic ; GPS ; electronic map ; data reduction ; heuristic algorit hm 　　全球定位系统GPS 在城市车辆、飞机、船舶导航、大地测量、地图绘制和火箭导弹监控等众多领域得到广泛应用[1]。同样,