Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach

We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator)...

Full description

Saved in:
Bibliographic Details
Published inTheory and practice of logic programming Vol. 13; no. 4-5; pp. 831 - 846
Main Authors ERDEM, ESRA, PATOGLU, VOLKAN, SARIBATUR, ZEYNEP G., SCHÜLLER, PETER, URAS, TANSEL
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.07.2013
Subjects
Manufacturing engineering
Regular Papers
decoupled planning
answer set programming
cognitive robotics
Online AccessGet full text
ISSN1471-0684
1475-3081
DOI10.1017/S1471068413000525

Cover

Abstract We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator) do not know about each other's workspace or tasks (e.g., for privacy purposes); 2) every team can lend or borrow robots, but not both (e.g., transportation/calibration of robots between/for different workspaces is usually costly). We present a mathematical definition of this problem and analyze its computational complexity. We introduce a novel, logic-based method to solve this problem, utilizing action languages and answer set programming for representation, and the state-of-the-art ASP solvers for reasoning. We show the applicability and usefulness of our approach by experiments on various scenarios of responsive and energy-efficient cognitive factories.
AbstractList Abstract We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator) do not know about each other's workspace or tasks (e.g., for privacy purposes); 2) every team can lend or borrow robots, but not both (e.g., transportation/calibration of robots between/for different workspaces is usually costly). We present a mathematical definition of this problem and analyze its computational complexity. We introduce a novel, logic-based method to solve this problem, utilizing action languages and answer set programming for representation, and the state-of-the-art ASP solvers for reasoning. We show the applicability and usefulness of our approach by experiments on various scenarios of responsive and energy-efficient cognitive factories. [PUBLICATION ABSTRACT]
We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on its own and where teams are allowed to transfer robots between each other, subject to the following constraints: 1) teams (and the mediator) do not know about each other's workspace or tasks (e.g., for privacy purposes); 2) every team can lend or borrow robots, but not both (e.g., transportation/calibration of robots between/for different workspaces is usually costly). We present a mathematical definition of this problem and analyze its computational complexity. We introduce a novel, logic-based method to solve this problem, utilizing action languages and answer set programming for representation, and the state-of-the-art ASP solvers for reasoning. We show the applicability and usefulness of our approach by experiments on various scenarios of responsive and energy-efficient cognitive factories.
Author ERDEM, ESRA
URAS, TANSEL
SCHÜLLER, PETER
PATOGLU, VOLKAN
SARIBATUR, ZEYNEP G.
Author_xml – sequence: 1
  givenname: ESRA
  surname: ERDEM
  fullname: ERDEM, ESRA
  organization: 1Faculty of Engineering and Natural Sciences, Sabancı University, İstanbul, Turkey
– sequence: 2
  givenname: VOLKAN
  surname: PATOGLU
  fullname: PATOGLU, VOLKAN
  organization: 1Faculty of Engineering and Natural Sciences, Sabancı University, İstanbul, Turkey
– sequence: 3
  givenname: ZEYNEP G.
  surname: SARIBATUR
  fullname: SARIBATUR, ZEYNEP G.
  organization: 1Faculty of Engineering and Natural Sciences, Sabancı University, İstanbul, Turkey
– sequence: 4
  givenname: PETER
  surname: SCHÜLLER
  fullname: SCHÜLLER, PETER
  organization: 1Faculty of Engineering and Natural Sciences, Sabancı University, İstanbul, Turkey
– sequence: 5
  givenname: TANSEL
  surname: URAS
  fullname: URAS, TANSEL
  organization: 2Department of Computer Science, University of Southern California, Los Angeles, USA
BookMark eNp9kE1PwyAch4mZidv0A3gj8eKlCgX64m1ZnJqYeFCPpgFKOxZaKtCD3172cjAzeoLA8_D_8ZuBSW97BcAlRjcY4fz2FdMco6ygmCCEWMpOwDQesYSgAk92e5xs78_AzPsNQjgjKZ2Cj5Xua9230A5Bd9zAwfDew8Y62I0m6MEoGBTvPLQNdFbY4GFYOzu2a8hhp2rNg3V3cAGNbbVMBPeqhnwYnOVyfQ5OG268ujisc_C-un9bPibPLw9Py8VzIglDIWGE5ZhwLhuiWJPnqmRSEFkyhQiidSnELm4uM1FEqCmzmvESpbJRheBZSubgev9uHPs5Kh-qTnupTPyLsqOvMC0pYTQtSUSvjtCNHV0f00WKZDijjGypfE9JZ713qqmkDjxo2wfHtakwqra1V79qjyY-MgcXi3Vf_zrk4PBOOF236keoP61vuMKUrg
CitedBy_id crossref_primary_10_3233_AIC_150697
crossref_primary_10_1007_s10489_021_02423_1
crossref_primary_10_1109_TRO_2018_2795034
crossref_primary_10_1007_s13218_018_0544_x
crossref_primary_10_1177_0278364916688949
crossref_primary_10_1007_s10514_018_9721_x
crossref_primary_10_1016_j_artint_2022_103754
crossref_primary_10_1017_S0269888918000164
crossref_primary_10_1007_s10845_017_1333_3
crossref_primary_10_1109_TE_2014_2318678
crossref_primary_10_1017_S1471068420000459
crossref_primary_10_1609_aimag_v37i3_2678
crossref_primary_10_1017_S1471068416000284
Cites_doi 10.1109/64.73815
10.1145/502807.502810
10.1007/978-3-642-23860-4_2
10.1016/0004-3702(94)00080-K
10.3233/MGS-2009-0133
10.1111/j.1467-8640.1992.tb00383.x
10.1007/978-3-642-30743-0_16
10.1287/mnsc.45.12.1697
10.1007/s11370-012-0119-x
10.3182/20120905-3-HR-2030.00169
10.1109/ETFA.2012.6489636
10.1145/2043174.2043195
10.1109/ICRA.2013.6631224
10.1016/0004-3702(92)90016-Q
10.1016/0004-3702(94)00007-N
10.1016/S0004-3702(02)00186-8
10.1142/S0218488501001277
10.1007/978-3-642-60085-2_17
10.1109/ICRA.2011.5980160
10.1023/A:1018930122475
10.1111/j.1467-8640.2008.00325.x
ContentType Journal Article
Copyright Copyright © 2013 [ESRA ERDEM, VOLKAN PATOGLU, ZEYNEP G. SARIBATUR, PETER SCHÜLLER and TANSEL URAS]
Copyright_xml – notice: Copyright © 2013 [ESRA ERDEM, VOLKAN PATOGLU, ZEYNEP G. SARIBATUR, PETER SCHÜLLER and TANSEL URAS]
DBID AAYXX
CITATION
3V.
7SC
7XB
8AL
8FD
8FE
8FG
8FK
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L7M
L~C
L~D
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
Q9U
7SP
7TB
FR3
DOI 10.1017/S1471068413000525
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ProQuest Central (purchase pre-March 2016)
Computing Database (Alumni Edition)
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ProQuest Central
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic
ProQuest One Academic UKI Edition
ProQuest Central China
ProQuest Central Basic
Electronics & Communications Abstracts
Mechanical & Transportation Engineering Abstracts
Engineering Research Database
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Advanced Technologies & Aerospace Collection
ProQuest Computing
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Mechanical & Transportation Engineering Abstracts
Electronics & Communications Abstracts
Engineering Research Database
DatabaseTitleList Computer Science Database
Technology Research Database
CrossRef
Database_xml – sequence: 1
  dbid: 8FG
  name: ProQuest Technology Collection
  url: https://search.proquest.com/technologycollection1
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
DocumentTitleAlternate Finding optimal plans for multiple teams of robots through a mediator
E. Erdem et al.
EISSN 1475-3081
EndPage 846
ExternalDocumentID 3081351271
10_1017_S1471068413000525
Genre Feature
GroupedDBID -E.
.FH
09C
09E
0E1
0R~
123
29Q
3V.
4.4
5VS
74X
74Y
7~V
8FE
8FG
8R4
8R5
AAAZR
AABES
AABWE
AACJH
AAEED
AAFUK
AAGFV
AAKTX
AANRG
AARAB
AASVR
AAUKB
AAYOK
ABBXD
ABITZ
ABJNI
ABKKG
ABMWE
ABMYL
ABQTM
ABQWD
ABROB
ABTCQ
ABUWG
ABZCX
ACBMC
ACCHT
ACGFS
ACIMK
ACNCT
ACQFJ
ACREK
ACUIJ
ACUYZ
ACWGA
ACYZP
ACZBM
ACZUX
ACZWT
ADCGK
ADDNB
ADFEC
ADGEJ
ADKIL
ADOCW
ADOVH
ADVJH
AEBAK
AEHGV
AEMTW
AENEX
AENGE
AEYYC
AFFUJ
AFKQG
AFKRA
AFKSM
AFLOS
AFLVW
AFUTZ
AGABE
AGBYD
AGJUD
AGOOT
AHQXX
AHRGI
AIGNW
AIHIV
AIOIP
AISIE
AJ7
AJCYY
AJPFC
AJQAS
ALMA_UNASSIGNED_HOLDINGS
ALVPG
ALWZO
AQJOH
ARABE
ARAPS
ATUCA
AUXHV
AZQEC
BBLKV
BENPR
BGHMG
BGLVJ
BLZWO
BMAJL
BPHCQ
C0O
CAG
CBIIA
CCPQU
CCQAD
CCTKK
CFAFE
CHEAL
CJCSC
COF
CS3
DC4
DOHLZ
DU5
DWQXO
EBS
EJD
GNUQQ
HCIFZ
HG-
HST
HZ~
I.6
IH6
IOEEP
IPYYG
IS6
I~P
J36
J38
J3A
J9A
JHPGK
JQKCU
K6V
K7-
KCGVB
KFECR
L98
LW7
M-V
M0N
NIKVX
O9-
OK1
OYBOY
P2P
P62
PQQKQ
PROAC
PYCCK
Q2X
RAMDC
RCA
ROL
RR0
S6-
S6U
SAAAG
T9M
UT1
WFFJZ
WQ3
WXU
WXY
WYP
ZYDXJ
AAYXX
ABGDZ
ABVKB
ABVZP
ABXHF
ACAJB
ACDLN
AFZFC
AKMAY
CITATION
PHGZM
PHGZT
PQGLB
PUEGO
7SC
7XB
8AL
8FD
8FK
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
PRINS
Q9U
7SP
7TB
FR3
ID FETCH-LOGICAL-c350t-535713aacf3e5f77e95cb3c95e0304d9bb016327c6b8acff96d5a902cfe8ba623
IEDL.DBID BENPR
ISSN 1471-0684
IngestDate Thu Sep 04 19:41:18 EDT 2025
Sat Oct 25 09:03:14 EDT 2025
Thu Apr 24 22:56:22 EDT 2025
Wed Oct 01 03:49:31 EDT 2025
Wed Mar 13 05:43:07 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 4-5
Keywords decoupled planning
answer set programming
cognitive robotics
Language English
License https://www.cambridge.org/core/terms
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c350t-535713aacf3e5f77e95cb3c95e0304d9bb016327c6b8acff96d5a902cfe8ba623
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 1436164533
PQPubID 43613
PageCount 16
ParticipantIDs proquest_miscellaneous_1494354293
proquest_journals_1436164533
crossref_citationtrail_10_1017_S1471068413000525
crossref_primary_10_1017_S1471068413000525
cambridge_journals_10_1017_S1471068413000525
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 20130700
2013-07-00
20130701
PublicationDateYYYYMMDD 2013-07-01
PublicationDate_xml – month: 07
  year: 2013
  text: 20130700
PublicationDecade 2010
PublicationPlace Cambridge, UK
PublicationPlace_xml – name: Cambridge, UK
– name: Cambridge
PublicationTitle Theory and practice of logic programming
PublicationTitleAlternate Theory and Practice of Logic Programming
PublicationYear 2013
Publisher Cambridge University Press
Publisher_xml – name: Cambridge University Press
References S1471068413000525_ref33
S1471068413000525_ref11
S1471068413000525_ref34
S1471068413000525_ref12
S1471068413000525_ref35
S1471068413000525_ref13
S1471068413000525_ref36
S1471068413000525_ref14
S1471068413000525_ref37
S1471068413000525_ref15
S1471068413000525_ref38
S1471068413000525_ref16
S1471068413000525_ref17
S1471068413000525_ref39
S1471068413000525_ref18
S1471068413000525_ref19
Lifschitz (S1471068413000525_ref30) 2008
Chevaleyre (S1471068413000525_ref6) 2006; 30
Dovier (S1471068413000525_ref9) 2013; 13
S1471068413000525_ref31
S1471068413000525_ref32
S1471068413000525_ref10
S1471068413000525_ref44
S1471068413000525_ref23
S1471068413000525_ref45
S1471068413000525_ref46
S1471068413000525_ref25
S1471068413000525_ref26
S1471068413000525_ref27
S1471068413000525_ref28
S1471068413000525_ref29
Gelfond (S1471068413000525_ref22) 1998; 2
Giunchiglia (S1471068413000525_ref24) 2004; 153
S1471068413000525_ref8
S1471068413000525_ref7
S1471068413000525_ref4
S1471068413000525_ref5
S1471068413000525_ref2
Trejo (S1471068413000525_ref41) 2001; 9
S1471068413000525_ref40
S1471068413000525_ref3
S1471068413000525_ref42
S1471068413000525_ref20
S1471068413000525_ref1
S1471068413000525_ref43
S1471068413000525_ref21
References_xml – ident: S1471068413000525_ref2
– volume: 30
  start-page: 3
  year: 2006
  ident: S1471068413000525_ref6
  article-title: Issues in multiagent resource allocation.
  publication-title: Informatica
– ident: S1471068413000525_ref39
  doi: 10.1109/64.73815
– volume: 13
  start-page: 149
  year: 2013
  ident: S1471068413000525_ref9
  article-title: Autonomous agents coordination: Action languages meet clp() and linda.
  publication-title: TPLP
– ident: S1471068413000525_ref12
– ident: S1471068413000525_ref35
– ident: S1471068413000525_ref10
– ident: S1471068413000525_ref8
– ident: S1471068413000525_ref7
  doi: 10.1145/502807.502810
– ident: S1471068413000525_ref46
  doi: 10.1007/978-3-642-23860-4_2
– ident: S1471068413000525_ref17
  doi: 10.1016/0004-3702(94)00080-K
– ident: S1471068413000525_ref32
  doi: 10.3233/MGS-2009-0133
– ident: S1471068413000525_ref44
  doi: 10.1111/j.1467-8640.1992.tb00383.x
– ident: S1471068413000525_ref31
– ident: S1471068413000525_ref16
  doi: 10.1007/978-3-642-30743-0_16
– ident: S1471068413000525_ref43
– volume: 2
  start-page: 193
  year: 1998
  ident: S1471068413000525_ref22
  article-title: Action languages.
  publication-title: Electronic Transactions on Artificial Intelligence
– ident: S1471068413000525_ref11
  doi: 10.1287/mnsc.45.12.1697
– ident: S1471068413000525_ref13
  doi: 10.1007/s11370-012-0119-x
– ident: S1471068413000525_ref1
  doi: 10.3182/20120905-3-HR-2030.00169
– ident: S1471068413000525_ref15
  doi: 10.1109/ETFA.2012.6489636
– ident: S1471068413000525_ref4
  doi: 10.1145/2043174.2043195
– ident: S1471068413000525_ref45
– ident: S1471068413000525_ref20
– ident: S1471068413000525_ref26
  doi: 10.1109/ICRA.2013.6631224
– ident: S1471068413000525_ref18
  doi: 10.1016/0004-3702(92)90016-Q
– ident: S1471068413000525_ref37
  doi: 10.1016/0004-3702(94)00007-N
– ident: S1471068413000525_ref29
  doi: 10.1016/S0004-3702(02)00186-8
– ident: S1471068413000525_ref28
– ident: S1471068413000525_ref5
– volume: 9
  start-page: 827
  year: 2001
  ident: S1471068413000525_ref41
  article-title: From planning to searching for the shortest plan: An optimal transition
  publication-title: International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems
  doi: 10.1142/S0218488501001277
– ident: S1471068413000525_ref3
– ident: S1471068413000525_ref33
  doi: 10.1007/978-3-642-60085-2_17
– start-page: 1594
  volume-title: Proc. of AAAI
  year: 2008
  ident: S1471068413000525_ref30
– ident: S1471068413000525_ref38
– ident: S1471068413000525_ref34
– ident: S1471068413000525_ref42
– ident: S1471068413000525_ref14
  doi: 10.1109/ICRA.2011.5980160
– ident: S1471068413000525_ref36
  doi: 10.1023/A:1018930122475
– ident: S1471068413000525_ref21
– ident: S1471068413000525_ref27
– volume: 153
  start-page: 49
  year: 2004
  ident: S1471068413000525_ref24
  article-title: Nonmonotonic causal theories.
  publication-title: AIJ
– ident: S1471068413000525_ref19
  doi: 10.1111/j.1467-8640.2008.00325.x
– ident: S1471068413000525_ref25
– ident: S1471068413000525_ref23
– ident: S1471068413000525_ref40
SSID ssj0016324
Score 2.063688
Snippet We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its workspace on...
Abstract We study the problem of finding optimal plans for multiple teams of robots through a mediator, where each team is given a task to complete in its...
SourceID proquest
crossref
cambridge
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 831
SubjectTerms Manufacturing engineering
Regular Papers
Title Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach
URI https://www.cambridge.org/core/product/identifier/S1471068413000525/type/journal_article
https://www.proquest.com/docview/1436164533
https://www.proquest.com/docview/1494354293
Volume 13
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl: http://www.proquest.com/pqcentral?accountid=15518
  eissn: 1475-3081
  dateEnd: 20241028
  omitProxy: true
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: BENPR
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Technology Collection
  customDbUrl:
  eissn: 1475-3081
  dateEnd: 20241028
  omitProxy: true
  ssIdentifier: ssj0016324
  issn: 1471-0684
  databaseCode: 8FG
  dateStart: 20010101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/technologycollection1
  providerName: ProQuest
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwfV3dS8MwED90vvjitzidEsEnMTjbpW0EERXnEBwiCr7ISNIEhG2d-_j_vcuaMhH2mialXJL76N39fgBnSY5HVwnLTSpSjhZCcW1bOY91S1LDXuwcdSO_dJPOR-v5U3yuQDf0wlBZZdCJXlHnhaF_5Jdo1xN07dE7uR39cGKNouxqoNBQJbVCfuMhxlZhLSJkrBqs3T92X9-qvAKBk_t-o5TqfbJWyHMSiDQN0hgleIjdbRFt4a_V-qu0vSVqb8FG6UKyu_meb8OKHe7AZqBnYOVt3YWv9rdvWWEFqoUBrhj10S4x9FJZKCNkuMWDCSscGxe6mE5YSdvDFPMtJRiQX7M75vUjJ4OXswBCvgcf7cf3hw4v2RS4iUVzykUsMCBVyrjYCpemVgqjYyOFpexoLrX24klNojOc5GSSCyWbkXE20wq9pH2oDYuhPQCWY9SFeilLHEZT2mh0fd2VzLSOVGSly-pwUUmuV96JSW9eT5b2_gm6Ds0g3J4pkcmJIKO_bMl5tWQ0h-VYNrkRdmzha6rzVIfT6jHeLUqYqKEtZjRHojeJFjs-XP6KI1iPPE0GlfE2oDYdz-wxOitTfQKrWfvppDyHv8ll5AQ
linkProvider ProQuest
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3dSxwxEB9EH-xLW21Lr7U1hfoiDb1uNrubghS_jrPqUYqCL2WbZBMo6O31bqX0n_Nvc2YvWRTh3nzNJsuSTGZ-s_PxA_iYVSi6Wjpuc5lztBCaG5dWXJhUUcGe8J6qkU9H2fA8_X4hL5bgJtbCUFpl1Imtoq5qS__IP6NdzxDaIzr5NvnLiTWKoquRQkMHaoVqp20xFgo7jt3_f-jCzXaODvC8t5JkcHi2P-SBZYBbIfsNl0Kio6a19cJJn-dOSWuEVdJR1LBSxiAqEkluM1PgJK-ySmrVT6x3hdEZNT5AE7CSilSh87eydzj68bOLY1Az9La-Kaf8oiKNcVVqWk2DNEYBJWKTu9vd4b6VvG8kWss3eA5PA2Rlu3MZW4MlN16HZ5EOggXt8AJ-Df60JTKsRjV0hSsml2gHGaJiFtMWGYrU1YzVnk1rUzczFmiCmGZtCUtTT7-yXdbqY04GtmKx6flLOH-UfX0Fy-N67F4Dq9DLQz1YZB69N2MNQm3_RRXGJDpxyhc9-NTtXBnu4Kyc56_l5YON7kE_bm5pQyd0IuS4XLRku1symbcBWTR5I57Yna_p5LcHH7rHeJcpQKPHrr6mOQrRKyIE8WbxKzZhdXh2elKeHI2O38KTpKXooBTiDVhuptfuHQKlxrwP0sjg92NfgFtLxyEJ
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%3Ajournal&rft.genre=article&rft.atitle=Finding+optimal+plans+for+multiple+teams+of+robots+through+a+mediator%3A+A+logic-based+approach&rft.jtitle=Theory+and+practice+of+logic+programming&rft.au=ERDEM%2C+ESRA&rft.au=PATOGLU%2C+VOLKAN&rft.au=SARIBATUR%2C+ZEYNEP+G.&rft.au=SCH%C3%9CLLER%2C+PETER&rft.date=2013-07-01&rft.issn=1471-0684&rft.eissn=1475-3081&rft.volume=13&rft.issue=4-5&rft.spage=831&rft.epage=846&rft_id=info:doi/10.1017%2FS1471068413000525&rft.externalDBID=n%2Fa&rft.externalDocID=10_1017_S1471068413000525
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1471-0684&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1471-0684&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1471-0684&client=summon