Sampling-based algorithms for optimal motion planning with deterministic μ-calculus specifications

Automatic generation of control programs that satisfy complex task specifications given in high-level specification languages such as temporal logics has been studied extensively. However, optimality of such control programs, for instance with respect to a cost function, has received relatively litt...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 American Control Conference (ACC) s. 735 - 742
Hlavní autoři: Karaman, S., Frazzoli, E.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2012
Témata:
Algorithm design and analysis
Games
Mathematical model
Periodic structures
Reactive power
Trajectory
ISBN:9781457710957, 1457710951
ISSN:0743-1619
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Automatic generation of control programs that satisfy complex task specifications given in high-level specification languages such as temporal logics has been studied extensively. However, optimality of such control programs, for instance with respect to a cost function, has received relatively little attention. In this paper, we study the problem of optimal trajectory synthesis for a large class of specifications, given in the form of deterministic mu-calculus. We propose a sampling-based algorithm, based on the Rapidly-exploring Random Graphs (RRGs), that solves this problem with probabilistic completeness and asymptotic optimality guarantees. We evaluate our algorithm in a simulation studies involving a curvature constrained car. Our simulation results show that in this scenario the algorithm quickly discovers a trajectory that satisfies the specification, and improves this trajectory towards an optimal one if allowed more computation time. We also point out connections to (optimal) memoryless winning strategies in infinite parity games, which may be of independent interest.
AbstractList Automatic generation of control programs that satisfy complex task specifications given in high-level specification languages such as temporal logics has been studied extensively. However, optimality of such control programs, for instance with respect to a cost function, has received relatively little attention. In this paper, we study the problem of optimal trajectory synthesis for a large class of specifications, given in the form of deterministic mu-calculus. We propose a sampling-based algorithm, based on the Rapidly-exploring Random Graphs (RRGs), that solves this problem with probabilistic completeness and asymptotic optimality guarantees. We evaluate our algorithm in a simulation studies involving a curvature constrained car. Our simulation results show that in this scenario the algorithm quickly discovers a trajectory that satisfies the specification, and improves this trajectory towards an optimal one if allowed more computation time. We also point out connections to (optimal) memoryless winning strategies in infinite parity games, which may be of independent interest.
Author Frazzoli, E.
Karaman, S.
Author_xml – sequence: 1
  givenname: S.
  surname: Karaman
  fullname: Karaman, S.
  organization: Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA
– sequence: 2
  givenname: E.
  surname: Frazzoli
  fullname: Frazzoli, E.
  organization: Lab. for Inf. & Decision Syst., Massachusetts Inst. of Technol., Cambridge, MA, USA
BookMark eNotkM1KxDAcxCOu4O66d8FLXqD1_2_z0RyX4hcseFDPS5omayRNS9NFfDefwWey4p6Ggd8Mw6zIIvbREnKNkCOCut3WdV4AFrkokTNUZ2SjZIVMyLJAKOD85LmUM87lgixBsjJDgeqSrFL6AEClBCyJedHdEHw8ZI1OtqU6HPrRT-9doq4faT9MvtOBdv3k-0iHoGOcYfo5I7S1kx07H32avKE_35nRwRzDMdE0WOOdN_ovla7IhdMh2c1J1-Tt_u61fsx2zw9P9XaXeZR8ygRvudIKdSmAOd6ahgFyh0xbV4B2TAhhrG0Z2EpXBXJlsIWqEYyZqnG2XJOb_15vrd0P47x8_NqfPip_AS04XQQ
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1109/ACC.2012.6315419
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781467321020
9781457710940
1467321028
1457710943
9781457710964
145771096X
EndPage 742
ExternalDocumentID 6315419
Genre orig-research
GroupedDBID -~X
23M
29O
6IE
6IF
6IH
6IK
6IL
6IM
6IN
AAJGR
AAWTH
ABLEC
ACGFS
ADZIZ
AFFNX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IJVOP
IPLJI
M43
OCL
RIE
RIL
RIO
RNS
ID FETCH-LOGICAL-i175t-65d59a91a3604f5dcb4015f14aef20af4666ceed40e8a82159c1d08b644c8bfe3
IEDL.DBID RIE
ISBN 9781457710957
1457710951
ISICitedReferencesCount 50
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000310776201004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0743-1619
IngestDate Wed Aug 27 05:11:33 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i175t-65d59a91a3604f5dcb4015f14aef20af4666ceed40e8a82159c1d08b644c8bfe3
PageCount 8
ParticipantIDs ieee_primary_6315419
PublicationCentury 2000
PublicationDate 2012-June
PublicationDateYYYYMMDD 2012-06-01
PublicationDate_xml – month: 06
  year: 2012
  text: 2012-June
PublicationDecade 2010
PublicationTitle 2012 American Control Conference (ACC)
PublicationTitleAbbrev ACC
PublicationYear 2012
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0019960
ssj0000788902
Score 1.6809525
Snippet Automatic generation of control programs that satisfy complex task specifications given in high-level specification languages such as temporal logics has been...
SourceID ieee
SourceType Publisher
StartPage 735
SubjectTerms Algorithm design and analysis
Games
Mathematical model
Periodic structures
Reactive power
Trajectory
Title Sampling-based algorithms for optimal motion planning with deterministic μ-calculus specifications
URI https://ieeexplore.ieee.org/document/6315419
WOSCitedRecordID wos000310776201004&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LTsJAFJ0gcaEbH2B8ZxYuLbS0nU6XhkhcGELiI-zIPJEEWgLFr_Mb_CbvnZaqiRt3bTedzDQ999x77rmE3Fg0gRJOPSOYFxltPB4B50kBS7ROtWBuJMvrYzIc8vE4HTXIbd0LY4xx4jPTwUtXy9e52mCqrMtCAHz0-NxJElb2atX5FIA6LJnVFQR0HaktOIEluKauOEHpYRxsvZ6q-2Rbv_TT7l2_j4KvXqd62a-pKw50Bgf_W-4haX9379FRjUtHpGGyY7L_w3iwRdSTQCV5NvUQxTQV82m-mhVvizWFIJbm8B9ZiDktR_zQZTXYiGLSlupKQOMcnunnhwenjDnENcWuTVQelUnANnkZ3D_3H7xq3II3gxii8Fis41SkgQiZH9lYKwncK7ZBJIzt-cJGwHRw6ZFvuOAQKqQq0D6XEFEpLq0JT0gzyzNzSqgUWvaQG3Ggd5xJ6UeJBdoeKh1a7ssz0sLtmixLR41JtVPnfz--IHt4IqVA65I0i9XGXJFd9V7M1qtr9xl8AXz3ruQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dT8IwFG0ImqgvfoDx2z746KBs3dY9GiLBiIRENLyRdm2RBDYCw1_nb_A32duNqYkvvm17WdMuO_fce-65CN1oMIHiVj3DA4cqqRxGDeeJDJZIGUke2JEsr72w32ejUTSooNuyF0YpZcVnqgGXtpYv03gNqbJm4BnAB4_PLZ9Sl-TdWmVGxYAdFM3KGgL4jpQmnIYn2LYuPwTxod_auD0V9-Gmgkmi5l27DZIvt1G87tfcFQs7nf3_LfgA1b_79_CgRKZDVFHJEdr7YT1YQ_EzBy15MnEAxyTms0m6nGZv8xU2YSxOzZ9kzmc4H_KDF8VoIwxpWywLCY31eMafH445Z8girjD0bYL2KE8D1tFL537Y7jrFwAVnaqKIzAl86Uc8anEvIFT7MhaGffm6RbnSLuGaGq4DS6dEMc5MsBDFLUmYMDFVzIRW3jGqJmmiThAWXAoX2BEzBI8FQhAaakPcvVh6mhFximqwXeNF7qkxLnbq7O_H12inO3zqjXsP_cdztAunk8u1LlA1W67VJdqO37PpanllP4kvxk-yKw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=2012+American+Control+Conference+%28ACC%29&rft.atitle=Sampling-based+algorithms+for+optimal+motion+planning+with+deterministic+%CE%BC-calculus+specifications&rft.au=Karaman%2C+S.&rft.au=Frazzoli%2C+E.&rft.date=2012-06-01&rft.pub=IEEE&rft.isbn=9781457710957&rft.issn=0743-1619&rft.spage=735&rft.epage=742&rft_id=info:doi/10.1109%2FACC.2012.6315419&rft.externalDocID=6315419
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-1619&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-1619&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-1619&client=summon