Literature Database Entry

kim2015development


Y. Kim, J. Ryu, B. Min, H. Lee, C. Mun and K. Ko, "Development and Performance Analysis of Bicycle Collision Avoidance (BCA) Algorithms by Using PreScan and MATLAB," Proceedings of 18th IEEE International Conference on Intelligent Transportation Systems (ITSC 2015), Las Palmas de Gran Canaria, Spain, September 2015, pp. 1506–1511.


Abstract

In this paper, we propose bicycle collision avoidance (BCA) algorithms and analyze their performance. As typical type accidents related with bicycles, we consider both intersection collision and rear crash. Then, the rear crash avoidance (RCA) algorithm and the intersection collision avoidance (ICA) algorithm are respectively developed by utilizing 'PreScan' and 'MATLAB'. The derived analytical approach can explain the condition and effect of bicycle collisions. Furthermore, proposed algorithms are verified from simulations. Consequently, the BCA developing methodology is confirmed to be used as a general solution tool to reduce the cost and the time consumption required for commercialization of safety services under IEEE 802.11p/WAVE wireless networks.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Y. Kim
J. Ryu
B. Min
H. Lee
C. Mun
K. Ko

BibTeX reference

@inproceedings{kim2015development,
    author = {Kim, Y. and Ryu, J. and Min, B. and Lee, H. and Mun, C. and Ko, K.},
    doi = {10.1109/ITSC.2015.246},
    title = {{Development and Performance Analysis of Bicycle Collision Avoidance (BCA) Algorithms by Using PreScan and MATLAB}},
    pages = {1506--1511},
    publisher = {IEEE},
    issn = {2153-0017},
    address = {Las Palmas de Gran Canaria, Spain},
    booktitle = {18th IEEE International Conference on Intelligent Transportation Systems (ITSC 2015)},
    month = {9},
    year = {2015},
   }
   
   

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 proceedings 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.