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
When to Terminate: Path Non-existence Verification Improves Sampling-based Motion Planning
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Robotics, Perception and Learning, RPL. Digital Futures, Stockholm, Sweden..ORCID iD: 0000-0001-8163-1004
KTH, School of Electrical Engineering and Computer Science (EECS), Intelligent systems, Robotics, Perception and Learning, RPL. Digital Futures, Stockholm, Sweden..ORCID iD: 0000-0002-0900-1523
Lehigh Univ, Bethlehem, PA 18015 USA..
MIT, 77 Massachusetts Ave, Cambridge, MA 02139 USA..
Show others and affiliations
2021 (English)In: 2021 20Th International Conference On Advanced Robotics (ICAR), Institute of Electrical and Electronics Engineers (IEEE) , 2021, p. 594-600Conference paper, Published paper (Refereed)
Abstract [en]

In this work, we combine a sampling based motion planner with path non-existence verification. We show that, using our approach, it is possible to: 1) provide termination criteria to sampling-based motion planners, based on the problem specific constraints; 2) generate a method for rejection sampling that can adapt to the scenario, for instance, leveraging the relative priority between constraints. Furthermore, we describe a language-guided sampling technique based on IRRT?, that utilizes the results from the path non-existence verification procedure to reduce runtime of the underlying motion planner. The approach is studied using route and motion planning for an autonomous vehicle that aims to service transportation tasks while constrained by rules of the road. We evaluate the proposed approach using a set of real-life inspired traffic scenarios. Finally, we show that the resulting runtime of a motion planner with path non-existence verification is significantly shortened when compared to the same motion planner with traditional termination criteria, such as a resource or time limit.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE) , 2021. p. 594-600
National Category
Robotics and automation Computer Sciences Control Engineering
Identifiers
URN: urn:nbn:se:kth:diva-310886DOI: 10.1109/ICAR53236.2021.9659459ISI: 000766318900090Scopus ID: 2-s2.0-85124695597OAI: oai:DiVA.org:kth-310886DiVA, id: diva2:1651709
Conference
20th International Conference on Advanced Robotics (ICAR), DEC 07-10, 2021, ELECTR NETWORK
Note

Part of proceedings: ISBN 978-1-6654-3684-7, QC 20220413

Available from: 2022-04-13 Created: 2022-04-13 Last updated: 2025-02-05Bibliographically approved
In thesis
1. Least-Violating Motion Planning for Traffic-Compliant Autonomous Driving
Open this publication in new window or tab >>Least-Violating Motion Planning for Traffic-Compliant Autonomous Driving
2022 (English)Doctoral thesis, comprehensive summary (Other academic)
Abstract [en]

Over the last decade, autonomous vehicles has received an increasing amount of interest from industries and research institutes. For autonomous vehicles to properly function alongside human drivers, safety guarantees are a must. Safety in traffic is more than just avoiding collisions with other drivers, it is also necessary to seamlessly act and interact in traffic.

Traffic is an environment rife with rules, both straightforward road rules, e.g. “stay in your lane”, and more subtle road rules, e.g. “give way to emergency vehicles”. Given the safety-critical nature of the environments in which an autonomous system needs to act, it is essential that the specification language chosen to encode its behaviour is able to express the full range of possible rules, both straightforward and subtle. Linear Temporal Logic (LTL) is a popular specification language used in motion planning. While LTL is suitable to express many basic rules, more elaborate rules need to incorporate continuous measures of satisfaction. For instance, it is possible to formalize ``maintain the speed limit'' in LTL. However, there is a big difference between violating the speed limit by \SI{2}{km/h} and \SI{30}{km/h}, this difference can not be quantified by LTL. Such measures are offered by Signal Temporal Logic (STL). In our work, we have used both LTL and STL to encode complex road rules including allowable distances to obstacles, as well as more complex road rules for various situations.

The aim of our work has been to formalize and verify safety guarantees for motion planning in autonomous vehicles. This thesis’ contribution encompasses three main venues of research in this area. First, current methods employed in formal synthesis for motion planning are too computationally expensive to reliably provide motion plans in real-time. To this end, we propose solutions to two different problems, scalability and guided sampling for sampling-based motion planners (Papers A and D). Second, we deal with the problem of encoding road rules for motion planning applications. We propose a new spatial-temporal quantitative semantic for STL, that allows the user to calibrate preference for efficiency (duration of mission) against perceived safety (violation of specification)(Paper B). We later show how STL can be used to encode traffic behaviours (Paper E). Third, we investigate the problem of least-violating motion planning in mixed-traffic scenarios (Papers C and E). Here we consider two different viewpoints, humans as dynamic obstacles to avoid (Paper C) and humans as participants in traffic (Paper E). We demonstrate how least-violating motion planning combined with STL, can be utilized to encode road rules in such a way as to produce different forms of driving styles that are perceivable by human users.

Abstract [sv]

Självkörande fordon har under de senaste åren uppmärksammats från både industrin och akademien. För att självkörande fordon ska fungera jämte människor i trafiken är säkerhetsgarantier ett måste. Säkerhet i trafiken är mer än att bara undgå kollisioner med andra trafikanter. Det är även nödvändigt att dessa fordon kan interagera och sammarbeta med andra trafikanter. 

Trafik är en miljö med många regler, både tydliga, såsom ``stanna i ditt körfält'', och mer otydliga regler, såsom ``väj för utryckningsfordon''. Givet den säkerhetskritiska karaktären hos den miljö där det självkörande fordonet verkar, så måste ett specifikationsspråk som kan uttrycka både tydliga och subtila regler användas. Linjär tidslogik (LTL) är ett populärt specifikationsspråk som används inom banplanering. Många grundläggande regler kan beskrivas med LTL, men mer komplexa regler kräver att man kan mäta graden av tillfredsställelse. Det är möjligt att formalisera ``håll dig till hastighetsbegränsningen'' med LTL, men det är en stor skillnad mellan att bryta hastighetsbegränsningen med \SI{2}{km/h} och \SI{30}{km/h}. Denna skillnad kan inte mätas med LTL. Signal tidslogik (STL) kan användas för att mäta sådana skillnader. I vårt arbete använder vi LTL och STL för att formalisera avancerade trafikregler för att t.ex. hålla avstånd till väghinder, samt mer avancerade trafikregler i olika situationer. 

Vårt mål har varit att formalisera och verifiera säkerhetsgarantier för banplanering till självkörande fordon. Denna avhandlings bidrag innefattar tre huvudsakliga spörsmål. Till att börja med identifierar vi att nuvarande metoder för banplanering har för hög tidskomplexitet för att tillförlitligt implementeras för att uppnå banplanering i realtid. Vi föreslår lösningar för två problem inom detta område, skalbarhet, och guidad sampling för sampling-baserad banplanering (Artiklar A och D). Vidare undersöker vi problemet med att formalisera trafikregler för banplanering. Vi föreslår en ny rum-tids kvantitativ semantik för STL, som möjliggör användaren att kalibrera banans effektivitet (uppgiftens varaktighet) mot användarens uppfattade säkerhet (överträdelse av formaliserade regler)(Artikel B). Slutligen visar vi hur STL kan användas för att formalisera beteende i trafiken (Artikel E). Vi undersöker problemet med banplanering som minimerar säkerhetsöverträdelse i trafikscenarion med människor inblandade (Artiklar C och E). I dessa verk har vi två olika synvinklar, antingen människor som dynamiska hinder som måste undvikas (Artikel C), eller människor som medtrafikanter (Artikel E). Vi visar hur vår metod, kombinerad med STL, kan användas för att formalisera trafikregler på sådant sätt att det går att generera olika körstilar som kan uppfattas av människor.

Place, publisher, year, edition, pages
KTH Royal Institute of Technology, 2022. p. 75
Series
TRITA-EECS-AVL ; 2022:21
Keywords
Motion Planning, Formal Methods, Temporal Logic
National Category
Computer Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:kth:diva-312153 (URN)978-91-7873-929-5 (ISBN)
Public defence
2022-06-01, https://kth-se.zoom.us/j/67837765464, F3, Lindstedtsvägen 26 & 28, Stockholm, 15:00 (English)
Opponent
Supervisors
Note

QC 20220516

Available from: 2022-05-16 Created: 2022-05-13 Last updated: 2022-06-25Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Karlsson, JesperVarava, AnastasiiaKragic, DanicaTumova, Jana

Search in DiVA

By author/editor
Karlsson, JesperVarava, AnastasiiaKragic, DanicaTumova, Jana
By organisation
Robotics, Perception and Learning, RPL
Robotics and automationComputer SciencesControl Engineering

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 90 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