Parameterized Heuristics for Incomplete Weighted CSPs with Elicitation Costs
Pages 476 - 484
Abstract
Weighted Constraint Satisfaction Problems (WCSPs) are an elegant paradigm for modeling combinatorial optimization problems. A key assumption in this model is that all constraints are specified or known a priori, which does not hold in some applications where constraints may encode preferences of human users. Incomplete WCSPs (IWCSPs) extend WCSPs by allowing some constraints to be partially specified, and they can be elicited from human users during the execution of IWCSP algorithms. Unfortunately, existing approaches assume that the elicitation of preferences does not incur any additional cost. This assumption is unrealistic as human users are likely bothered by repeated elicitations and will refuse to provide an unbounded number of preferences. Therefore, we propose the IWCSP with Elicitation Cost (IWCSP+EC) model, which extends IWCSPs to include elicitation costs, as well as three parameterized heuristics that allow users to trade off solution quality for fewer elicited preferences and faster computation times. They provide theoretical quality guarantees for problems where elicitations are free. Our model and heuristics thus extend the state of the art in constraint reasoning to better model and solve agent-based applications with user preferences.
References
[1]
Slim Abdennadher and Hans Schlenker. 1999. Nurse Scheduling using Constraint Logic Programming. In Proceedings of IAAI . 838--843.
[2]
David Allouche, Isabelle André, Sophie Barbe, Jessica Davies, Simon de Givry, George Katsirelos, Barry O'Sullivan, Steven David Prestwich, Thomas Schiex, and Seydou Traoré. 2014. Computational protein design as an optimization problem. Artificial Intelligence, Vol. 212 (2014), 59--79.
[3]
Krzysztof Apt. 2003. Principles of Constraint Programming .Cambridge University Press.
[4]
Fahiem Bacchus and Adam J. Grove. 1996. Utility Independence in a Qualitative Decision Theory. In Proceedings of KR . 542--552.
[5]
Stefano Bistarelli, Ugo Montanari, and Francesca Rossi. 1997. Semiring-based constraint satisfaction and optimization. Journal of the ACM, Vol. 44, 2 (1997), 201--236.
[6]
Craig Boutilier, Ronen I. Brafman, Carmel Domshlak, Holger H. Hoos, and David Poole. 2004. CP-nets: A Tool for Representing and Reasoning with Conditional Ceteris Paribus Preference Statements. Journal of Artificial Intelligence Research, Vol. 21 (2004), 135--191.
[7]
Craig Boutilier, Relu Patrascu, Pascal Poupart, and Dale Schuurmans. 2006. Constraint-based optimization and utility elicitation using the minimax decision criterion. Artificial Intelligence, Vol. 170, 8--9 (2006), 686--713.
[8]
Edmund K Burke, Patrick De Causmaecker, Greet Vanden Berghe, and Hendrik Van Landeghem. 2004. The state of the art of nurse rostering. Journal of Scheduling, Vol. 7, 6 (2004), 441--499.
[9]
Federico Campeotto, Alessandro Dal Palù, Agostino Dovier, Ferdinando Fioretto, and Enrico Pontelli. 2013. A Constraint Solver for Flexible Protein Model. Journal of Artificial Intelligence Research, Vol. 48 (2013), 953--1000.
[10]
Urszula Chajewska, Daphne Koller, and Ronald Parr. 2000. Making Rational Decisions Using Adaptive Utility Elicitation. In Proceedings of AAAI . 363--369.
[11]
Enrico Costanza, Joel E. Fischer, James A. Colley, Tom Rodden, Sarvapali D. Ramchurn, and Nicholas R. Jennings. 2014. Doing the laundry with agents: a field trial of a future smart energy system in the home. In Proceedings of CHI. 813--822.
[12]
Rina Dechter and Avi Dechter. 1988. Belief Maintenance in Dynamic Constraint Networks. Proceedings of AAAI. 37--42.
[13]
Paul Erdös and Alfréd Rényi. 1959. On random graphs, I. Publicationes Mathematicae (Debrecen), Vol. 6 (1959), 290--297.
[14]
Boi Faltings and Santiago Macho-Gonzalez. 2005. Open constraint programming. Artificial Intelligence, Vol. 161, 1--2 (2005), 181--208.
[15]
Ferdinando Fioretto, Agostino Dovier, and Enrico Pontelli. 2015. Constrained Community-Based Gene Regulatory Network Inference. ACM Transactions on Modeling and Computer Simulation, Vol. 25, 2 (2015), 11:1--11:26.
[16]
Ferdinando Fioretto, Enrico Pontelli, and William Yeoh. 2018. Distributed Constraint Optimization Problems and Applications: A Survey. Journal of Artificial Intelligence Research, Vol. 61 (2018), 623--698.
[17]
Ferdinando Fioretto, William Yeoh, and Enrico Pontelli. 2017. A Multiagent System Approach to Scheduling Devices in Smart Homes. In Proceedings of AAMAS . 981--989.
[18]
Natalia Flerova, Radu Marinescu, and Rina Dechter. 2017. Weighted heuristic anytime search: new schemes for optimization over graphical models. Annals of Mathematics and Artificial Intelligence, Vol. 79, 1--3 (2017), 77--128.
[19]
Jonathan Gaudreault, Jean-Marc Frayret, and Gilles Pesant. 2009. Distributed search for supply chain coordination. Computers in Industry, Vol. 60, 6 (2009), 441--451.
[20]
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, K Brent Venable, and Toby Walsh. 2010. Elicitation strategies for soft constraint problems with missing preferences: Properties, algorithms and experimental studies. Artificial Intelligence, Vol. 174, 3--4 (2010), 270--294.
[21]
Judy Goldsmith and Ulrich Junker. 2008. Preference Handling for Artificial Intelligence. AI Magazine, Vol. 29, 4 (2008), 9--12.
[22]
Eric Hansen and Rong Zhou. 2007. Anytime Heuristic Search. Journal of Artificial Intelligence Research, Vol. 28.
[23]
Paul Hart, Nils Nilsson, and Bertram Raphael. 1968. A Formal Basis for the Heuristic Determination of Minimum Cost Paths. IEEE Transactions on Systems Science and Cybernetics, Vol. 4, 2 (1968), 100--107.
[24]
Khoi D. Hoang, Ferdinando Fioretto, Ping Hou, Makoto Yokoo, William Yeoh, and Roie Zivan. 2016. Proactive Dynamic Distributed Constraint Optimization. In Proceedings of AAMAS . 597--605.
[25]
Khoi D. Hoang, Ping Hou, Ferdinando Fioretto, William Yeoh, Roie Zivan, and Makoto Yokoo. 2017. infinite-Horizon Proactive Dynamic DCOPs. In Proceedings of AAMAS. 212--220.
[26]
Richard E Korf. 1993. Linear-space best-first search. Artificial Intelligence, Vol. 62, 1 (1993), 41--78.
[27]
Javier Larrosa. 2002. Node and arc consistency in weighted CSP. In Proceedings of AAAI/IAAI. 48--53.
[28]
Tiep Le, Atena M. Tabakhi, Long Tran-Thanh, William Yeoh, and Tran Cao Son. 2018. Preference Elicitation with Interdependency and User Bother Cost. In Proceedings of AAMAS . 1459--1467.
[29]
Thomas Léauté and Boi Faltings. 2011. Distributed Constraint Optimization under Stochastic Uncertainty. In Proceedings of AAAI . 68--73.
[30]
Maxim Likhachev, Geoffrey Gordon, and Sebastian Thrun. 2003. ARA*: Anytime A* with Provable Bounds on Sub-Optimality. In Proceedings of NIPS .
[31]
Rajiv Maheswaran, Milind Tambe, Emma Bowring, Jonathan Pearce, and Pradeep Varakantham. 2004. Taking DCOP to the Real World: Efficient Complete Solutions for Distributed Event Scheduling. In Proceedings of AAMAS. 310--317.
[32]
Radu Marinescu and Rina Dechter. 2005. AND/OR branch-and-bound for graphical models. In Proceedings of IJCAI. 224--229.
[33]
Radu Marinescu and Rina Dechter. 2009. AND/OR branch-and-bound search for combinatorial optimization in graphical models. Artificial Intelligence, Vol. 173, 16--17 (2009), 1457--1491.
[34]
Pragnesh Modi, Wei-Min Shen, Milind Tambe, and Makoto Yokoo. 2005. ADOPT: Asynchronous Distributed Constraint Optimization with Quality Guarantees. Artificial Intelligence, Vol. 161, 1--2 (2005), 149--180.
[35]
Duc Thien Nguyen, William Yeoh, and Hoong Chuin Lau. 2012. Stochastic Dominance in Stochastic DCOPs for Risk-Sensitive Applications. In Proceedings of AAMAS. 257--264.
[36]
Adrian Petcu and Boi Faltings. 2005 a. A Scalable Method for Multiagent Constraint Optimization. In Proceedings of IJCAI . 1413--1420.
[37]
Adrian Petcu and Boi Faltings. 2005 b. Superstabilizing, Fault-Containing Multiagent Combinatorial Optimization. In Proceedings of AAAI. 449--454.
[38]
Adrian Petcu and Boi Faltings. 2006. ODPOP: An Algorithm for Open/Distributed Constraint Optimization. In Proceedings of AAAI . 703--708.
[39]
Ira Pohl. 1970. Heuristic search viewed as path finding in a graph. Artificial Intelligence, Vol. 1, 3 (1970), 193--204.
[40]
Ira Pohl. 1973. The Avoidance of (Relative) Catastrophe, Heuristic Competence, Genuine Dynamic Weighting and Computational Issues in Heuristic Problem Solving. In Proceedings of IJCAI . 12--17.
[41]
L.C.A. Rodrigues and L. Magatao. 2007. Enhancing Supply Chain Decisions Using Constraint Programming: A Case Study. In Proceedings of MICAI. 1110--1121.
[42]
F. Rossi, P. van Beek, and T. Walsh (Eds.). 2006. Handbook of Constraint Programming. Elsevier.
[43]
Francesca Rossi, Kristen Brent Venable, and Toby Walsh. 2008. Preferences in Constraint Satisfaction and Optimization. AI Magazine, Vol. 29, 4 (2008), 58--68.
[44]
Pierre Rust, Gauthier Picard, and Fano Ramparany. 2016. Using Message-Passing DCOP Algorithms to Solve Energy-Efficient Smart Environment Configuration Problems. In Proceedings of IJCAI. 468--474.
[45]
Tuomas Sandholm. 2002. Algorithm for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence, Vol. 135, 1--2 (2002), 1--54.
[46]
Thomas Schiex, Hélène Fargier, and Gérard Verfaillie. 1995. Valued Constraint Satisfaction Problems: Hard and Easy Problems. In Proceedings of IJCAI . 631--637.
[47]
Linda G Shapiro and Robert M Haralick. 1981. Structural descriptions and inexact matching. IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 3, 5 (1981), 504--519.
[48]
Xiaoxun Sun, Marek Druzdzel, and Changhe Yuan. 2007. Dynamic Weighting A* Search-based MAP Algorithm for Bayesian Networks. In Proceedings of IJCAI . 2385--2390.
[49]
Atena M. Tabakhi, Tiep Le, Ferdinando Fioretto, and William Yeoh. 2017. Preference Elicitation for DCOPs. In Proceedings of CP. 278--296.
[50]
Stefano Teso, Paolo Dragone, and Andrea Passerini. 2017. Coactive Critiquing: Elicitation of Preferences and Features. In Proceedings of AAAI . 2639--2645.
[51]
Walid Trabelsi, Kenneth N. Brown, and Barry O'Sullivan. 2015. Preference Elicitation and Reasoning While Smart Shifting of Home Appliances. Energy Procedia, Vol. 83 (2015), 389--398.
[52]
Ngoc Cuong Truong, Tim Baarslag, Sarvapali D. Ramchurn, and Long Tran-Thanh. 2016. Interactive Scheduling of Appliance Usage in the Home. In Proceedings of IJCAI . 869--877.
[53]
Paolo Viappiani and Craig Boutilier. 2010. Optimal Bayesian Recommendation Sets and Myopically Optimal Choice Query Sets. In Proceedings of NIPS. 2352--2360.
[54]
Richard Wallace and Eugene Freuder. 1998. Stable Solutions for Dynamic Constraint Satisfaction Problems. In Proceedings of CP . 447--461.
[55]
William Yeoh, Ariel Felner, and Sven Koenig. 2010. BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm. Journal of Artificial Intelligence Research, Vol. 38 (2010), 85--133.
[56]
William Yeoh, Xiaoxun Sun, and Sven Koenig. 2009. Trading Off Solution Quality for Faster Computation in DCOP Search Algorithms. In Proceedings of IJCAI. 354--360.
[57]
William Yeoh, Pradeep Varakantham, Xiaoxun Sun, and Sven Koenig. 2015. Incremental DCOP Search Algorithms for Solving Dynamic DCOPs. In Proceedings of IAT . 257--264.
[58]
William Yeoh and Makoto Yokoo. 2012. Distributed Problem Solving. AI Magazine, Vol. 33, 3 (2012), 53--65.
[59]
Neil Yorke-Smith and Carmen Gervet. 2003. Certainty Closure: A Framework for Reliable Constraint Reasoning with Uncertainty. In Proceedings of CP. 769--783.
Index Terms
- Parameterized Heuristics for Incomplete Weighted CSPs with Elicitation Costs
Recommendations
Parameterized heuristics for incomplete weighted CSPs
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial IntelligenceThe key assumption in Weighted Constraint Satisfaction Problems (WCSPs) is that all constraints are specified a priori. This assumption does not hold in some applications that involve users preferences. Incomplete WCSPs (IWCSPs) extend WCSPs by allowing ...
Parameterized heuristics for incomplete weighted CSPs
AAAI'19/IAAI'19/EAAI'19: Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence and Thirty-First Innovative Applications of Artificial Intelligence Conference and Ninth AAAI Symposium on Educational Advances in Artificial IntelligenceThe key assumption in Weighted Constraint Satisfaction Problems (WCSPs) is that all constraints are specified a priori. This assumption does not hold in some applications that involve users preferences. Incomplete WCSPs (IWCSPs) extend WCSPs by allowing ...
Incomplete Distributed Constraint Optimization Problems: Model, Algorithms, and Heuristics
Distributed Artificial IntelligenceAbstractThe Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model cooperative multi-agent problems, especially when they are sparsely constrained with one another. A key assumption in this model is that all constraints ...
Comments
Information & Contributors
Information
Published In
May 2019
2518 pages
ISBN:9781450363099
- General Chairs:
- Edith Elkind,
- Manuela Veloso,
- Program Chairs:
- Noa Agmon,
- Matthew E. Taylor
Sponsors
Publisher
International Foundation for Autonomous Agents and Multiagent Systems
Richland, SC
Publication History
Published: 08 May 2019
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
AAMAS '19
Sponsor:
AAMAS '19: International Conference on Autonomous Agents and Multiagent Systems
May 13 - 17, 2019
Montreal QC, Canada
Acceptance Rates
AAMAS '19 Paper Acceptance Rate 193 of 793 submissions, 24%;
Overall Acceptance Rate 1,155 of 5,036 submissions, 23%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 56Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in