Institutional Repository
| 受限路网中基于全局学习机制的在线轨迹预测 | |
| Alternative Title | network-constrained on-line path prediction based on global learning mechanism |
| 徐怀野; 丁治明; 刘奎恩; 许佳捷 | |
| 2012 | |
| Source | 计算机科学
![]() |
| ISSN | 1002-137X |
| Volume | 39Issue:8Pages:169-172 |
| English Abstract | 受限路网中移动对象的轨迹预测已成为智能交通关注的热点,被广泛应用于应急保障、车辆导航等领域.但在仅知道移动对象近期轨迹的情况下,现有方法难以解决其未来路径的在线预测问题.提出一种新的在线轨迹预测方法LPP,即通过全局学习机制发现最长频繁路径,构造快速访问结构LPP-tree.基于移动对象近期轨迹可对未来运动路径进行快速在线预测.通过实验,验证了该方法的有效性. |
| Indexed Type | WANFANG ; CNKI ; CSCD |
| Abstract | The trajectory prediction of the moving object in the network-constrained has been the hot spot of the intelligent traffics attention.And it has been widely used in the area of emergency security,GPS and so on.But if we only know the recent trajectory of the moving object,we couldnt predict its future trajectory with the existing methods.A trajectory predictions method LPP(longest frequent path prediction) was put forward,which could construct the fast accessing structure LPP-tree through the global learning mechanism to find out the longest frequent trajectory.Based on the recent trajectory of the moving object,one could predict its future trajectory swiftly online.And the experiment proves the validity of this method. |
| Keyword | 受限路网 移动对象 在线轨迹预测 全局学习机制 |
| Department | 中国科学院软件研究所 北京100190;中国科学院研究生院 北京100049 中国科学院软件研究所 北京100190 |
| Subject | Computer Science (Provided By Thomson Reuters) |
| Sponsorship | 国家自然科学基金项目(60970030)|教育部留学回国人员科研启动基金项目(外教司[2006J331])资助 |
| Language | 中文 |
| CSCD ID | CSCD:4616606 |
| Content Type | 期刊论文 |
| URI | http://ir.iscas.ac.cn/handle/311060/15320 |
| Collection | 中国科学院软件研究所 |
| Recommended Citation GB/T 7714 | 徐怀野,丁治明,刘奎恩,等. 受限路网中基于全局学习机制的在线轨迹预测[J]. 计算机科学,2012,39(8):169-172. |
| APA | 徐怀野,丁治明,刘奎恩,&许佳捷.(2012).受限路网中基于全局学习机制的在线轨迹预测.计算机科学,39(8),169-172. |
| MLA | 徐怀野,et al."受限路网中基于全局学习机制的在线轨迹预测".计算机科学 39.8(2012):169-172. |
| Files in This Item: | There are no files associated with this item. | |||||
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.
Edit Comment