Intelligent transport systems are preparing to welcome connected and automated vehicles (CAVs), although it is uncertain which algorithms should be employed for the effective and efficient management of CAV systems. Even though remarkable improvements in telecommunication technologies, such as vehicle-to-everything (V2X), enable communication and computation sharing among different agents, e.g. vehicles and infrastructures, within existing approaches, a significant part of the computation burden is still typically assigned to central units. Distributed algorithms, on the other hand, could alleviate traffic units from most, if not all, of the high dimensional calculation duties, while improving security and remaining effective. In this paper, we propose a formation-control-inspired distributed algorithm to rearrange vehicles’ passing time periods through an intersection and a novel formulation of the underlying trajectory optimization problem so that vehicles need to exchange and process only a limited amount of information. We include early simulation results to demonstrate the effectiveness of our approach.
| Identifer | oai:union.ndltd.org:DRESDEN/oai:qucosa:de:qucosa:85975 |
| Date | 23 June 2023 |
| Creators | Vitale, Francesco, Roncoli, Claudio |
| Contributors | Technische Universität Dresden |
| Publisher | TUDpress |
| Source Sets | Hochschulschriftenserver (HSSS) der SLUB Dresden |
| Language | English |
| Detected Language | English |
| Type | doc-type:conferenceObject, info:eu-repo/semantics/conferenceObject, doc-type:Text |
| Rights | info:eu-repo/semantics/openAccess |
| Relation | 978-3-95908-296-9, urn:nbn:de:bsz:14-qucosa2-858198, qucosa:85819 |
Page generated in 0.0082 seconds