natzschka2025simopticon
Abstract
Platooning control – the automatic distance control in a chain of vehicles – has seen more than 2000 publications in the past 30 years, along with a corresponding number of different algorithms. However, comparisons between such controllers have rarely been done. Moreover, a fair comparison requires that all controller parameters are chosen to be optimal, often manually, which is a labor intensive and hard to replicate process. In this article we demonstrate the benefits of a methodology for parameter selection that encompasses: an evaluator employing a common metric, a simulator component, and an optimizer, all integrated into an optimization framework – along with an open-source reference implementation. We also discuss the trade-offs of different optimization algorithms, both from the literature and custom-built, for parameter optimization of platooning controllers.
Quick access
- Original Version (at publishers web site)
- Authors' Version (PDF on this web site)
- BibTeX
Contact
- Per Natzschka
- Burkhard Hensel
- Christoph Sommer
BibTeX reference
@article{natzschka2025simopticon,
author = {Natzschka, Per and Hensel, Burkhard and Sommer, Christoph},
title = {{Simopticon: Automated Optimization of Vehicular Platooning Controllers}},
journal = {Elsevier Ad Hoc Networks},
doi = {10.1016/j.adhoc.2025.103781},
issn = {1570-8705},
note = {to appear},
publisher = {Elsevier},
year = {2025},
}
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.