kth.sePublikationer KTH
Ändra sökning
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Heterogeneous Traffic Intersection Coordination Based on Distributed Model Predictive Control with Invariant Safety Guarantee
KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.ORCID-id: 0000-0002-4663-9390
KTH, Skolan för elektroteknik och datavetenskap (EECS), Intelligenta system, Reglerteknik.ORCID-id: 0000-0002-3672-5316
2022 (Engelska)Ingår i: 2022 IEEE 25TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS (ITSC), Institute of Electrical and Electronics Engineers (IEEE) , 2022, s. 3617-3624Konferensbidrag, Publicerat paper (Refereegranskat)
Abstract [en]

This paper considers the heterogeneous traffic intersection where both Human Driven Vehicles (HDVs) and Connected and Automated Vehicles (CAVs) exist. In such a dynamic environment, CAVs must act in a way such that safety is guaranteed at all times, which is challenging due to the unpredictable nature of human behavior. To guarantee safety, in this paper we consider the worst-case behavior of HDVs by constructing the forward reachable set and ensuring collision avoidance against the forward reachable set within the CAV's planning horizon. To ensure safety at all times, a maximal invariant safe set is designed and used as a terminal constraint such that within this set there is always admissible control for CAVs to react against all possible future behavior of other vehicles safely. Finally, we propose to solve the intersection coordination problem within a Distributed Model Predictive Control (DMPC) framework where all pairwise safety constraints among CAVs are decoupled by prioritization. As a result, each CAVs solves a Mixed Integer Quadratic Programming (MIQP) problem considering collision avoidance with all CAVs of higher priority and with all HDVs. We give theoretical proof of the recursive feasibility of our proposed DMPC formulation and practical invariant safety guarantees. The resulting solution is evaluated in simulation and shows that our coordination framework can provide invariant safe coordination in a heterogeneous traffic intersection.

Ort, förlag, år, upplaga, sidor
Institute of Electrical and Electronics Engineers (IEEE) , 2022. s. 3617-3624
Serie
IEEE International Conference on Intelligent Transportation Systems-ITSC, ISSN 2153-0009
Nationell ämneskategori
Reglerteknik
Identifikatorer
URN: urn:nbn:se:kth:diva-326400DOI: 10.1109/ITSC55140.2022.9922184ISI: 000934720603100Scopus ID: 2-s2.0-85141887807OAI: oai:DiVA.org:kth-326400DiVA, id: diva2:1754027
Konferens
IEEE 25th International Conference on Intelligent Transportation Systems (ITSC), OCT 08-12, 2022, Macau, PEOPLES R CHINA
Anmärkning

QC 20230502

Tillgänglig från: 2023-05-02 Skapad: 2023-05-02 Senast uppdaterad: 2023-05-02Bibliografiskt granskad

Open Access i DiVA

Fulltext saknas i DiVA

Övriga länkar

Förlagets fulltextScopus

Person

Chen, XiaoMårtensson, Jonas

Sök vidare i DiVA

Av författaren/redaktören
Chen, XiaoMårtensson, Jonas
Av organisationen
Reglerteknik
Reglerteknik

Sök vidare utanför DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetricpoäng

doi
urn-nbn
Totalt: 95 träffar
RefereraExporteraLänk till posten
Permanent länk

Direktlänk
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annat format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annat språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf