{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,10]],"date-time":"2024-08-10T04:36:27Z","timestamp":1723264587650},"reference-count":46,"publisher":"Cambridge University Press (CUP)","issue":"4-5","license":[{"start":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T00:00:00Z","timestamp":1380067200000},"content-version":"unspecified","delay-in-days":86,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory and Practice of Logic Programming"],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>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.<\/jats:p>","DOI":"10.1017\/s1471068413000525","type":"journal-article","created":{"date-parts":[[2013,9,25]],"date-time":"2013-09-25T16:24:58Z","timestamp":1380126298000},"page":"831-846","source":"Crossref","is-referenced-by-count":15,"title":["Finding optimal plans for multiple teams of robots through a mediator: A logic-based approach"],"prefix":"10.1017","volume":"13","author":[{"given":"ESRA","family":"ERDEM","sequence":"first","affiliation":[]},{"given":"VOLKAN","family":"PATOGLU","sequence":"additional","affiliation":[]},{"given":"ZEYNEP G.","family":"SARIBATUR","sequence":"additional","affiliation":[]},{"given":"PETER","family":"SCH\u00dcLLER","sequence":"additional","affiliation":[]},{"given":"TANSEL","family":"URAS","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2013,9,25]]},"reference":[{"key":"S1471068413000525_ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23860-4_2"},{"key":"S1471068413000525_ref44","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.1992.tb00383.x"},{"key":"S1471068413000525_ref42","unstructured":"Turner H. 2002. Polynomial-length planning spans the polynomial hierarchy. In Proc. of JELIA, 111\u2013124."},{"key":"S1471068413000525_ref38","unstructured":"Stuart C. 1985. An implementation of a multi-agent plan synchronizer. In Proc. of IJCAI, 1031\u20131033."},{"key":"S1471068413000525_ref37","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00007-N"},{"key":"S1471068413000525_ref36","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018930122475"},{"key":"S1471068413000525_ref35","unstructured":"Nair R. , Tambe M. and Marsella S. 2002. Team formation for reformation in multiagent domains like robocuprescue. In Proc. of RoboCup, 150\u2013161."},{"key":"S1471068413000525_ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-60085-2_17"},{"key":"S1471068413000525_ref31","unstructured":"Lin S.-H. 2011. Coordinating time-constrained multi-agent resource sharing with fault detection. In Proc. of IEEM, 1000\u20131004."},{"key":"S1471068413000525_ref28","unstructured":"Kowalski R. A. and Sadri F. 2013. Towards a logic-based unifying framework for computing. CoRR abs\/1301.6905."},{"key":"S1471068413000525_ref27","unstructured":"Hunsberger L. and Grosz B. J. 2000. A combinatorial auction for collaborative planning. In Proc. of ICMAS, 151\u2013158."},{"key":"S1471068413000525_ref24","first-page":"49","article-title":"Nonmonotonic causal theories.","volume":"153","author":"Giunchiglia","year":"2004","journal-title":"AIJ"},{"key":"S1471068413000525_ref23","unstructured":"Georgeff M. P. 1988. Communication and interaction in multi-agent planning. In Readings in Distributed AI, 200\u2013204."},{"key":"S1471068413000525_ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00080-K"},{"key":"S1471068413000525_ref16","doi-asserted-by":"crossref","unstructured":"Erdem E. and Patoglu V. 2012. Applications of action languages in cognitive robotics. In Correct Reasoning 229\u2013246.","DOI":"10.1007\/978-3-642-30743-0_16"},{"key":"S1471068413000525_ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s11370-012-0119-x"},{"key":"S1471068413000525_ref11","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.45.12.1697"},{"key":"S1471068413000525_ref9","first-page":"149","article-title":"Autonomous agents coordination: Action languages meet clp() and linda.","volume":"13","author":"Dovier","year":"2013","journal-title":"TPLP"},{"key":"S1471068413000525_ref8","unstructured":"Decker K. and Lesser V. 1994. Designing a family of coordination algorithms. In Proc. of DAI, 65\u201384."},{"key":"S1471068413000525_ref32","doi-asserted-by":"publisher","DOI":"10.3233\/MGS-2009-0133"},{"key":"S1471068413000525_ref7","doi-asserted-by":"publisher","DOI":"10.1145\/502807.502810"},{"key":"S1471068413000525_ref6","first-page":"3","article-title":"Issues in multiagent resource allocation.","volume":"30","author":"Chevaleyre","year":"2006","journal-title":"Informatica"},{"key":"S1471068413000525_ref5","unstructured":"Casolary M. and Lee J. 2011. Representing the language of the causal calculator in answer set programming. In Proc. of ICLP (Technical Communications), 51\u201361."},{"key":"S1471068413000525_ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2043174.2043195"},{"key":"S1471068413000525_ref2","unstructured":"Alami R. , Ingrand F. and Qutub S. 1998. A scheme for coordinating multi-robots planning activities and plans execution. In Proc. of ECAI, 617\u2013621."},{"key":"S1471068413000525_ref30","first-page":"1594","volume-title":"Proc. of AAAI","author":"Lifschitz","year":"2008"},{"key":"S1471068413000525_ref1","doi-asserted-by":"crossref","unstructured":"Aker E. , Patoglu V. and Erdem E. 2012. Answer set programming for reasoning with semantic knowledge in collaborative housekeeping robotics. In Proc. of IFAC SYROCO.","DOI":"10.3182\/20120905-3-HR-2030.00169"},{"key":"S1471068413000525_ref34","unstructured":"McCain N. and Turner H. 1997. Causal theories of action and change. In Proc. of AAAI\/IAAI, 460\u2013465."},{"key":"S1471068413000525_ref14","doi-asserted-by":"crossref","unstructured":"Erdem E. , Haspalamutgil K. , Palaz C. , Patoglu V. and Uras T. 2011. Combining high-level causal reasoning with low-level geometric reasoning and motion planning for robotic manipulation. In Proc. of ICRA.","DOI":"10.1109\/ICRA.2011.5980160"},{"key":"S1471068413000525_ref19","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-8640.2008.00325.x"},{"key":"S1471068413000525_ref29","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00186-8"},{"key":"S1471068413000525_ref43","unstructured":"van der Krogt R. , Roos N. , de Weerdt M. and Witteveen C. 2005. Multiagent planning through plan repair. In Proc. of AAMAS, 1337\u20131338."},{"key":"S1471068413000525_ref41","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1142\/S0218488501001277","article-title":"From planning to searching for the shortest plan: An optimal transition","volume":"9","author":"Trejo","year":"2001","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"S1471068413000525_ref25","unstructured":"Hamadi Y. , Jabbour S. and Sais L. 2009. Control-based clause sharing in parallel sat solving. In Proc. of IJCAI, 499\u2013504."},{"key":"S1471068413000525_ref22","first-page":"193","article-title":"Action languages.","volume":"2","author":"Gelfond","year":"1998","journal-title":"Electronic Transactions on Artificial Intelligence"},{"key":"S1471068413000525_ref21","unstructured":"Gebser M. , Kaufmann B. , Neumann A. and Schaub T. 2007. clasp: A conflict-driven answer set solver. In Proc. of LPNMR, 260\u2013265."},{"key":"S1471068413000525_ref39","doi-asserted-by":"publisher","DOI":"10.1109\/64.73815"},{"key":"S1471068413000525_ref20","unstructured":"Gebser M. , Kaminski R. , K\u00f6nig A. and Schaub T. 2011. Advances in gringo series 3. In Proc. of LPNMR, 345\u2013351."},{"key":"S1471068413000525_ref12","unstructured":"Ephrati E. and Rosenschein J. S. 1993. Multi-agent planning as the process of merging distributed sub-plans. In Proc. of DAI, 115\u2013129."},{"key":"S1471068413000525_ref45","unstructured":"Zaeh M. , Beetz M. , Shea K. , Reinhart G. , Bender K. , Lau C. , Ostgathe M. , Vogl W. , Wiesbeck M. , Engelhard M. , Ertelt C. , Rhr T. , Friedrich M. and Herle S. 2009. The cognitive factory. In Changeable and Reconfigurable Manufacturing Systems, 355\u2013371."},{"key":"S1471068413000525_ref3","unstructured":"Beetz M. , Buss M. and Wollherr D. 2007. CTS - What is the role of artificial intelligence? In Proc. of KI, 19\u201342."},{"key":"S1471068413000525_ref26","doi-asserted-by":"crossref","unstructured":"Havur G. , Haspalamutgil K. , Palaz C. , Erdem E. and Patoglu V. 2013. A case study on the tower of hanoi challenge: Representation, reasoning and execution. In Proc. of ICRA.","DOI":"10.1109\/ICRA.2013.6631224"},{"key":"S1471068413000525_ref15","doi-asserted-by":"crossref","unstructured":"Erdem E. , Haspalamutgil K. , Patoglu V. and Uras T. 2012. Causality-based planning and diagnostic reasoning for cognitive factories. In Proc. of IEEE International Conference on Emerging Technologies and Factory Automation (ETFA).","DOI":"10.1109\/ETFA.2012.6489636"},{"key":"S1471068413000525_ref40","unstructured":"ter Mors A. , Valk J. and Witteveen C. 2004. Coordinating autonomous planners. In Proc. of IC-AI, 795\u2013801."},{"key":"S1471068413000525_ref10","unstructured":"Durfee E. H. and Lesser V. R. 1987. Planning coordinated actions in dynamic domains. In Proc. of the DARPA Knowledge-Based Planning Workshop, 18.1\u201318.10."},{"key":"S1471068413000525_ref18","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(92)90016-Q"}],"container-title":["Theory and Practice of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S1471068413000525","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T09:28:56Z","timestamp":1715592536000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S1471068413000525\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":46,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["S1471068413000525"],"URL":"https:\/\/doi.org\/10.1017\/s1471068413000525","relation":{},"ISSN":["1471-0684","1475-3081"],"issn-type":[{"value":"1471-0684","type":"print"},{"value":"1475-3081","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7]]}}}