Loading…
A distributed simplex architecture for multi-agent systems
We present the Distributed Simplex Architecture (DSA), a new runtime assurance technique that provides safety guarantees for multi-agent systems (MASs). DSA is inspired by the Simplex control architecture of Sha et al., but with some significant differences. The traditional Simplex approach is limit...
Saved in:
Published in: | Journal of systems architecture 2023-01, Vol.134, p.102784, Article 102784 |
---|---|
Main Authors: | , , , , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3 |
---|---|
cites | cdi_FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3 |
container_end_page | |
container_issue | |
container_start_page | 102784 |
container_title | Journal of systems architecture |
container_volume | 134 |
creator | Mehmood, Usama Roy, Shouvik Damare, Amol Grosu, Radu Smolka, Scott A. Stoller, Scott D. |
description | We present the Distributed Simplex Architecture (DSA), a new runtime assurance technique that provides safety guarantees for multi-agent systems (MASs). DSA is inspired by the Simplex control architecture of Sha et al., but with some significant differences. The traditional Simplex approach is limited to single-agent systems or a MAS with a centralized control scheme. DSA addresses this limitation by extending the scope of Simplex to include MASs under distributed control. In DSA, each agent runs a local instance of traditional Simplex such that the preservation of safety in the local instances implies safety for the entire MAS. Control Barrier Functions (CBFs) play a critical role. They are used to define DSA’s core components – the baseline controller and the decision module’s logic for switching between advanced and baseline control – and they provide the basis for the proof of safety. We present a general proof of safety for DSA, provided the CBF-related optimization problem solved by the baseline controller is feasible (has a solution) at each time step for which the baseline controller is in control. We also propose a novel extension to the switching logic designed to avoid states in which this optimization problem is infeasible. Finally, we present experimental results for several case studies, including flocking with collision avoidance, safe navigation of ground rovers through way-points, and safe operation of a microgrid. |
doi_str_mv | 10.1016/j.sysarc.2022.102784 |
format | article |
fullrecord | <record><control><sourceid>elsevier_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1016_j_sysarc_2022_102784</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S1383762122002697</els_id><sourcerecordid>S1383762122002697</sourcerecordid><originalsourceid>FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3</originalsourceid><addsrcrecordid>eNp9j01LxDAQhoMouK7-Aw_9A62TtElbD8Ky-AULXvQc0mSiKe12SVJx_71Z6tnTvAy8z8xDyC2FggIVd30RjkF5XTBgLK1Y3VRnZEWbuswFFfw85bIp81owekmuQugBgHPKVuR-kxkXonfdHNFkwY2HAX-yBPtyEXWcPWZ28tk4D9Hl6hP3MUvHIo7hmlxYNQS8-Ztr8vH0-L59yXdvz6_bzS7XJWcxr-ua6UaJrmLaMG1LDlCpBgTyjoMCjcIC71qhrUoylKlKm4aaFqltqcFyTaqFq_0UgkcrD96Nyh8lBXnyl71c_OXJXy7-qfaw1DD99u3Qy6Ad7jUa55OYNJP7H_ALSMZmlw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A distributed simplex architecture for multi-agent systems</title><source>ScienceDirect Journals</source><creator>Mehmood, Usama ; Roy, Shouvik ; Damare, Amol ; Grosu, Radu ; Smolka, Scott A. ; Stoller, Scott D.</creator><creatorcontrib>Mehmood, Usama ; Roy, Shouvik ; Damare, Amol ; Grosu, Radu ; Smolka, Scott A. ; Stoller, Scott D.</creatorcontrib><description>We present the Distributed Simplex Architecture (DSA), a new runtime assurance technique that provides safety guarantees for multi-agent systems (MASs). DSA is inspired by the Simplex control architecture of Sha et al., but with some significant differences. The traditional Simplex approach is limited to single-agent systems or a MAS with a centralized control scheme. DSA addresses this limitation by extending the scope of Simplex to include MASs under distributed control. In DSA, each agent runs a local instance of traditional Simplex such that the preservation of safety in the local instances implies safety for the entire MAS. Control Barrier Functions (CBFs) play a critical role. They are used to define DSA’s core components – the baseline controller and the decision module’s logic for switching between advanced and baseline control – and they provide the basis for the proof of safety. We present a general proof of safety for DSA, provided the CBF-related optimization problem solved by the baseline controller is feasible (has a solution) at each time step for which the baseline controller is in control. We also propose a novel extension to the switching logic designed to avoid states in which this optimization problem is infeasible. Finally, we present experimental results for several case studies, including flocking with collision avoidance, safe navigation of ground rovers through way-points, and safe operation of a microgrid.</description><identifier>ISSN: 1383-7621</identifier><identifier>EISSN: 1873-6165</identifier><identifier>DOI: 10.1016/j.sysarc.2022.102784</identifier><language>eng</language><publisher>Elsevier B.V</publisher><subject>Control barrier functions ; Distributed flocking ; Runtime assurance ; Simplex control architecture</subject><ispartof>Journal of systems architecture, 2023-01, Vol.134, p.102784, Article 102784</ispartof><rights>2022 Elsevier B.V.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3</citedby><cites>FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Mehmood, Usama</creatorcontrib><creatorcontrib>Roy, Shouvik</creatorcontrib><creatorcontrib>Damare, Amol</creatorcontrib><creatorcontrib>Grosu, Radu</creatorcontrib><creatorcontrib>Smolka, Scott A.</creatorcontrib><creatorcontrib>Stoller, Scott D.</creatorcontrib><title>A distributed simplex architecture for multi-agent systems</title><title>Journal of systems architecture</title><description>We present the Distributed Simplex Architecture (DSA), a new runtime assurance technique that provides safety guarantees for multi-agent systems (MASs). DSA is inspired by the Simplex control architecture of Sha et al., but with some significant differences. The traditional Simplex approach is limited to single-agent systems or a MAS with a centralized control scheme. DSA addresses this limitation by extending the scope of Simplex to include MASs under distributed control. In DSA, each agent runs a local instance of traditional Simplex such that the preservation of safety in the local instances implies safety for the entire MAS. Control Barrier Functions (CBFs) play a critical role. They are used to define DSA’s core components – the baseline controller and the decision module’s logic for switching between advanced and baseline control – and they provide the basis for the proof of safety. We present a general proof of safety for DSA, provided the CBF-related optimization problem solved by the baseline controller is feasible (has a solution) at each time step for which the baseline controller is in control. We also propose a novel extension to the switching logic designed to avoid states in which this optimization problem is infeasible. Finally, we present experimental results for several case studies, including flocking with collision avoidance, safe navigation of ground rovers through way-points, and safe operation of a microgrid.</description><subject>Control barrier functions</subject><subject>Distributed flocking</subject><subject>Runtime assurance</subject><subject>Simplex control architecture</subject><issn>1383-7621</issn><issn>1873-6165</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNp9j01LxDAQhoMouK7-Aw_9A62TtElbD8Ky-AULXvQc0mSiKe12SVJx_71Z6tnTvAy8z8xDyC2FggIVd30RjkF5XTBgLK1Y3VRnZEWbuswFFfw85bIp81owekmuQugBgHPKVuR-kxkXonfdHNFkwY2HAX-yBPtyEXWcPWZ28tk4D9Hl6hP3MUvHIo7hmlxYNQS8-Ztr8vH0-L59yXdvz6_bzS7XJWcxr-ua6UaJrmLaMG1LDlCpBgTyjoMCjcIC71qhrUoylKlKm4aaFqltqcFyTaqFq_0UgkcrD96Nyh8lBXnyl71c_OXJXy7-qfaw1DD99u3Qy6Ad7jUa55OYNJP7H_ALSMZmlw</recordid><startdate>202301</startdate><enddate>202301</enddate><creator>Mehmood, Usama</creator><creator>Roy, Shouvik</creator><creator>Damare, Amol</creator><creator>Grosu, Radu</creator><creator>Smolka, Scott A.</creator><creator>Stoller, Scott D.</creator><general>Elsevier B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>202301</creationdate><title>A distributed simplex architecture for multi-agent systems</title><author>Mehmood, Usama ; Roy, Shouvik ; Damare, Amol ; Grosu, Radu ; Smolka, Scott A. ; Stoller, Scott D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Control barrier functions</topic><topic>Distributed flocking</topic><topic>Runtime assurance</topic><topic>Simplex control architecture</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Mehmood, Usama</creatorcontrib><creatorcontrib>Roy, Shouvik</creatorcontrib><creatorcontrib>Damare, Amol</creatorcontrib><creatorcontrib>Grosu, Radu</creatorcontrib><creatorcontrib>Smolka, Scott A.</creatorcontrib><creatorcontrib>Stoller, Scott D.</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of systems architecture</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Mehmood, Usama</au><au>Roy, Shouvik</au><au>Damare, Amol</au><au>Grosu, Radu</au><au>Smolka, Scott A.</au><au>Stoller, Scott D.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A distributed simplex architecture for multi-agent systems</atitle><jtitle>Journal of systems architecture</jtitle><date>2023-01</date><risdate>2023</risdate><volume>134</volume><spage>102784</spage><pages>102784-</pages><artnum>102784</artnum><issn>1383-7621</issn><eissn>1873-6165</eissn><abstract>We present the Distributed Simplex Architecture (DSA), a new runtime assurance technique that provides safety guarantees for multi-agent systems (MASs). DSA is inspired by the Simplex control architecture of Sha et al., but with some significant differences. The traditional Simplex approach is limited to single-agent systems or a MAS with a centralized control scheme. DSA addresses this limitation by extending the scope of Simplex to include MASs under distributed control. In DSA, each agent runs a local instance of traditional Simplex such that the preservation of safety in the local instances implies safety for the entire MAS. Control Barrier Functions (CBFs) play a critical role. They are used to define DSA’s core components – the baseline controller and the decision module’s logic for switching between advanced and baseline control – and they provide the basis for the proof of safety. We present a general proof of safety for DSA, provided the CBF-related optimization problem solved by the baseline controller is feasible (has a solution) at each time step for which the baseline controller is in control. We also propose a novel extension to the switching logic designed to avoid states in which this optimization problem is infeasible. Finally, we present experimental results for several case studies, including flocking with collision avoidance, safe navigation of ground rovers through way-points, and safe operation of a microgrid.</abstract><pub>Elsevier B.V</pub><doi>10.1016/j.sysarc.2022.102784</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1383-7621 |
ispartof | Journal of systems architecture, 2023-01, Vol.134, p.102784, Article 102784 |
issn | 1383-7621 1873-6165 |
language | eng |
recordid | cdi_crossref_primary_10_1016_j_sysarc_2022_102784 |
source | ScienceDirect Journals |
subjects | Control barrier functions Distributed flocking Runtime assurance Simplex control architecture |
title | A distributed simplex architecture for multi-agent systems |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-23T10%3A35%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-elsevier_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20distributed%20simplex%20architecture%20for%20multi-agent%20systems&rft.jtitle=Journal%20of%20systems%20architecture&rft.au=Mehmood,%20Usama&rft.date=2023-01&rft.volume=134&rft.spage=102784&rft.pages=102784-&rft.artnum=102784&rft.issn=1383-7621&rft.eissn=1873-6165&rft_id=info:doi/10.1016/j.sysarc.2022.102784&rft_dat=%3Celsevier_cross%3ES1383762122002697%3C/elsevier_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c352t-7772c8a6b42cd2cf35004a806e5b50a0ce6f05b96cfa01612a4cd81d9e1f91de3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |