Literature Database Entry

teixeira2020simulating

Miguel Teixeira, Pedro M. d'Orey and Zafeiris Kokkinogenis, "Simulating collective decision-making for autonomous vehicles coordination enabled by vehicular networks: A computational social choice perspective," Simulation Modelling Practice and Theory, vol. 98, pp. 101983, January 2020.

Abstract

Recent advancements in Intelligent Transportation Systems have endowed vehicles with autonomous driving capabilities as well as V2X communication. Vehicular networks allow vehicles to augment their perception range beyond Line of Sight conditions, enabling novel strategies for effective conflict resolution in challenging scenarios (e.g. platooning) making use of (Multi-Agent System [MAS]) coordination mechanisms (e.g. voting). Simulation-based evaluation of coordination mechanisms should consider real-world constraints, such as kinematics and communication constraints (e.g. packet loss). To this effect, this paper presents a simulation framework that unifies vehicular, communications and MAS simulators in order to test more effectively and realistically these mechanisms. The framework is benchmarked using a lane-merging and platoon voting scenario. Results show the scalability of the framework and the capability to model coordination mechanisms in next to real-world conditions.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Miguel Teixeira
Pedro M. d'Orey
Zafeiris Kokkinogenis

BibTeX reference

@article{teixeira2020simulating,
    author = {Teixeira, Miguel and d'Orey, Pedro M. and Kokkinogenis, Zafeiris},
    doi = {10.1016/j.simpat.2019.101983},
    title = {{Simulating collective decision-making for autonomous vehicles coordination enabled by vehicular networks: A computational social choice perspective}},
    pages = {101983},
    journal = {Simulation Modelling Practice and Theory},
    issn = {1569-190X},
    publisher = {Elsevier},
    month = {1},
    volume = {98},
    year = {2020},
   }
   
   

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.