Hostname: page-component-89b8bd64d-5bvrz Total loading time: 0 Render date: 2026-05-08T07:00:32.243Z Has data issue: false hasContentIssue false
  • English
  • Français

Solving distributed constraint optimization problems using logic programming* †

Published online by Cambridge University Press:  27 June 2017

TIEP LE ,
TRAN CAO SON ,
ENRICO PONTELLI  and
WILLIAM YEOH
TIEP LE
Affiliation:
Computer Science Department, New Mexico State University, Las Cruces, NM 88001, USA (e-mails: tile@cs.nmsu.edu, tson@cs.nmsu.edu, epontell@cs.nmsu.edu, wyeoh@cs.nmsu.edu)
TRAN CAO SON
Affiliation:
Computer Science Department, New Mexico State University, Las Cruces, NM 88001, USA (e-mails: tile@cs.nmsu.edu, tson@cs.nmsu.edu, epontell@cs.nmsu.edu, wyeoh@cs.nmsu.edu)
ENRICO PONTELLI
Affiliation:
Computer Science Department, New Mexico State University, Las Cruces, NM 88001, USA (e-mails: tile@cs.nmsu.edu, tson@cs.nmsu.edu, epontell@cs.nmsu.edu, wyeoh@cs.nmsu.edu)
WILLIAM YEOH
Affiliation:
Computer Science Department, New Mexico State University, Las Cruces, NM 88001, USA (e-mails: tile@cs.nmsu.edu, tson@cs.nmsu.edu, epontell@cs.nmsu.edu, wyeoh@cs.nmsu.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

This paper explores the use of Answer Set Programming (ASP) in solving Distributed Constraint Optimization Problems (DCOPs). The paper provides the following novel contributions: (1) it shows how one can formulate DCOPs as logic programs; (2) it introduces ASP-DPOP, the first DCOP algorithm that is based on logic programming; (3) it experimentally shows that ASP-DPOP can be up to two orders of magnitude faster than DPOP (its imperative programming counterpart) as well as solve some problems that DPOP fails to solve, due to memory limitations; and (4) it demonstrates the applicability of ASP in a wide array of multi-agent problems currently modeled as DCOPs.

Keywords

DCOPDPOPlogic programmingASP

Information

Type
Regular Papers
Information
Theory and Practice of Logic Programming , Volume 17 , Issue 4 , July 2017 , pp. 634 - 683
Copyright
Copyright © Cambridge University Press 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

*

This article extends our previous conference paper (Le et al. 2015) in the following manner: (1) it provides a more thorough description of the ASP-DPOP algorithm; (2) it elaborates on the algorithm's theoretical properties with complete proofs; and (3) it includes additional experimental results.

†

This research is partially supported by NSF grants HRD-1345232 and DGE-0947465.

References

Baral, C. 2003. Knowledge Representation, Reasoning, and Declarative Problem Solving with Answer Sets. Cambridge University Press, Cambridge, MA.CrossRefGoogle Scholar
Baral, C., Gelfond, G., Pontelli, E. and Son, T. C. 2010. Modeling multi-agent scenarios involving agents knowledge about other's knowledge using ASP. In Proc. of AAMAS, 259–266.Google Scholar
Bessiere, C., Gutierrez, P. and Meseguer, P. 2012. Including soft global constraints in DCOPs. In Proc. of CP, 175–190.Google Scholar
Carlsson, M. et al. 2015. SICStus Prolog User's Manual. Swedish Institute of Computer Science.Google Scholar
Citrigno, S., Eiter, T., Faber, W., Gottlob, G., Koch, C., Leone, N., Mateis, C., Pfeifer, G. and Scarcello, F. 1997. The dlv system: Model generator and application frontends. In Proc. of Workshop on Logic Programming, 128–137.Google Scholar
De Vos, M., Crick, T., Padget, J. A., Brain, M., Cliffe, O. and Needham, J. 2005. LAIMA: A multi-agent platform using ordered choice logic programming. In Proc. of DALT.CrossRefGoogle Scholar
Dechter, R. 2003. Constraint Processing. Elsevier/Morgan Kaufmann.Google Scholar
Dovier, A., Formisano, A. and Pontelli, E. 2010a. An investigation of multi-agent planning in CLP. Fundamentae Informatica 105, 1–2, 79–103.Google Scholar
Dovier, A., Formisano, A. and Pontelli, E. 2010b. Multivalued action languages with constraints in CLP(FD). Theory and Practice of Logic Programming 10, 2, 167–235.Google Scholar
Dovier, A., Formisano, A. and Pontelli, E. 2013. Autonomous agents coordination: Action languages meet CLP() and Linda. Theory and Practice of Logic Programming 13, 2, 149–173.Google Scholar
Erdös, P. and Rényi, A. 1959. On random graphs I. Publicationes Mathematicae Debrecen 6, 290.CrossRefGoogle Scholar
Farinelli, A., Rogers, A., Petcu, A. and Jennings, N. 2008. Decentralised coordination of low-power embedded devices using the Max-Sum algorithm. In Proc. of AAMAS, 639–646.Google Scholar
Fioretto, F., Campeotto, F., Da Rin Fioretto, L., Yeoh, W. and Pontelli, E. 2014. GD-Gibbs: A GPU-based sampling algorithm for solving distributed constraint optimization problems (Extended Abstract). In Proc. of AAMAS.Google Scholar
Fioretto, F., Le, T., Yeoh, W., Pontelli, E. and Son, T. C. 2014. Improving DPOP with branch consistency for solving distributed constraint optimization problems. In Proc. of CP.CrossRefGoogle Scholar
Fioretto, F., Yeoh, W. and Pontelli, E. 2016. Multi-variable agents decomposition for dcops. In Proc. of 30th AAAI Conference on Artificial Intelligence, Phoenix, Arizona, USA, February 12–17, 2016, 2480–2486.Google Scholar
Gebser, M., Kaminski, R., Kaufmann, B. and Schaub, T. 2012. Answer Set Solving in Practice. Morgan and Claypool Publishers.Google Scholar
Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T. and Schneider, M. 2011. Potassco: The potsdam answer set solving collection. AI Communications 24, 2 (Apr.), 107–124.Google Scholar
Gebser, M., Kaufmann, B., Neumann, A. and Schaub, T. 2007. Clasp: A conflict-driven answer set solver. In Proc. of LPNMR, 260–265.Google Scholar
Gelfond, G. and Watson, R. 2007. Modeling cooperative multi-agent systems. In Proc. of ASP Workshop.Google Scholar
Gelfond, M. and Kahl, Y. 2014. Knowledge Representation, Reasoning, and the Design of Intelligent Agents. Cambridge University Press.Google Scholar
Gelfond, M. and Lifschitz, V. 1990. Logic programs with classical negation. In Proc. of ICLP, 579–597.Google Scholar
Gershman, A., Meisels, A. and Zivan, R. 2009. Asynchronous forward-bounding for distributed COPs. Journal of Artificial Intelligence Research 34, 61–88.Google Scholar
Greenstadt, R., Pearce, J. P. and Tambe, M. 2006. Analysis of privacy loss in distributed constraint optimization. In Proc. of 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference. July 16–20, 2006, Boston, MA, USA, 647–653.Google Scholar
Gupta, S., Jain, P., Yeoh, W., Ranade, S. and Pontelli, E. 2013. Solving customer-driven microgrid optimization problems as DCOPs. In Proc. of Distributed Constraint Reasoning Workshop, 45–59.Google Scholar
Gutierrez, P., Lee, J., Lei, K. M., Mak, T. and Meseguer, P. 2013. Maintaining soft arc consistencies in BnB-ADOPT+ during search. In Proc. of CP, 365–380.Google Scholar
Gutierrez, P. and Meseguer, P. 2012a. Improving BnB-ADOPT+-AC. In Proc. of AAMAS, 273–280.Google Scholar
Gutierrez, P. and Meseguer, P. 2012b. Removing redundant messages in n-ary BnB-ADOPT. Journal of Artificial Intelligence Research 45, 287–304.Google Scholar
Gutierrez, P., Meseguer, P. and Yeoh, W. 2011. Generalizing ADOPT and BnB-ADOPT. In Proc. of IJCAI, 554–559.Google Scholar
Hamadi, Y., Bessière, C. and Quinqueton, J. 1998. Distributed intelligent backtracking. In Proc. of ECAI, 219–223.Google Scholar
IEEE Distribution Test Feeders. 2014. URL: http://ewh.ieee.org/soc/pes/dsacom/testfeeders/ [Accessed on: 29/07/2014].Google Scholar
Jaffar, J. and Maher, M. J. 1994. Special issue: Ten years of logic programming constraint logic programming: A survey. The Journal of Logic Programming 19, 503–581.CrossRefGoogle Scholar
Jain, P., Gupta, S., Ranade, S. and Pontelli, E. 2012. Optimum operation of a customer-driven microgrid: A comprehensive approach. In Proc. of PEDES.Google Scholar
Kakas, A., Torroni, P. and Demetriou, N. 2004. Agent Planning, negotiation and control of operation. In Proc. of ECAI.Google Scholar
Kaufmann, B., Leone, N., Perri, S. and Schaub, T. 2016. Grounding and solving in answer set programming. AI Magazine 37, 3, 25–32.Google Scholar
Kowalski, R. and Sadri, F. 1999. Logic programming towards multi-agent systems. Annals of Mathematics and Artificial Intelligence 25, 3–4, 391–419.Google Scholar
Kumar, A., Faltings, B. and Petcu, A. 2009. Distributed constraint optimization with structured resource constraints. In Proc. of AAMAS, 923–930.Google Scholar
Kumar, A., Petcu, A. and Faltings, B. 2008. H-DPOP: Using hard constraints for search space pruning in DCOP. In Proc. of AAAI, 325–330.Google Scholar
Lass, R., Kopena, J., Sultanik, E., Nguyen, D., Dugan, C., Modi, P. and Regli, W. 2008. Coordination of first responders under communication and resource constraints (Short Paper). In Proc. of AAMAS, 1409–1413.Google Scholar
Le, T., Pontelli, E., Son, T. C. and Yeoh, W. 2014. Logic and constraint logic programming for distributed constraint optimization. Technical Communications of the Thirtieth International Conference on Logic Programming (ICLP' 14). Theory and Practice of Logic Programming, Online Supplement.Google Scholar
Le, T., Son, T. C., Pontelli, E. and Yeoh, W. 2015. Solving distributed constraint optimization problems with logic programming. In Proc. of AAAI.CrossRefGoogle Scholar
Léauté, T. and Faltings, B. 2011. Coordinating logistics operations with privacy guarantees. In Proc. of IJCAI, 2482–2487.Google Scholar
Léauté, T., Ottens, B. and Szymanek, R. 2009. FRODO 2.0: An open-source framework for distributed constraint optimization. In Proc. of Distributed Constraint Reasoning Workshop, 160–164.Google Scholar
Liu, C., Ren, L., Loo, B. T., Mao, Y. and Basu, P. 2012. Cologne: A declarative distributed constraint optimization platform. Proc. of VLDB Endowment 5, 8, 752–763.CrossRefGoogle Scholar
Maheswaran, R., Pearce, J. and Tambe, M. 2004. Distributed algorithms for DCOP: A graphical game-based approach. In Proc. of PDCS, 432–439.Google Scholar
Maheswaran, R., Tambe, M., Bowring, E., Pearce, J. and Varakantham, P. 2004. Taking DCOP to the real world: Efficient complete solutions for distributed event scheduling. In Proc. of AAMAS, 310–317.Google Scholar
Mailler, R. and Lesser, V. 2004. Solving distributed constraint optimization problems using cooperative mediation. In Proc. of AAMAS, 438–445.Google Scholar
Marek, V. and Truszczyński, M. 1999. Stable models and an alternative logic programming paradigm. In The Logic Programming Paradigm: A 25-year Perspective, Apt, K., Marek, V.W., Truszczynski, M., Warren, D.S., Eds. Springer, Berlin, 375–398.Google Scholar
Modi, P., Shen, W.-M., Tambe, M. and Yokoo, M. 2005. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. Artificial Intelligence 161, 1–2, 149–180.CrossRefGoogle Scholar
Nguyen, D. T., Yeoh, W. and Lau, H. C. 2013. Distributed Gibbs: A memory-bounded sampling-based DCOP algorithm. In Proc. of AAMAS, 167–174.Google Scholar
Niemelä, I. 1999. Logic programming with stable model semantics as a constraint programming paradigm. Annals of Mathematics and Artificial Intelligence 25, 3–4, 241–273.CrossRefGoogle Scholar
Ottens, B., Dimitrakakis, C. and Faltings, B. 2012. DUCT: An upper confidence bound approach to distributed constraint optimization problems. In Proc. of AAAI, 528–534.Google Scholar
Petcu, A. 2009. A Class of Algorithms for Distributed Constraint Optimization. Frontiers in Artificial Intelligence and Applications, vol. 194. IOS Press.Google Scholar
Petcu, A. and Faltings, B. 2005a. A scalable method for multiagent constraint optimization. In Proc. of IJCAI, 1413–1420.Google Scholar
Petcu, A. and Faltings, B. 2005b. Superstabilizing, fault-containing multiagent combinatorial optimization. In Proc. of AAAI, 449–454.Google Scholar
Petcu, A. and Faltings, B. 2006. ODPOP: An algorithm for open/distributed constraint optimization. In Proc. of 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference. July 16–20, 2006, Boston, Massachusetts, USA, 703–708.Google Scholar
Petcu, A. and Faltings, B. 2007. MB-DPOP: A new memory-bounded algorithm for distributed optimization. In Proc. of IJCAI, 1452–1457.Google Scholar
Petcu, A., Faltings, B. and Mailler, R. 2007. PC-DPOP: A new partial centralization algorithm for distributed optimization. In Proc. of IJCAI, 167–172.Google Scholar
Petcu, A., Faltings, B. and Parkes, D. 2008. M-DPOP: Faithful distributed implementation of efficient social choice problems. Journal of Artificial Intelligence Research 32, 705–755.Google Scholar
Pontelli, E., Son, T. C., Baral, C. and Gelfond, G. 2010. Logic programming for finding models in the logics of knowledge and its applications: A case study. Theory and Practice of Logic Programming 10, 4–6, 675–690.Google Scholar
Sadri, F. and Toni, F. 2003. Abductive logic programming for communication and negotiation amongst agents. ALP Newsletter.Google Scholar
Sakama, C., Son, T. C. and Pontelli, E. 2011. A logical formulation for negotiation among dishonest agents. In Proc. of IJCAI, 1069–1074.Google Scholar
Son, T. C., Pontelli, E. and Sakama, C. 2009. Logic programming for multiagent planning with negotiation. In Proc. of ICLP, 99–114.Google Scholar
Sultanik, E., Lass, R. and Regli, W. 2007. DCOPolis: A framework for simulating and deploying distributed constraint reasoning algorithms. In Proc. of Distributed Constraint Reasoning Workshop.Google Scholar
Ueda, S., Iwasaki, A. and Yokoo, M. 2010. Coalition structure generation based on distributed constraint optimization. In Proc. of AAAI, 197–203.Google Scholar
Vinyals, M., Rodríguez-Aguilar, J. and Cerquides, J. 2011. Constructing a unifying theory of dynamic programming DCOP algorithms via the generalized distributive law. Autonomous Agents and Multi-Agent Systems 22, 3, 439–464.Google Scholar
Vlahavas, I. 2002. MACLP: Multi agent constraint logic programming. Information Sciences 144, 1-4, 127–142.Google Scholar
Yeoh, W., Felner, A. and Koenig, S. 2010. BnB-ADOPT: An asynchronous branch-and-bound DCOP algorithm. Journal of Artificial Intelligence Research 38, 85–133.Google Scholar
Yeoh, W., Varakantham, P. and Koenig, S. 2009. Caching schemes for DCOP search algorithms. In Proc. of AAMAS, 609–616.Google Scholar
Yeoh, W. and Yokoo, M. 2012. Distributed problem solving. AI Magazine 33, 3, 53–65.CrossRefGoogle Scholar
Zivan, R., Okamoto, S. and Peled, H. 2014. Explorative anytime local search for distributed constraint optimization. Artificial Intelligence 212, 1–26.CrossRefGoogle Scholar