[1]彭可,阳领,郭启明,等. 基于单向循环列表的公交自动报站算法[J].计算机技术与发展,2016,26(12):148-152.
　PENG Ke,YANG Ling,GUO Qi-ming,et al. Algorithm of Automatic Bus-station Broadcasting System Based on Unidirectional Circular List[J].,2016,26(12):148-152.
点击复制

 基于单向循环列表的公交自动报站算法()
分享到：

《计算机技术与发展》[ISSN:1006-6977/CN:61-1281/TN]

卷:
26
期数:
2016年12期
页码:
148-152
栏目:
应用开发研究
出版日期:
2016-12-10

文章信息/Info

Title:
 Algorithm of Automatic Bus-station Broadcasting System Based on Unidirectional Circular List
文章编号:
1673-629X（2016)12-0148-05
作者:
 彭可; 阳领; 郭启明; 冯准; 郑怀朋
 湖南师范大学 工程与设计学院
Author(s):
 PENG Ke; YANG Ling; GUO Qi-ming; FENG Zhun; ZHENG Huai-peng
关键词:
 ; 自动报站; 单向循环列表; 全局搜索; 站点匹配; 进站判定; 出站预报
Keywords:
 ; automatic station broadcasting; unidirectional circular list; global search station matching; approaching judgment; departure forecasting
分类号:
TP301.6
文献标志码:
A
摘要:
 针对当前公交自动报站算法大多需要人工确认公交车辆上下行方向以及车辆突然跨站或调头导致的报站错误等问题，设计了一种基于单向循环列表的新型公交车辆全自动判定及报站算法。该算法充分考虑了公交车辆往复运行的规律，结合了各公交站点之间按前后顺序排列的内在联系，去除了传统公交车自动报站算法中的上下行概念。该算法无需依赖定位信息中的方位角信息，采用单向循环列表存储公交往返线路的全部站点信息，并结合周期性的全局搜索定位方式进行公交站点的匹配计算。该算法可以实现全自动公交车辆进出站预报和报站，无需人工判断公交车辆行驶方向，极端情况下出现站点信息错报或漏报时能够快速自动恢复至正常报站状态，且不会出现累积报站误差。
Abstract:
 A new algorithm for automatic bus-station broadcasting system based on unidirectional circular list is proposed to solve the problems such as the determination of bus direction and the station skip or unexpected U-turn in current automatic broadcasting algo-rithms. Both the reciprocating operation pattern of buses and the internal unidirectional cyclic sequence of bus stations are taken into con-sideration. So the concept of bus up and down direction is replaced by the unidirectional circular list,which stores the bus stations infor-mation. Also the periodic global search is adopted in the new algorithm to match the correct bus station. This algorithm is applied to real-ize bus automatic station forecasting and broadcasting without direction determination. The bus-station broadcasting recovers to normal status rapidly even in malfunction cases,and there is no accumulated error.

相似文献/References:

[1]张志宏,吴庆波,邵立松,等.基于飞腾平台TOE协议栈的设计与实现[J].计算机技术与发展,2014,24(07):1.
　ZHANG Zhi-hong,WU Qing-bo,SHAO Li-song,et al. Design and Implementation of TCP/IP Offload Engine Protocol Stack Based on FT Platform[J].,2014,24(12):1.
[2]梁文快,李毅. 改进的基因表达算法对航班优化排序问题研究[J].计算机技术与发展,2014,24(07):5.
　LIANG Wen-kuai,LI Yi. Research on Optimization of Flight Scheduling Problem Based on Improved Gene Expression Algorithm[J].,2014,24(12):5.
[3]黄静,王枫,谢志新,等. EAST文档管理系统的设计与实现[J].计算机技术与发展,2014,24(07):13.
　HUANG Jing,WANG Feng,XIE Zhi-xin,et al. Design and Implementation of EAST Document Management System[J].,2014,24(12):13.
[4]侯善江[],张代远[][][]. 基于样条权函数神经网络P2P流量识别方法[J].计算机技术与发展,2014,24(07):21.
　HOU Shan-jiang[],ZHANG Dai-yuan[][][]. P2P Traffic Identification Based on Spline Weight Function Neural Network[J].,2014,24(12):21.
[5]李璨,耿国华,李康,等. 一种基于三维模型的文物碎片线图生成方法[J].计算机技术与发展,2014,24(07):25.
　LI Can,GENG Guo-hua,LI Kang,et al. A Method of Obtaining Cultural Debris’ s Line Chart Based on Three-dimensional Model[J].,2014,24(12):25.
[6]翁鹤,皮德常. 混沌RBF神经网络异常检测算法[J].计算机技术与发展,2014,24(07):29.
　WENG He,PI De-chang. Chaotic RBF Neural Network Anomaly Detection Algorithm[J].,2014,24(12):29.
[7]刘茜[],荆晓远[],李文倩[],等. 基于流形学习的正交稀疏保留投影[J].计算机技术与发展,2014,24(07):34.
　LIU Qian[],JING Xiao-yuan[,LI Wen-qian[],et al. Orthogonal Sparsity Preserving Projections Based on Manifold Learning[J].,2014,24(12):34.
[8]尚福华,李想,巩淼. 基于模糊框架-产生式知识表示及推理研究[J].计算机技术与发展,2014,24(07):38.
　SHANG Fu-hua,LI Xiang,GONG Miao. Research on Knowledge Representation and Inference Based on Fuzzy Framework-production[J].,2014,24(12):38.
[9]叶偲,李良福,肖樟树. 一种去除运动目标重影的图像镶嵌方法研究[J].计算机技术与发展,2014,24(07):43.
　YE Si,LI Liang-fu,XIAO Zhang-shu. Research of an Image Mosaic Method for Removing Ghost of Moving Targets[J].,2014,24(12):43.
[10]余松平[][],蔡志平[],吴建进[],等. GSM-R信令监测选择录音系统设计与实现[J].计算机技术与发展,2014,24(07):47.
　YU Song-ping[][],CAI Zhi-ping[] WU Jian-jin[],GU Feng-zhi[]. Design and Implementation of an Optional Voice Recording System Based on GSM-R Signaling Monitoring[J].,2014,24(12):47.

更新日期/Last Update: 2017-02-03