hardes2019formation
Abstract
Platooning has repeatedly been shown to have the potential to increase both the efficiency and the safety of future road traffic. Yet, while there is ample research that illustrates its potential in freeway scenarios, the biggest challenges of traffic efficiency and safety lie in urban environments, which pose unique challenges: They are characterized by the presence of tight speed limits, intersections, traffic lights, and buildings. Moreover, work that has targeted such scenarios has, so far, not considered platoon formation strategies - or only considered idealized vehicle dynamics, platooning controllers, or wireless network dynamics. We fill this gap by investigating dynamic platoon formation at urban intersections controlled by regular traffic lights. We propose a fuel-efficient strategy for platoon formation at such intersections and investigate its performance using realistic simulation models of (all of) vehicle dynamics, platooning controllers, and wireless networking. Our investigation reveals both challenges in wireless networking as well as the potential of the proposed strategy to simultaneously save both 15 % of fuel and 14 % of travel time.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
BibTeX reference
@inproceedings{hardes2019formation,
author = {Hardes, Tobias and Sommer, Christoph},
title = {{Dynamic Platoon Formation at Urban Intersections}},
booktitle = {44th IEEE Conference on Local Computer Networks (LCN 2019), Poster Session},
address = {Osnabr{\"{u}}ck, Germany},
doi = {10.1109/lcn44214.2019.8990846},
month = {October},
publisher = {IEEE},
year = {2019},
}
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.
The following applies to all papers listed above that have IFIP copyrights: © IFIP, (YEAR). This is the author's version of the work. It is posted here by permission of IFIP for your personal use. Not for redistribution. The definitive version was published in PUBLICATION, {VOL#, ISS#, (DATE)}, http://IFIP DL URL.