Literature Database Entry

kanemaru2013vehicle


Yohei Kanemaru, Satoshi Matsuura, Masatoshi Kakiuchi, Satoru Noguchi, Atsuo Inomata and Kazutoshi Fujikawa, "Vehicle clustering algorithm for sharing information on traffic congestion," Proceedings of 13th International Conference on ITS Telecommunications (ITST 2013), Tampere, Finland, November 2013, pp. 38-43.

Abstract

We present a method for clustering vehicles that are in the same congested traffic flow. Our goal is to provide a mechanism for sharing information between vehicles in the same situation to ease traffic congestion in urban areas. Because the most accurate source of information about the congested traffic flow is the vehicle at the head of the traffic flow, it first needs to be identified. To do so, we adapt a clustering algorithm by trajectory abstraction. By grouping the vehicles that have the same or similar trajectory into the same cluster, the vehicle at the tail of the traffic flow can discover the vehicle at the head of the traffic flow. Moreover, we adapt an abstracted trajectory representation to compensate for the error in GPS information. Simulation results show that the proposed algorithm provides a higher rate of correctness than existing commonly used clustering algorithms.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Yohei Kanemaru
Satoshi Matsuura
Masatoshi Kakiuchi
Satoru Noguchi
Atsuo Inomata
Kazutoshi Fujikawa

BibTeX reference

@inproceedings{kanemaru2013vehicle,
    author = {Kanemaru, Yohei and Matsuura, Satoshi and Kakiuchi, Masatoshi and Noguchi, Satoru and Inomata, Atsuo and Fujikawa, Kazutoshi},
    title = {{Vehicle clustering algorithm for sharing information on traffic congestion}},
    booktitle = {13th International Conference on ITS Telecommunications (ITST 2013)},
    pages = {38-43},
    year = {2013},
    month = {November},
    address = {Tampere, Finland},
    publisher = {IEEE},
    doi = {10.1109/ITST.2013.6685518},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceeedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.