Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications

Specifications considered in symbolic control are often interpreted qualitatively and controllers are usually classified as correct if they enforce the specification or as incorrect if they do not. In practice, a given ideal specification might be impossible to meet. In that case, it is interesting...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Automatica (Oxford) 2021-05, Vol.127, p.109543, Article 109543
Hauptverfasser: Girard, Antoine, Eqtami, Alina
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page 109543
container_title Automatica (Oxford)
container_volume 127
creator Girard, Antoine
Eqtami, Alina
description Specifications considered in symbolic control are often interpreted qualitatively and controllers are usually classified as correct if they enforce the specification or as incorrect if they do not. In practice, a given ideal specification might be impossible to meet. In that case, it is interesting for the system designer to be able to quantify the distance between achievable behaviors and the specification, and to synthesize the least-violating controller enforcing the closed-loop behavior that is the closest to a correct one. In this paper, we develop such an approach for three types of specifications: safety, uniform reachability and uniform attractivity. We define controllability measures associated to these properties. For finite transition systems, we present dynamic programming algorithms for the computation of these measures and of the associated least-violating controllers. We discuss how these results can be used to synthesize controllers for infinite transition systems via symbolic control techniques. To demonstrate the relevance of our approach, we show an application to adaptive cruise control.
doi_str_mv 10.1016/j.automatica.2021.109543
format Article
fullrecord <record><control><sourceid>hal_cross</sourceid><recordid>TN_cdi_hal_primary_oai_HAL_hal_02533407v2</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0005109821000637</els_id><sourcerecordid>oai_HAL_hal_02533407v2</sourcerecordid><originalsourceid>FETCH-LOGICAL-c402t-1836490bd86d2108c5b2275b0ff4d6c23469fb0a750f2bc122701e4c1ac7a8593</originalsourceid><addsrcrecordid>eNqFUE1LxDAUDKLguvofehXs-pJ-pcdV1BUKXvQcXtPEzdJtliQW-u9NqejR02PmzQzvDSEJhQ0FWt4fNvgV7BGDkbhhwGik6yLPzsiK8ipLGc_Kc7ICgCKNG35Jrrw_RJhTzlZENwp9SEdj-xgxfCZ-Ora2NzKRdgjO9r1ykRvCXnnjE20jQq3CdJc4hXKPrelNmBIcugRDcCiDGWfCn5Q0Oh4VjB38NbnQ2Ht18zPX5OP56f1xlzZvL6-P2yaVObCQ0nhsXkPb8bJjFLgsWsaqogWt866ULMvLWreAVQGatZLGJVCVS4qyQl7U2ZrcLrl77MXJmSO6SVg0YrdtxMwBK7Ish2pkUcsXrXTWe6f0r4GCmLsVB_HXrZi7FUu30fqwWFX8ZTTKCS-NGqTqjFMyiM6a_0O-AW4GiXY</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications</title><source>Elsevier ScienceDirect Journals Complete - AutoHoldings</source><creator>Girard, Antoine ; Eqtami, Alina</creator><creatorcontrib>Girard, Antoine ; Eqtami, Alina</creatorcontrib><description>Specifications considered in symbolic control are often interpreted qualitatively and controllers are usually classified as correct if they enforce the specification or as incorrect if they do not. In practice, a given ideal specification might be impossible to meet. In that case, it is interesting for the system designer to be able to quantify the distance between achievable behaviors and the specification, and to synthesize the least-violating controller enforcing the closed-loop behavior that is the closest to a correct one. In this paper, we develop such an approach for three types of specifications: safety, uniform reachability and uniform attractivity. We define controllability measures associated to these properties. For finite transition systems, we present dynamic programming algorithms for the computation of these measures and of the associated least-violating controllers. We discuss how these results can be used to synthesize controllers for infinite transition systems via symbolic control techniques. To demonstrate the relevance of our approach, we show an application to adaptive cruise control.</description><identifier>ISSN: 0005-1098</identifier><identifier>EISSN: 1873-2836</identifier><identifier>DOI: 10.1016/j.automatica.2021.109543</identifier><language>eng</language><publisher>Elsevier Ltd</publisher><subject>Automatic ; Computer Science ; Dynamic programming ; Engineering Sciences ; Mathematics ; Optimization and Control ; Quantitative synthesis ; Safety ; Symbolic control ; Systems and Control ; Uniform attractivity ; Uniform reachability</subject><ispartof>Automatica (Oxford), 2021-05, Vol.127, p.109543, Article 109543</ispartof><rights>2021 Elsevier Ltd</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c402t-1836490bd86d2108c5b2275b0ff4d6c23469fb0a750f2bc122701e4c1ac7a8593</citedby><cites>FETCH-LOGICAL-c402t-1836490bd86d2108c5b2275b0ff4d6c23469fb0a750f2bc122701e4c1ac7a8593</cites><orcidid>0000-0002-4075-9041</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.automatica.2021.109543$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>230,314,778,782,883,3539,27911,27912,45982</link.rule.ids><backlink>$$Uhttps://hal.science/hal-02533407$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Girard, Antoine</creatorcontrib><creatorcontrib>Eqtami, Alina</creatorcontrib><title>Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications</title><title>Automatica (Oxford)</title><description>Specifications considered in symbolic control are often interpreted qualitatively and controllers are usually classified as correct if they enforce the specification or as incorrect if they do not. In practice, a given ideal specification might be impossible to meet. In that case, it is interesting for the system designer to be able to quantify the distance between achievable behaviors and the specification, and to synthesize the least-violating controller enforcing the closed-loop behavior that is the closest to a correct one. In this paper, we develop such an approach for three types of specifications: safety, uniform reachability and uniform attractivity. We define controllability measures associated to these properties. For finite transition systems, we present dynamic programming algorithms for the computation of these measures and of the associated least-violating controllers. We discuss how these results can be used to synthesize controllers for infinite transition systems via symbolic control techniques. To demonstrate the relevance of our approach, we show an application to adaptive cruise control.</description><subject>Automatic</subject><subject>Computer Science</subject><subject>Dynamic programming</subject><subject>Engineering Sciences</subject><subject>Mathematics</subject><subject>Optimization and Control</subject><subject>Quantitative synthesis</subject><subject>Safety</subject><subject>Symbolic control</subject><subject>Systems and Control</subject><subject>Uniform attractivity</subject><subject>Uniform reachability</subject><issn>0005-1098</issn><issn>1873-2836</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><recordid>eNqFUE1LxDAUDKLguvofehXs-pJ-pcdV1BUKXvQcXtPEzdJtliQW-u9NqejR02PmzQzvDSEJhQ0FWt4fNvgV7BGDkbhhwGik6yLPzsiK8ipLGc_Kc7ICgCKNG35Jrrw_RJhTzlZENwp9SEdj-xgxfCZ-Ora2NzKRdgjO9r1ykRvCXnnjE20jQq3CdJc4hXKPrelNmBIcugRDcCiDGWfCn5Q0Oh4VjB38NbnQ2Ht18zPX5OP56f1xlzZvL6-P2yaVObCQ0nhsXkPb8bJjFLgsWsaqogWt866ULMvLWreAVQGatZLGJVCVS4qyQl7U2ZrcLrl77MXJmSO6SVg0YrdtxMwBK7Ish2pkUcsXrXTWe6f0r4GCmLsVB_HXrZi7FUu30fqwWFX8ZTTKCS-NGqTqjFMyiM6a_0O-AW4GiXY</recordid><startdate>202105</startdate><enddate>202105</enddate><creator>Girard, Antoine</creator><creator>Eqtami, Alina</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>AAYXX</scope><scope>CITATION</scope><scope>1XC</scope><scope>VOOES</scope><orcidid>https://orcid.org/0000-0002-4075-9041</orcidid></search><sort><creationdate>202105</creationdate><title>Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications</title><author>Girard, Antoine ; Eqtami, Alina</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c402t-1836490bd86d2108c5b2275b0ff4d6c23469fb0a750f2bc122701e4c1ac7a8593</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Automatic</topic><topic>Computer Science</topic><topic>Dynamic programming</topic><topic>Engineering Sciences</topic><topic>Mathematics</topic><topic>Optimization and Control</topic><topic>Quantitative synthesis</topic><topic>Safety</topic><topic>Symbolic control</topic><topic>Systems and Control</topic><topic>Uniform attractivity</topic><topic>Uniform reachability</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Girard, Antoine</creatorcontrib><creatorcontrib>Eqtami, Alina</creatorcontrib><collection>CrossRef</collection><collection>Hyper Article en Ligne (HAL)</collection><collection>Hyper Article en Ligne (HAL) (Open Access)</collection><jtitle>Automatica (Oxford)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Girard, Antoine</au><au>Eqtami, Alina</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications</atitle><jtitle>Automatica (Oxford)</jtitle><date>2021-05</date><risdate>2021</risdate><volume>127</volume><spage>109543</spage><pages>109543-</pages><artnum>109543</artnum><issn>0005-1098</issn><eissn>1873-2836</eissn><abstract>Specifications considered in symbolic control are often interpreted qualitatively and controllers are usually classified as correct if they enforce the specification or as incorrect if they do not. In practice, a given ideal specification might be impossible to meet. In that case, it is interesting for the system designer to be able to quantify the distance between achievable behaviors and the specification, and to synthesize the least-violating controller enforcing the closed-loop behavior that is the closest to a correct one. In this paper, we develop such an approach for three types of specifications: safety, uniform reachability and uniform attractivity. We define controllability measures associated to these properties. For finite transition systems, we present dynamic programming algorithms for the computation of these measures and of the associated least-violating controllers. We discuss how these results can be used to synthesize controllers for infinite transition systems via symbolic control techniques. To demonstrate the relevance of our approach, we show an application to adaptive cruise control.</abstract><pub>Elsevier Ltd</pub><doi>10.1016/j.automatica.2021.109543</doi><orcidid>https://orcid.org/0000-0002-4075-9041</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0005-1098
ispartof Automatica (Oxford), 2021-05, Vol.127, p.109543, Article 109543
issn 0005-1098
1873-2836
language eng
recordid cdi_hal_primary_oai_HAL_hal_02533407v2
source Elsevier ScienceDirect Journals Complete - AutoHoldings
subjects Automatic
Computer Science
Dynamic programming
Engineering Sciences
Mathematics
Optimization and Control
Quantitative synthesis
Safety
Symbolic control
Systems and Control
Uniform attractivity
Uniform reachability
title Least-violating symbolic controller synthesis for safety, reachability and attractivity specifications
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-16T03%3A12%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-hal_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Least-violating%20symbolic%20controller%20synthesis%20for%20safety,%20reachability%20and%20attractivity%20specifications&rft.jtitle=Automatica%20(Oxford)&rft.au=Girard,%20Antoine&rft.date=2021-05&rft.volume=127&rft.spage=109543&rft.pages=109543-&rft.artnum=109543&rft.issn=0005-1098&rft.eissn=1873-2836&rft_id=info:doi/10.1016/j.automatica.2021.109543&rft_dat=%3Chal_cross%3Eoai_HAL_hal_02533407v2%3C/hal_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_els_id=S0005109821000637&rfr_iscdi=true