[工程科技]Preference-based constrained optimization with CP-nets.pdfVIP

Preference-based Constrained Optimization with CP-nets Craig Boutilier Department of Computer Science University of Toronto Toronto, ON, M5S 3H8, Canada cebly@cs.toronto.edu Ronen I. Brafman Department of Computer Science Ben-Gurion University Beer Sheva, Israel 84105 brafman@cs.bgu.ac.il Carmel Domshlak Department of Computer Science Cornell University Ithaca, NY 14853 dcarmel@cs.cornell.edu Holger H. Hoos Department of Computer Science University of British Columbia Vancouver, BC, V6T 1Z4, Canada hoos@cs.ubc.ca David Poole Department of Computer Science University of British Columbia Vancouver, BC, V6T 1Z4, Canada poole@cs.ubc.ca December 18, 2003 Abstract Many AI tasks, such as product configuration, decision support, and the construction of autonomous agents, involve a process of con- 1 strained optimization, that is, optimization of behavior or choices sub- ject to given constraints. In this paper we present an approach for constrained optimization based on a set of hard constraints and a pref- erence ordering represented using a CP-network—a graphical model for representing qualitative preference information. This approach of- fers both pragmatic and computati