Provably-correct coordination of large collections of agents with counting temporal logic constraints

In this paper, we consider the problem of coordinating a large collection of homogeneous agents subject to a novel class of constraints: counting temporal logic constraints. Counting constraints arise naturally in many multi-agent planning problems where the identity of the agents is not important f...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2017 ACM IEEE 8th International Conference on Cyber Physical Systems (ICCPS) s. 249 - 258
Hlavní autoři: Sahin, Yunus Emre, Nilsson, Petter, Ozay, Necmiye
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: New York, NY, USA ACM 18.04.2017
Edice:ACM Other Conferences
Témata:
Computer science
Computer systems organization > Embedded and cyber-physical systems > Robotics > Robotic autonomy
Computing methodologies > Artificial intelligence > Control methods > Motion path planning
Computing methodologies > Artificial intelligence > Planning and scheduling > Multi-agent planning
Computing methodologies > Artificial intelligence > Planning and scheduling > Planning for deterministic actions
Correct-by-construction synthesis
Cyber-physical systems
Electrical engineering
Planning
Robot kinematics
Theory of computation > Logic > Abstraction
Theory of computation > Logic > Modal and temporal logics
Vehicle dynamics
correct-by-construction synthesis
ISBN:9781450349659, 145034965X
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 In this paper, we consider the problem of coordinating a large collection of homogeneous agents subject to a novel class of constraints: counting temporal logic constraints. Counting constraints arise naturally in many multi-agent planning problems where the identity of the agents is not important for the task to be completed. We introduce a formal language to capture such tasks and present an optimization-based technique to synthesize plans for large collections of agents in a way to guarantee the satisfaction of tasks specified in this formalism.
AbstractList In this paper, we consider the problem of coordinating a large collection of homogeneous agents subject to a novel class of constraints: counting temporal logic constraints. Counting constraints arise naturally in many multi-agent planning problems where the identity of the agents is not important for the task to be completed. We introduce a formal language to capture such tasks and present an optimization-based technique to synthesize plans for large collections of agents in a way to guarantee the satisfaction of tasks specified in this formalism.
Author Nilsson, Petter
Ozay, Necmiye
Sahin, Yunus Emre
Author_xml – sequence: 1
  givenname: Yunus Emre
  surname: Sahin
  fullname: Sahin, Yunus Emre
  email: ysahin@umich.edu
  organization: University of Michigan
– sequence: 2
  givenname: Petter
  surname: Nilsson
  fullname: Nilsson, Petter
  email: pettni@umich.edu
  organization: University of Michigan
– sequence: 3
  givenname: Necmiye
  surname: Ozay
  fullname: Ozay, Necmiye
  email: necmiye@umich.edu
  organization: University of Michigan
BookMark eNqNkD1PwzAURY0ACSidGVgysrT4xXYSj6jiS6oEA8yWnTwHQ2pXjgH13-PSTkxMV--eqzecM3Lkg0dCLoDOAbi4ZlQISvn8N0s4IFNZNxlQxmUl5OGf-4RMx_GdUgqSN4yxU4LPMXxpM2xmbYgR21S0IcTOeZ1c8EWwxaBjj7kdhkxzN25L3aNPY_Ht0ltGnz453xcJV-sQ9VAMoXdt7v2YonZ5eE6OrR5GnO5zQl7vbl8WD7Pl0_3j4mY502XTpJnsrOE1Uii7jlsjjIW6ldxWAkRVU26otWChKUsUsmoqKduuxtoIZgChATYhl7u_DhHVOrqVjhtVyywAeKZXO6rblTIhfIwKqNp6VHuPau8xT-f_nCoTHVr2A47Pc4o
CODEN IEEPAD
ContentType Conference Proceeding
Copyright 2017 ACM
Copyright_xml – notice: 2017 ACM
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1145/3055004.3055021
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 9781450349659
145034965X
EndPage 258
ExternalDocumentID 7945014
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-9dfb47e012dd4fb5bf17c94f65156704b0ff1f1822e5968699cd7e7b53b1e1813
IEDL.DBID RIE
ISBN 9781450349659
145034965X
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000424191900028&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:15:01 EDT 2025
Wed Jan 31 06:47:36 EST 2024
Wed Jan 31 06:43:20 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly false
Keywords correct-by-construction 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-9dfb47e012dd4fb5bf17c94f65156704b0ff1f1822e5968699cd7e7b53b1e1813
OpenAccessLink http://dl.acm.org/ft_gateway.cfm?id=3055021&type=pdf
PageCount 10
ParticipantIDs ieee_primary_7945014
acm_books_10_1145_3055004_3055021
acm_books_10_1145_3055004_3055021_brief
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.8113288
Snippet In this paper, we consider the problem of coordinating a large collection of homogeneous agents subject to a novel class of constraints: counting temporal...
SourceID ieee
acm
SourceType Publisher
StartPage 249
SubjectTerms Computer science
Computer systems organization -- Embedded and cyber-physical systems -- Robotics -- Robotic autonomy
Computing methodologies -- Artificial intelligence -- Control methods -- Motion path planning
Computing methodologies -- Artificial intelligence -- Planning and scheduling -- Multi-agent planning
Computing methodologies -- Artificial intelligence -- Planning and scheduling -- Planning for deterministic actions
Correct-by-construction synthesis
Cyber-physical systems
Electrical engineering
Planning
Robot kinematics
Theory of computation -- Logic -- Abstraction
Theory of computation -- Logic -- Modal and temporal logics
Vehicle dynamics
Title Provably-correct coordination of large collections of agents with counting temporal logic constraints
URI https://ieeexplore.ieee.org/document/7945014
WOSCitedRecordID wos000424191900028&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/eLvHCXMwlV1NS8MwGH7Zhge9TLeJ84sIghe7tU26JEcpDg9j7DBlt9I0CQzmKms38N-bpNUpCOKpJfQD8r7h_Uie5wG45UEaaMyxJxkXngkB0uO-WVc6pJSySNLMcem9TOh0yhYLPmvA_RcWRinlDp-pgb11e_kyz7a2VTY0vmO3wZrQNB-qsFr7fgonDGNcs_cEJBpaLivjAgN3tVygzTR7_SGi4mLIuP2_vx9Dbw_GQ7OvMHMCDbXuQPtTjQHVi7MDR9-oBbugzCu7VKzevdjqb2QlinNTZy6r5h_KNZrYM-DINQ4ctqGwgw8WaVUg251FcS0jgeYVfdUKWWHmDFmNT6csURY9eB4_zuMnr5ZU8NKQsdLjUgtClYlKUhItIqEDmnGirSD6iPpE-FoH2tQcoYr4iI04zyRVVERYBMokA_gUWut8rc4A4dRkbtIkDIJpQlKTWhBNfSYwUZILhvtwY-Y7sbVCkVTw5yipbZLUNunD3Z_PJGKzVLoPXWuR5K3i4EhqY5z_PnwBh6ENv-6EzSW0ys1WXcFBtiuXxebaOc4H6u2_HA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFL1sU1BfptvE-RlB8MXOtUmX5FGGY-Ice5iyt9I0CQx0k7Ub-O9N0ropCOJTS2gp9N5wP3LPOQBX3I99jTn2JOPCMyFAerxt9pUOKKUslDRxXHovAzocssmEj0pws8bCKKXc8Jlq2Vt3li_nydK2ym6N79hjsDJshYQEfo7W2nRUOGEY44K_xyfhrWWzMk7QclfLBlqOk7cfMiouivSq__v-PjQ2cDw0WgeaAyipWQ2qX3oMqNieNdj7Ri5YB2VeWcXi9cPrWgWOJEPduak0p3n7D801GtgpcORaBw7dkNrFO4u1SpHtz6JuISSBxjmB1Suy0swJsiqfTlsiSxvw3Lsfd_teIargxQFjmcelFoQqE5ekJFqEQvs04URbSfQObRPR1trXpuoIVMg7rMN5IqmiIsTCVyYdwIdQmc1n6ggQjk3uJk3KIJgmJDbJBdG0zQQmSnLBcBMuzf-ObLWQRjkAOowKm0SFTZpw_eczkVhMlW5C3Vokes9ZOKLCGMe_L1_ATn_8NIgGD8PHE9gNbDB28zanUMkWS3UG28kqm6aLc-dEnwh7wmM
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=Provably-correct+coordination+of+large+collections+of+agents+with+counting+temporal+logic+constraints&rft.au=Sahin%2C+Yunus+Emre&rft.au=Nilsson%2C+Petter&rft.au=Ozay%2C+Necmiye&rft.series=ACM+Other+Conferences&rft.date=2017-04-18&rft.pub=ACM&rft.isbn=9781450349659&rft.spage=249&rft.epage=258&rft_id=info:doi/10.1145%2F3055004.3055021
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