Abstract
Recently proposed adaptive platooning strategies for connected automated vehicles are able to cope with uncertain vehicle parameters (uncertain driveline time constants), but can handle only acyclic graphs like look-ahead graphs. This prevents from enhancing platooning protocols with synchronized merging maneuvers, where cyclic communication is needed and creates algebraic loops that require well posedness of the inputs. We propose an adaptive platooning strategy for synchronized merging in the cyclic communication scenario. The protocol adopts a set of adaptive control laws, designed via Lyapunov stability theory to cope with uncertain driveline time constants. Well-posedness of the inputs is proven in a distributed way (using information from neighboring vehicles) in spite of uncertainty and cyclic communication. The proposed strategy is shown in a benchmark merging scenario.
Original language | English |
---|---|
Pages (from-to) | 490-500 |
Number of pages | 11 |
Journal | IEEE Transactions on Intelligent Vehicles |
Volume | 6 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2021 |
Bibliographical note
Accepted Author ManuscriptKeywords
- Acceleration
- adaptive control
- automated vehicles
- Benchmark testing
- Merging
- merging maneuvers
- Platooning
- Protocols
- Synchronization
- uncertain vehicle parameters
- Uncertainty
- Vehicle dynamics