Author
Listed:
- Xiaoguang Niu
- Ying Zhu
- Qingqing Cao
- Xining Zhang
- Wei Xie
- Kun Zheng
Abstract
Finding fastest driving routes is significant for the intelligent transportation system. While predicting the online traffic conditions of road segments entails a variety of challenges, it contributes much to travel time prediction accuracy. In this paper, we propose O-Sense, an innovative online-traffic-prediction based route finding mechanism, which organically utilizes large scale taxi GPS traces and environmental information. O-Sense firstly exploits a deep learning approach to process spatial and temporal taxi GPS traces shown in dynamic patterns. Meanwhile, we model the traffic flow state for a given road segment using a linear-chain conditional random field (CRF), a technique that well forecasts the temporal transformation if provided with further supplementary environmental resources. O-Sense then fuses previously obtained outputs with a dynamic weighted classifier and generates a better traffic condition vector for each road segment at different prediction time. Finally, we perform online route computing to find the fastest path connecting consecutive road segments in the route based on the vectors. Experimental results show that O-Sense can estimate the travel time for driving routes more accurately.
Suggested Citation
Xiaoguang Niu & Ying Zhu & Qingqing Cao & Xining Zhang & Wei Xie & Kun Zheng, 2015.
"An Online-Traffic-Prediction Based Route Finding Mechanism for Smart City,"
International Journal of Distributed Sensor Networks, , vol. 11(8), pages 970256-9702, August.
Handle:
RePEc:sae:intdis:v:11:y:2015:i:8:p:970256
DOI: 10.1155/2015/970256
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:8:p:970256. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.