Sampling-based control synthesis for multi-robot systems under global temporal specifications
This paper proposes a sampling-based algorithm for multi-robot control synthesis under global Linear Temporal Logic (LTL) formulas. Robot mobility is captured by transition systems whose states represent regions in the environment that satisfy atomic propositions. Existing planning approaches under...
Saved in:
| Published in: | 2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) pp. 3 - 13 |
|---|---|
| Main Authors: | , |
| Format: | Conference Proceeding |
| Language: | English |
| Published: |
New York, NY, USA
ACM
18.04.2017
|
| Series: | ACM Other Conferences |
| Subjects: | |
| ISBN: | 9781450349659, 145034965X |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | This paper proposes a sampling-based algorithm for multi-robot control synthesis under global Linear Temporal Logic (LTL) formulas. Robot mobility is captured by transition systems whose states represent regions in the environment that satisfy atomic propositions. Existing planning approaches under global temporal goals rely on graph search techniques applied to a synchronous product automaton constructed among the robots. As the number of robots increases, the state-space of the product automaton grows exponentially and, as a result, graph search techniques become intractable. In this paper, we propose a new sampling-based algorithm that builds incrementally a directed tree that approximates the state-space and transitions of the synchronous product automaton. By approximating the product automaton by a tree rather than representing it explicitly, we require much fewer resources to store it and motion plans can be found by tracing the sequence of parent nodes from the leaves back to the root without the need for sophisticated graph search techniques. This significantly increases scalability of our algorithm compared to existing model-checking methods. We also show that our algorithm is probabilistically complete and asymptotically optimal and present numerical experiments that show that it can be used to model-check product automata with billions of states, which was not possible using an off-the-shelf model checker. |
|---|---|
| AbstractList | This paper proposes a sampling-based algorithm for multi-robot control synthesis under global Linear Temporal Logic (LTL) formulas. Robot mobility is captured by transition systems whose states represent regions in the environment that satisfy atomic propositions. Existing planning approaches under global temporal goals rely on graph search techniques applied to a synchronous product automaton constructed among the robots. As the number of robots increases, the state-space of the product automaton grows exponentially and, as a result, graph search techniques become intractable. In this paper, we propose a new sampling-based algorithm that builds incrementally a directed tree that approximates the state-space and transitions of the synchronous product automaton. By approximating the product automaton by a tree rather than representing it explicitly, we require much fewer resources to store it and motion plans can be found by tracing the sequence of parent nodes from the leaves back to the root without the need for sophisticated graph search techniques. This significantly increases scalability of our algorithm compared to existing model-checking methods. We also show that our algorithm is probabilistically complete and asymptotically optimal and present numerical experiments that show that it can be used to model-check product automata with billions of states, which was not possible using an off-the-shelf model checker. |
| Author | Kantaros, Yiannis Zavlanos, Michael M. |
| Author_xml | – sequence: 1 givenname: Yiannis surname: Kantaros fullname: Kantaros, Yiannis email: ik36@duke.edu organization: Duke University – sequence: 2 givenname: Michael M. surname: Zavlanos fullname: Zavlanos, Michael M. email: mz61@duke.edu organization: Duke University |
| BookMark | eNqNkD1PwzAQho0ACSidGVg8sqQ4tlPbI6r4kioxACOybOdcDEkc2e7AvyfQTkxM7909em94ztDREAdA6KImi7rmzTUjTUMIX_wmFQdoroScAGFcLRt1-Gc_QfOcPwghteKSMXaK3p5NP3Zh2FTWZGixi0NJscP5ayjvkEPGPibcb7sSqhRtLBPJBfqMt0MLCW-6aE2Hp8sY0zTkEVzwwZkS4pDP0bE3XYb5Pmfo9e72ZfVQrZ_uH1c368pQKUvFOJdOta7hVAhlWQOyXUpmFYclIeCUlJxTT7zy1FlDqajbVlpDiBTKSctm6HL3NwCAHlPoTfrSQnGupJjoYkeN67WN8TPrmugff3rvT-_9aZsC-Klw9c8C-wZUJ3CY |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| Copyright | 2017 ACM |
| Copyright_xml | – notice: 2017 ACM |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1145/3055004.3055027 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEL IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781450349659 145034965X |
| EndPage | 13 |
| ExternalDocumentID | 7944987 |
| Genre | orig-research |
| GroupedDBID | 6IE 6IF 6IK 6IL 6IN AAJGR ABLEC ACM ADPZR ALMA_UNASSIGNED_HOLDINGS APO BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK GUFHI IEGSK OCL RIB RIC RIE RIL AAWTH LHSKQ |
| ID | FETCH-LOGICAL-a288t-3448c9dc542779b35e8d683b94e600ec988442f0f9f2cba2271dd8ba00879c8b3 |
| IEDL.DBID | RIE |
| ISBN | 9781450349659 145034965X |
| ISICitedReferencesCount | 13 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000424191900001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:14:58 EDT 2025 Wed Jan 31 06:43:20 EST 2024 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | false |
| Keywords | linear temporal logic multi-agent systems motion planning control synthesis |
| Language | English |
| License | Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Permissions@acm.org |
| LinkModel | DirectLink |
| MeetingName | ICCPS '17: ACM/IEEE 8th International Conference on Cyber-Physical Systems |
| MergedId | FETCHMERGED-LOGICAL-a288t-3448c9dc542779b35e8d683b94e600ec988442f0f9f2cba2271dd8ba00879c8b3 |
| OpenAccessLink | http://dl.acm.org/ft_gateway.cfm?id=3055027&type=pdf |
| PageCount | 11 |
| ParticipantIDs | acm_books_10_1145_3055004_3055027_brief ieee_primary_7944987 acm_books_10_1145_3055004_3055027 |
| PublicationCentury | 2000 |
| PublicationDate | 20170418 2017-April |
| PublicationDateYYYYMMDD | 2017-04-18 2017-04-01 |
| PublicationDate_xml | – month: 04 year: 2017 text: 20170418 day: 18 |
| PublicationDecade | 2010 |
| PublicationPlace | New York, NY, USA |
| PublicationPlace_xml | – name: New York, NY, USA |
| PublicationSeriesTitle | ACM Other Conferences |
| PublicationTitle | 2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) |
| PublicationTitleAbbrev | ICCPS |
| PublicationYear | 2017 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0001948333 |
| Score | 1.7559421 |
| Snippet | This paper proposes a sampling-based algorithm for multi-robot control synthesis under global Linear Temporal Logic (LTL) formulas. Robot mobility is captured... |
| SourceID | ieee acm |
| SourceType | Publisher |
| StartPage | 3 |
| SubjectTerms | Approximation algorithms Automata Computational modeling Computing methodologies -- Artificial intelligence -- Control methods -- Motion path planning Computing methodologies -- Artificial intelligence -- Distributed artificial intelligence Computing methodologies -- Artificial intelligence -- Planning and scheduling Computing methodologies -- Artificial intelligence -- Planning and scheduling -- Multi-agent planning Computing methodologies -- Artificial intelligence -- Planning and scheduling -- Robotic planning Memory management Numerical models Planning Theory of computation -- Formal languages and automata theory |
| Title | Sampling-based control synthesis for multi-robot systems under global temporal specifications |
| URI | https://ieeexplore.ieee.org/document/7944987 |
| WOSCitedRecordID | wos000424191900001&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/eLvHCXMwlV1bS8MwFD7M4YO-eNnEeSOC4IvZJU2b5NXh8GkMNmEvUppLZQ-20naC_94krZuCID61lIbAxyHnkvN9B-CGmcTpeCmszZBjGhKN7ZmnsaN9hiNmAqq5HzbBplO-XIpZC-42XBhjjG8-M3336u_yda7WrlQ2sLZDbY68AzuMRTVXa1tPEZQHQdCo94xoOHBaVtYE-v5ZT41Rrz-GqHgfMjn43-6H0N2S8dBs42aOoGWyY9j_piPYged54hrDsxd8b52SRuO6_xzNPzIb35WrEtnQFHmuLS5ymVeoESpHjkJWoFr4Hy1qmSq7zg2lT7-qeV14mjwsxo-4mZuAE8J5hQObcimhVUgJY0IGoeE64oEU1NjwxijBOaUkHaYiJUomhLCR1lwmTp5OKC6DE2hneWZOAUkxSiWLIqOVW2PTWWUjrkQpQZhmQ9WDawtq7BKCMq45zmHcAB83wPfg9s9_YlmsTNqDjoM9fquFNuIG8bPfP5_DHnE-1rfRXEC7KtbmEnbVe7UqiytvHZ_wVra3 |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MKagvXqY4rxEEX8zWpemSvDocE-cYbMJepDSXyh7spN0E_71JWzcFQXxqKQ2Bj0POJef7DsAVM5HT8VJYG49jGhCN7ZmnsaN9Bi1mfKp5PmyCDQZ8MhHDCtwsuTDGmLz5zDTca36Xr2dq4UplTWs71ObIa7AeUEq8gq21qqgIyn3fL_V7WjRoOjUrawSN_FnMjVGvP8ao5F6ku_O__XfhYEXHQ8Olo9mDikn2YfubkmANnkeRaw1PXvCtdUsadYoOdDT6SGyEl00zZINTlLNtcTqTszkqpcqRI5GlqJD-R-NCqMquc2Pp46963gE8de_GnR4uJyfgiHA-x75NupTQKqCEMSH9wHDd5r4U1NgAxyjBuQUw9mIREyUjQlhLay4jJ1AnFJf-IVSTWWKOAEnRiiVrt41Wbo1NaJWNuSKlBGGaeaoOlxbU0KUEWViwnIOwBD4sga_D9Z__hDKdmrgONQd7-FZIbYQl4se_f76Azd74sR_27wcPJ7BFnMfNm2pOoTpPF-YMNtT7fJql57mlfAKflrn- |
| 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=Proceedings+of+the+8th+International+Conference+on+Cyber-Physical+Systems&rft.atitle=Sampling-based+control+synthesis+for+multi-robot+systems+under+global+temporal+specifications&rft.au=Kantaros%2C+Yiannis&rft.au=Zavlanos%2C+Michael+M.&rft.series=ACM+Other+Conferences&rft.date=2017-04-18&rft.pub=ACM&rft.isbn=9781450349659&rft.spage=3&rft.epage=13&rft_id=info:doi/10.1145%2F3055004.3055027 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450349659/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450349659/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9781450349659/sc.gif&client=summon&freeimage=true |