Literature Database Entry

aramrattana2017simulation


Maytheewat Aramrattana, Tony Larsson, Jonas Jansson and Arne Nåbo, "A simulation framework for cooperative intelligent transport systems testing and evaluation," Elsevier Transportation Research Part F: Traffic Psychology and Behaviour, 2017.


Abstract

Connected and automated driving in the context of cooperative intelligent transport systems (C-ITS) is an emerging area in transport systems research. Interaction and cooperation between actors in transport systems are now enabled by the connectivity by means of vehicle-to-vehicle and vehicle-to-infrastructure (V2X) communication. To ensure the goals of C-ITS, which are safer and more efficient transport systems, testing and evaluation are required before deployment of C-ITS applications. Therefore, this paper presents a simulation framework–-consisting of driving-, traffic-, and network-simulators–-for testing and evaluation of C-ITS applications. Examples of cooperative adaptive cruise control (CACC) applications are presented, and are used as test cases for the simulation framework as well as to elaborate on potential use cases of it. Challenges from combining the simulators into one framework, and limitations are reported and discussed. Finally, the paper concludes with future development directions, and applications of the simulation framework in testing and evaluation of C-ITS.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Maytheewat Aramrattana
Tony Larsson
Jonas Jansson
Arne Nåbo

BibTeX reference

@article{aramrattana2017simulation,
    author = {Aramrattana, Maytheewat and Larsson, Tony and Jansson, Jonas and N{\aa}bo, Arne},
    doi = {10.1016/j.trf.2017.08.004},
    title = {{A simulation framework for cooperative intelligent transport systems testing and evaluation}},
    journal = {Elsevier Transportation Research Part F: Traffic Psychology and Behaviour},
    issn = {1369-8478},
    publisher = {Elsevier},
    year = {2017},
   }
   
   

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.