Abstract
This paper proposes an algorithm for resolution of traffic conflicts occurring on an intersection, intended for Connected Autonomous Vehicle (CAV). The algorithm is based on the trade-off between energy consumption and user-defined value of time. The consequent cooperation opportunities originating from agent heterogeneity are captured by a game-theoretic cooperative-competitive solution approach to develop a computationally feasible, self-enforced, cooperative intersection de-conflicting algorithm. It is intended as a component of a robust framework for strategic control of the vehicle’s powertrain. Monte Carlo simulation is used to showcase the decision-making algorithm’s behaviour, to estimate its efficiency as a function of traffic heterogeneity. The results confirm that the proposed algorithm may offer threefold improvement in energy and time efficiency in relation to a First Come First Served scheme.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Intelligent Transportation Systems
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
