kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Formal Verification of Regional Rules for Connected and Automated Vehicles
KTH, School of Electrical Engineering and Computer Science (EECS).
2024 (English)Independent thesis Advanced level (degree of Master (Two Years)), 20 credits / 30 HE creditsStudent thesisAlternative title
Formell Verifiering av Lokala Regler för Uppkopplade och Automatiserade Fordon (Swedish)
Abstract [en]

In this work, we develop a temporal logic-based safety framework for Autonomous Intersection Management (AIM) to ensure the safety of connected vehicles navigating through intelligent intersections. Traditional AIM systems face challenges in balancing safety and efficiency, often relying on central decision-making to enhance intersection coordination. Our approach addresses this challenge by leveraging formal methods, specifically temporal logic and reachability analysis, to provide rigorous safety guarantees. We begin by specifying the required behavior for vehicles passing through intersections as linear temporal logic formulas. These specifications are then decomposed into a series of Hamilton-Jacobi reachability analyses using temporal logic trees, allowing for the automated verification of intersection behaviors. This method enables the computation of safe time-state corridors for vehicles, facilitating explicit safety-efficiency trade-offs while considering decision uncertainties. Additionally, we determine safe driving limits to ensure vehicles remain within their designated corridors. Our framework is evaluated using simulations of both 3-way and 4-way intersections, demonstrating its ability to verify and enforce safety in real-time across various scenarios.

Abstract [sv]

I detta arbete presenterar vi ett nytt säkerhetssystem för intelligenta regioner som möter utmaningarna med att koordinera uppkopplade och automatiserade fordon. Intelligenta regioner omfattar områden som korsningar, motorvägar och stadsgator, där trafiken hanteras av intelligenta transportsystem som anpassar sig till realtidsförhållanden, regionala trafikmönster och specifika händelser. Med hjälp av temporallogik och nåbarhetsanalys erbjuder vår metod starka säkerhetsgarantier över olika trafiksituationer. Inledningsvis definierar vi det önskade beteendet för alla fordon som navigerar genom korsningen med hjälp av temporallogiska påståenden i form av en säkerhetsspecifikation. Därefter dekonstrueras specifikationen automatiskt till en sekvens av mindre, hanterbara Hamilton-Jacobi nåbarhetsanalyser genom en nyligen utvecklad beräkningsmetod kallad temporala logikträd. Detta möjliggör automatiserad verifiering av fordonsbeteenden och en explicit avvägning mellan säkerhet och effektivitet. I detta steg tilldelas fordonen färdvägskorridorer som garanterar att både traditionella trafikregler och specifika beteendekrav uppfylls. Vi fastställer även säkra körgränser för att säkerställa att fordonen förblir inom sina tilldelade korridorer. Vårt system demonstreras genom simuleringar av trevägs- och fyrvägs-korsningar, där fordon med potentiellt kolliderande färdvägar garanteras säker passage.

Place, publisher, year, edition, pages
2024. , p. 40
Series
TRITA-EECS-EX ; 2024:953
Keywords [en]
Safety framework, Intelligent Intersections, Connected Vehicles, Traffic Safety, Temporal Logic, Reachability Analysis, Formal Methods
Keywords [sv]
Intelligenta Korsningar, Uppkopplade och Automatiserade Fordon, Trafiksä- kerhet, Temporallogik, Nåbarhetsanalys, Formella Metoder
National Category
Electrical Engineering, Electronic Engineering, Information Engineering
Identifiers
URN: urn:nbn:se:kth:diva-361111OAI: oai:DiVA.org:kth-361111DiVA, id: diva2:1943682
Supervisors
Examiners
Available from: 2025-03-17 Created: 2025-03-11 Last updated: 2025-03-17Bibliographically approved

Open Access in DiVA

fulltext(2655 kB)25 downloads
File information
File name FULLTEXT02.pdfFile size 2655 kBChecksum SHA-512
284842fe05a04f131248f5862aaa73a00edcd4661a74881db3ce9fe03bbb785d757093b0eace99728712cf0af532d0e1bb17915c586518982c91e1ebcec820fd
Type fulltextMimetype application/pdf

By organisation
School of Electrical Engineering and Computer Science (EECS)
Electrical Engineering, Electronic Engineering, Information Engineering

Search outside of DiVA

GoogleGoogle Scholar
Total: 25 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 281 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf