期刊文献+

面向LarKC-ITS的单源最短路径算法优化策略

Optimized strategies for shortest path algorithm based on LarKC-ITS
下载PDF
导出
摘要 高性能选路解决方案对智能交通系统(ITS)效率至关重要,基于LarKC(语义万维网开源项目)提出了一种ITS设计方案,使得ITS可以利用移动互联网提供的海量、实时、群智的信息,而这种新的设计思路对选路算法提出了新的要求。对实际交通场景属性进行抽象,并通过实验表明该系统具有良好的选路性能,为智能交通的实现提供了新的思路。 A high-performance solution to Intelligent Transportation System (ITS) is of vital importance. It proposes a new type of ITS which is based on LarKC. As a result, this new ITS can provide large amounts of information which is real-time and belongs to large-scale intelligent devices. At the same time, it needs a new and practical routing algorithm to apply to the new system. It abstracts attributes which exist in real-time transportation scene. Through experiments, it finds that the created system has high performance in routing, which provides a new idea in realizing ITS.
出处 《计算机工程与应用》 CSCD 2013年第15期44-47,共4页 Computer Engineering and Applications
基金 国家自然科学基金青年基金项目(No.61003040) 江苏省研究生创新项目(No.CXLX12_0480)
关键词 智能交通系统 移动互联网 大规模知识加速器 DIJKSTRA算法 intelligent transportation system mobile Internet Large Knowledge Collider(LarKC) Dijkstra
  • 相关文献

参考文献16

  • 1马骥,裴玉龙.智能交通系统(ITS)信息采集技术评述[J].哈尔滨工业大学学报,2003,35(1):17-20. 被引量:18
  • 2B61inov:i Z, Bure: P, Jesty P.Intelligent transport system architecture different approaches and future trends[J].Data and Mobility Advances in Intelligent and Soft Computing, 2010,81 : 115-125.
  • 3向文杰.移动互联网发展的回顾与展望[J].电信技术,2009(1):66-69. 被引量:16
  • 4Fensel D,van Harmelen F ,Andersson B ,et al.Towards LarKC:a platform for web-scale reasoning[C]//ICSC' 08,2008 : 524-529.
  • 5Roman D, Bishop B, Toma I, et al.LarKC plug-in annota- tion ianguage[C]//Future Computing, Service Computation, Cognitive, Adaptive, Content, Patterns, 2009 : 366-371.
  • 6Evolved evaluation and revision of LarKC reasoners[EB/OL]. [ 2012-03-10 ].http : //www.larkc.eu/wp-content/uploads/2008/O1/ LarKC_D4.7.2-Evolv&t-Evaluation-Revision-of-plug-ins-deployed- in-use-cases.pdf.
  • 7Overall LarKC architecture and design vI[EB/OL].[2012-03-10]. http ://www.larkc.eu/wp-content/uploads/2008f01/larkc_d532- overall-larkc-architecture-and-design-v 1 _final.pdf.
  • 8Decker S.The semantic web:the roles of XML and RDF[J]. IEEE Internet Computing, 2000,4(5) : 63-73.
  • 9Resource Description Framework(RDF):concepts and abstract syntax[EB/OL]. [2012-03 - 10] .http://hdl.handle .net/10421/2427.
  • 10Kahan J,Koivunen M R.Annotea:an open RDF infrastruc- ture for shared web ann0tations[J].Computer Networks, 2002,39(5) :589-608.

二级参考文献17

  • 1付梦印,李杰,邓志红.限制搜索区域的距离最短路径规划算法[J].北京理工大学学报,2004,24(10):881-884. 被引量:27
  • 2徐立华.求解最短路问题的一个计算机算法[J].系统工程,1989,7(5):46-51. 被引量:21
  • 3司连法,王文静.快速Dijkstra最短路径优化算法的实现[J].测绘通报,2005(8):15-18. 被引量:30
  • 4黄卫 陈里得.智能运输系统(ITS)[M].北京:人民交通出版社,1999.16-20.
  • 5严蔚敏,吴伟民.数据结构[M].2版.北京:清华大学出版社,1997:118-120.
  • 6Benjamin F Zhan. Three fastest shortest path algorithms on real road networks:Data structures and procedures[ J]. Journal of geographic information and decision analysis ,2001,1 ( 1 ) :69 - 82.
  • 7严蔚敏擞据结构[M].北京:清华大学出版社,2008.
  • 8Zhan F B.Three fastest shortest path algorithms on real road networds[J].Journal of Geographic Information and Decision Analysis, 1997,1 ( 1 ) : 69-82.
  • 9[日]社团法人 交通工学研究会编 董国良等译.智能交通系统[M].北京:人民交通出版社,2000.1-11.
  • 10龚洁辉.最短路径算法的改进及其实现方法.解放军测绘学院学报,1998,6(2).

共引文献58

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部