12/7/2006. Outline. Generalized Conflict Learning for Hybrid Discrete/Linear Optimization. Forward Conflict-Directed Search
|
|
- Donna Rich
- 5 years ago
- Views:
Transcription
1 2/7/26 Massachusetts Institute of Technology Generalized Conflict Learning for Hybrid Discrete/Linear Optimization Hui Li and Brian Williams Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Oct. 5 th, 25 Forward Conflict-Directed Search Backward conflict-directed search uses conflicts to select backtrack points and as a cache used to prune nodes. dependency-directed backtracking [Stallman-Sussman-77] conflict-directed backjumping [Prosser-93] dynamic backtracking [Ginsberg-93] LPSAT [Wolfman-Weld-99]. Forward conflict-directed search guides the forward step of search away from regions of the state space that are ruled out by known conflicts Conflict-directed A* [Williams-Nayak-AAAI96, Williams-Ragno-JDAM]. Assumption-based DDBT [dekleer-williams AAAI86, IJCAI89], Factor Out Failure[Freuder-IJCAI-95 Candidate Generation [dekleer-williams-aij87, Reiter-AIJ87] Introduce Generalized Forward Conflict-directed Search on Hybrid Discrete/Linear Optimization Experiments on cooperative vehicle plan execution problems demonstrates that the approach significantly outperforms branch and bound using conflicts on backtracking. 2 9 s Self-Repairing Explorers Solve COPs Using Forward, Conflict-directed Best First Search 3 Deep Space Remote Agent Experiment (May, 999) Livingstone Model-based Execution System [Williams & Nayak, AAAI96] State estimates Mode Estimation: Tracks likely States Observations Plant Commands State goals Mode Reconfiguration: Tracks least-cost state goals Optimal Satisfiability Problem OpSat uses conflicts (nogoods) in the forward direction, to substantially improve Best-first Search (CD A*) [Williams-Nayak-AAAI96,Williams-Ragno-JDAM]. Model: HMMs + CSPs 4 Increasing Cost Conflict 3 [ ] x ij = v ij Conflict Infeasible Conflict 2 Feasible s Plan-driven Agile Systems Solve Hybrid Discrete/Linear Optimization Problems via Forward Conflict-directed Search [Leaute & Williams, AAAI5] To put out the Burbank wildfires,... UAV Starts at home; {Gets fuel & water; drops on fire-} [, 5]; {Gets fuel & water; drops on fire-2} [2, 6]; Returns home. Hybrid Discrete/Linear Optimization Problems Disjunctive Linear Programs (DLPs) [Balas-ADM-79] Binary Integer Programming LCNF [Wolfman-IJCAI-99] Mixed Logical Linear Programs (MLLPs) [Hooker-JDAM-99] How do we generalize forward conflict-directed search to HDLOPs? Generalized Conflict-directed Branch and Bound (GCD-BB) s Plan-driven Agile Systems Solve Hybrid Discrete/Linear Optimization Problems via Forward Conflict-directed Search [Hoffman & Williams, ICAPS5] Hybrid Discrete/Linear Gait Poses Optimization Problems Disjunctive Linear Programs (DLPs) l r r2 l l r2 r2 l2 [Balas-ADM-79] Foot placement Binary Integer Programming l l2 Lat LCNF [Wolfman-IJCAI-99] r r2 Fwd Mixed Logical Linear Programs (MLLPs) [Hooker-JDAM-99] How do we generalize forward conflict-directed search to HDLOPs? Generalized Conflict-directed Branch and Bound (GCD-BB)
2 2/7/26 Disjunctive Linear Programs [Balas 79] Generalized Conflict-directed B&B Definition: Example: i j clause Extends traditional Branch & Bound:. Constructs conflicts from search tree nodes found Infeasible or Sub-optimal 2. Uses conflicts to guide forward search away from infeasible and sub-optimal states. 3. Performs induced unit clause relaxation Deduces (some) entailed unit clauses. 7 Demonstrates substantial performance improvement For both Best-first and depth-first Branch & Bound search, In terms of speed and memory usage. Compared with BIPs BFS and B&B without conflicts Backup on conflicts. 8 Optimal Satisfiability Problems 9 Diagnosis A B C D E [ ] x ij = v ij Or X F And Or2 Y And2 G Or3 Z f( x) = fi( xi) i f i Or Or2 Or3 And And2 fi A-G X-Z G U Conflict-directed A* Increasing Cost Select optimal state outside conflicts at each step. Conflict Infeasible Conflict 2 Conflict-directed A* Select optimal state outside conflicts at each step. Feasible subregions described by kernel assignments. Use conflicts to search for kernel assignment Increasing Cost containing the best cost candidate. Conflict Infeasible Conflict 2 Conflict 3 Feasible [Williams-Nayak-AAAI96, Williams-Ragno-JDAM?, dekleer-williams-ijca89] Conflict 3 Kernel 3 Kernel 2 Feasible Kernel 2
3 2/7/26 Generating candidate after two iterations Diagnosis A Or X B And F C Or2 Y D And2 G E Or3 Z Conflicts: {O=G, O2=G, A=G} is inconsistent {O=G, A=G A2=G} is inconsistent Constituent Kernels: {O=U, O2=U, A=U} at least one holds (Resolve one conflict - All states outside conflict) {O=U, A=U A2=U} at least one holds 3 The kernel assignments are the minimal coverings of the constituent kernels. [dekleer-williams-aij87, Reiter-AIJ87] The best kernel is found through A* search of the covering tree. [Williams-Nayak-AAAI96, Williams-Ragno-JDAM] (Kernels resolve ALL conflicts - ALL states outside ALL conflicts) st iteration {A=U} {M=U} {M2=U} 3rd iteration {A=U, M=U, M2=U} 2nd iteration A2=U Constituent Kernels M3=U {A=U, A2=U, M=U, M3=U} {A=U} {M=U} {M=U, A2=U} {M2=U, M3=U}. Branch and Bound for DLPs 2. Induced Unit Clause Relaxation 3. Generalized Conflict Learning 4. Forward Conflict-directed Search 5. Branch and Bound for DLPs. Branch on subproblems. 2. Maintain running best soln in incumbent. Binary variables 3. Bound cost using relaxed problems. Clauses 4. Prune infeasible and suboptimal branches. For DLPs For DLPs For BIPs root minimize -x-3y x y 3 y 3 V x y 2 V x A 2 A x 8 V x 3 V y x y 2 x x y 3 B 2 B x Incumbent x x y 2 y 3-6 x y x 3 x 8an upper bound C 3 x x y 6 C 2 x x x 3 C x x x 8 2. Induced Unit Clause Relaxation BIP relaxation: Binary constraint x {,} Continuous constraint x Problem: adding binary variables and constraints increases the dimensionality of the search problem. Simple DLP relaxation: Remove all non-unit clauses from the DLP Problem: ignoring all non-unit clauses forms a weak relaxation. Induced unit clause relaxation: Strengthen by adding entailed unit clauses Approach: Relax DLP to a propositional theory + apply unit propagation. (alternatively, failed literals) 7 2. Induced Unit Clause Relaxation Example: DP at a sub-problem before relaxation: s.t. x 2 y 2 x y 5 v x x > 8 v x 3 v y s.t. a a b c d e v f v g Relax to propositional clauses Relax nonunit clauses s.t. a b a c d 8 s.t. a b a c d v c e v f v g Reintroduce the linear inequalities Unit propagate Relaxed Problem: s.t. x 2 y 2 x y 5 3
4 2/7/26 3. Generalized Conflict Learning Extracts conflicts whenever branch pruned: Infeasibility conflict 3. Minimal Conflict Extraction Extracted based on duality theory: Sub-optimality conflict Set of constraints that are not satisfiable for any value of x. A minimal infeasibility conflict o Minimal sub-optimality conflicts: The active constraint set at the solution, assuming no degeneracy. The active constraint set is identified by the non-zero terms of the optimal dual vector. [Bertsimas&Tsitsiklis97]. Set of constraints, all of whose feasible states are worse than the incumbent (- > f(x*)). o Minimal infeasibility conflicts: The extreme rays of the cone formed by the modified dual of the original LP [Gleeson&Ryan9]. A minimal sub-optimality conflict Incurs additional LP per conflict Incumbent: x*(2,) Forward Conflict-directed Search minimize -x-3y s.t. (u )x 2 () (a )y 3 V (a 2)x (b )y 2 V (b 2)x (c )x 8 V (c 2)x 3 V (c 3)y x A 2 x x C 3 x x y y For DLPs x 3 B 2 C 2 x x x 3 x 8 root y 2 B Incumbent -6 C x x x 8 y 3 A Conflicts: {x, x 3} {x, x 8} {b 2, c 2} {b 2, c } y 3 y 3 y 3 y 2 y 2 Conflicts { b 2, c 2 } { b 2, c } DLP Candidates Constituent Kernels { { b 2 }, { c 2 } } { { b 2 }, { c } } Kernels { b 2 } { c, c 2 } u a b 2 b V b 2 c V c 2 V c 3 u a b c V c 2 V c 3 unit propagation u a c c 2 b V b 2 c V c 2 V c 3 u a c 3 b V b 2 If infeasible Then prune Else unit clause relax 22 Empirical Evaluation A Mars Plane Scouting Valle Marineris Test problems: Model-based temporal plan execution for cooperative vehicles [Léauté-Williams-AAAI5]. Comparisons: GCD-BB v.s. BIP-BB v.s. algorithmic variants of GCD-BB Measures: Computation time - number of LPs & average LP size Memory use - maximum queue length Model of Vehicle & Terrain encode as disjunctive LP solve up to limited horizon extract control sequence
5 2/7/26 Generalized forward conflict-directed search on DLPs improves runtime over BIP-BB. Conflicts significantly improve best-first search runtime. 9 BIP-BB v.s. GCD-BB 3 Without conflicts v.s. with conflicts BIP-BB Series Series2 DLP+BFS+Infeas Series3 DLP+DFS+Infeas+Sub DLP+BFS+Without Conflicts DLP+BFS+With Conflicts 8/36 7/ / /48 4 8/36 7/ / / Forward conflict-directed search significantly outperforms conflicts used on backtrack. Conflicts significantly improve Best-first search memory use Backtrack with conflicts v.s. Forward conflictdirected search 45 BFS v.s. DFS DLP+BFS+Backtrack DLP+BFS+Forward Search 8/36 7/ / / /36 7/ / /48 4 BFS+Without Conflicts BFS+Infeas DFS+Infeas+Sub Memory performance similar to depth-first-search w conflicts 27 But BFS is not an anytime algorithm. Use Depth-first B&B with conflicts for infeasibility and suboptimality BFS v.s. DFS BFS+Infeas DFS+Infeas DFS+Infeas+Sub DFS+Sub Future Work Study influence of cutting planes, such as Bender s cuts, on performance. Study empirically why sub-optimality conflicts do not speed up search as much as infeasibility conflicts. Apply GCD-BB to non-clausal forms of HLLPs. Generalize to non-linear programs. 8/36 7/ / /484 Runtime performance similar to conflict-directed BFS Significantly better than B&B with infeasible conflicts alone
6 2/7/26 Generalized-Conflict-directed Branch & Bound. Learns conflicts from search tree nodes found Infeasible or Sub-optimal 2. Branches using conflicts to guide forward search away from infeasible and sub-optimal states. 3. Bounds using unit clause relaxation Deduces (some) entailed unit clauses. Demonstrates substantial performance improvement For both Best-first and depth-first Branch & Bound search, In terms of speed and memory usage. Compared with BIPs Traditional BFS and B&B Backup on conflicts. References [Gleeson&Ryan9] J. Gleeson and J. Ryan, Identifying minimally inconsistent subsystems of inequalities, ORSA J. Computing 2, 99. [Bertsimas&Tsitsiklis97] D. Bertsimas and J. Tsitsiklis, Introduction to Linear Optimization. Athena Scientific, 997. [Stallman77] Stallman, R. and Sussman, G.J., Forward Reasoning and Dependency-Directed Backtracking in a System for Computer-Aided Circuit Analysis. J. of Artificial Intelligence [Prosser93] Prosser, P., Hybrid Algorithms for the Constraint Satisfaction Problem. J. of Computational Intelligence, 9(3),993. [Ginsberg93] Ginsberg, M., Dynamic Backtracking. J. of Artificial Intelligence Research,, 993. [Wolfman99] Wolfman, S. and Weld, D., The LPSAT Engine & Its Application to Resource Planning. IJCAI [Williams5] Williams, B. and Ragno, R., Conflict-directed A* and its Role in Model-based Embedded Systems. JDAM, to appear 25. [Katsirelos3] Katsirelos, G. and Bacchus, F., Unrestricted Nogood Recording in CSP Search. CP, 23. [Léauté5] Léauté, T. and Williams, B., Coordinating Agile Systems Through The Model-based Execution of Temporal Plans. AAAI
Solving Hybrid Decision-Control Problems Through Conflict-Directed Branch & Bound
Solving Hybrid Decision-Control Problems Through Conflict-Directed Branch & Bound by Raj Krishnan Submitted to the Department of Electrical Engineering and Computer Science in Partial Fulfillment of the
More information3 INTEGER LINEAR PROGRAMMING
3 INTEGER LINEAR PROGRAMMING PROBLEM DEFINITION Integer linear programming problem (ILP) of the decision variables x 1,..,x n : (ILP) subject to minimize c x j j n j= 1 a ij x j x j 0 x j integer n j=
More informationHybrid Constraint Solvers
Hybrid Constraint Solvers - An overview Why Hybrid Solvers CP and SAT: Lazy Clause Generation CP and LP: Reification of Linear Constraints Conclusions 9 November 2011 Pedro Barahona - EPCL - Hybrid Solvers
More informationInteger Programming ISE 418. Lecture 7. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 7 Dr. Ted Ralphs ISE 418 Lecture 7 1 Reading for This Lecture Nemhauser and Wolsey Sections II.3.1, II.3.6, II.4.1, II.4.2, II.5.4 Wolsey Chapter 7 CCZ Chapter 1 Constraint
More informationConstraint Programming
Depth-first search Let us go back to foundations: DFS = Depth First Search Constraint Programming Roman Barták Department of Theoretical Computer Science and Mathematical Logic 2 3 4 5 6 7 8 9 Observation:
More informationCrossword Puzzles as a Constraint Problem
Crossword Puzzles as a Constraint Problem Anbulagan and Adi Botea NICTA and Australian National University, Canberra, Australia {anbulagan,adi.botea}@nicta.com.au Abstract. We present new results in crossword
More informationInteger Programming as Projection
Integer Programming as Projection H. P. Williams London School of Economics John Hooker Carnegie Mellon University INFORMS 2015, Philadelphia USA A Different Perspective on IP Projection of an IP onto
More information2. Modeling AEA 2018/2019. Based on Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice - ch. 2
2. Modeling AEA 2018/2019 Based on Algorithm Engineering: Bridging the Gap Between Algorithm Theory and Practice - ch. 2 Content Introduction Modeling phases Modeling Frameworks Graph Based Models Mixed
More information2 is not feasible if rounded. x =0,x 2
Integer Programming Definitions Pure Integer Programming all variables should be integers Mied integer Programming Some variables should be integers Binary integer programming The integer variables are
More informationLarge-Scale Optimization and Logical Inference
Large-Scale Optimization and Logical Inference John Hooker Carnegie Mellon University October 2014 University College Cork Research Theme Large-scale optimization and logical inference. Optimization on
More informationMathematical Programming Formulations, Constraint Programming
Outline DM87 SCHEDULING, TIMETABLING AND ROUTING Lecture 3 Mathematical Programming Formulations, Constraint Programming 1. Special Purpose Algorithms 2. Constraint Programming Marco Chiarandini DM87 Scheduling,
More informationConstraint (Logic) Programming
Constraint (Logic) Programming Roman Barták Faculty of Mathematics and Physics, Charles University in Prague, Czech Republic bartak@ktiml.mff.cuni.cz Sudoku Combinatorial puzzle, whose goal is to enter
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems Tuomas Sandholm Carnegie Mellon University Computer Science Department [Read Chapter 6 of Russell & Norvig] Constraint satisfaction problems (CSPs) Standard search problem:
More informationIntroduction to Mathematical Programming IE496. Final Review. Dr. Ted Ralphs
Introduction to Mathematical Programming IE496 Final Review Dr. Ted Ralphs IE496 Final Review 1 Course Wrap-up: Chapter 2 In the introduction, we discussed the general framework of mathematical modeling
More informationOptimal CSPs and Conflict-directed A*
Optimal CSPs and Conflict-directed A* courtesy of JPL Brian C. Williams 1.41J/.84J February nd, 005 //005 copyright Brian Williams, 00 1 Brian C. Williams, copyright 000 RMPL Mode Model-based Estimation:
More informationLinear Programming. Course review MS-E2140. v. 1.1
Linear Programming MS-E2140 Course review v. 1.1 Course structure Modeling techniques Linear programming theory and the Simplex method Duality theory Dual Simplex algorithm and sensitivity analysis Integer
More information15.083J Integer Programming and Combinatorial Optimization Fall Enumerative Methods
5.8J Integer Programming and Combinatorial Optimization Fall 9 A knapsack problem Enumerative Methods Let s focus on maximization integer linear programs with only binary variables For example: a knapsack
More informationOptimal Satisfiability and Conflict-directed A* Image credit: NASA. Assignment
/27/ Optimal Satisfiability and onflict-directed * Brian. Williams 6.4 / 6.43 October 27 th, 2 Image credit: NS. Brian. Williams, copyright 2 ssignment Remember: Problem Set #6 Propositional Logic, due
More informationConflict Directed Backjumping for Max-CSPs
Conflict Directed Backjumping for Max-CSPs Roie Zivan and Amnon Meisels, Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel Abstract Max-CSPs are Constraint
More informationArtificial Intelligence
Artificial Intelligence Constraint Satisfaction Problems Marc Toussaint University of Stuttgart Winter 2015/16 (slides based on Stuart Russell s AI course) Inference The core topic of the following lectures
More informationGeneral Methods and Search Algorithms
DM811 HEURISTICS AND LOCAL SEARCH ALGORITHMS FOR COMBINATORIAL OPTIMZATION Lecture 3 General Methods and Search Algorithms Marco Chiarandini 2 Methods and Algorithms A Method is a general framework for
More informationInference methods for a pseudo-boolean satisfiability solver
Inference methods for a pseudo-boolean satisfiability solver Heidi E. Dixon and Matthew L. Ginsberg CIRL 1269 University of Oregon Eugene, OR 97403-1269 {dixon, ginsberg}@cirl.uoregon.edu Abstract We describe
More information5.3 Cutting plane methods and Gomory fractional cuts
5.3 Cutting plane methods and Gomory fractional cuts (ILP) min c T x s.t. Ax b x 0integer feasible region X Assumption: a ij, c j and b i integer. Observation: The feasible region of an ILP can be described
More informationCSE 473: Artificial Intelligence
CSE 473: Artificial Intelligence Constraint Satisfaction Luke Zettlemoyer Multiple slides adapted from Dan Klein, Stuart Russell or Andrew Moore What is Search For? Models of the world: single agent, deterministic
More information56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998
56:272 Integer Programming & Network Flows Final Examination -- December 14, 1998 Part A: Answer any four of the five problems. (15 points each) 1. Transportation problem 2. Integer LP Model Formulation
More informationColumn Generation Based Primal Heuristics
Column Generation Based Primal Heuristics C. Joncour, S. Michel, R. Sadykov, D. Sverdlov, F. Vanderbeck University Bordeaux 1 & INRIA team RealOpt Outline 1 Context Generic Primal Heuristics The Branch-and-Price
More informationUnrestricted Nogood Recording in CSP search
Unrestricted Nogood Recording in CSP search George Katsirelos and Fahiem Bacchus Department of Computer Science, University Of Toronto, Toronto, Ontario, Canada [gkatsi,fbacchus]@cs.toronto.edu Abstract.
More informationTIM 206 Lecture Notes Integer Programming
TIM 206 Lecture Notes Integer Programming Instructor: Kevin Ross Scribe: Fengji Xu October 25, 2011 1 Defining Integer Programming Problems We will deal with linear constraints. The abbreviation MIP stands
More informationUsing CSP Look-Back Techniques to Solve Real-World SAT Instances
Using CSP Look-Back Techniques to Solve Real-World SAT Instances Roberto J. Bayardo Jr. The University of Texas at Austin Department of Computer Sciences (C0500) Austin, TX 78712 USA bayardo@cs.utexas.edu
More informationChapter 10 Part 1: Reduction
//06 Polynomial-Time Reduction Suppose we could solve Y in polynomial-time. What else could we solve in polynomial time? don't confuse with reduces from Chapter 0 Part : Reduction Reduction. Problem X
More informationMVE165/MMG630, Applied Optimization Lecture 8 Integer linear programming algorithms. Ann-Brith Strömberg
MVE165/MMG630, Integer linear programming algorithms Ann-Brith Strömberg 2009 04 15 Methods for ILP: Overview (Ch. 14.1) Enumeration Implicit enumeration: Branch and bound Relaxations Decomposition methods:
More informationPropagating Separable Equalities. in an MDD Store. Peter Tiedemann INFORMS John Hooker. Tarik Hadzic. Cork Constraint Computation Centre
Propagating Separable Equalities in an MDD Store Tarik Hadzic Cork Constraint Computation Centre John Hooker Carnegie Mellon University Peter Tiedemann Configit Software Slide 1 INFORMS 2008 Slide 2 Constraint
More informationA CSP Search Algorithm with Reduced Branching Factor
A CSP Search Algorithm with Reduced Branching Factor Igor Razgon and Amnon Meisels Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105, Israel {irazgon,am}@cs.bgu.ac.il
More informationA Uniform View of Backtracking
A Uniform View of Backtracking Fahiem Bacchus 1 Department. of Computer Science, 6 Kings College Road, University Of Toronto, Toronto, Ontario, Canada, M5S 1A4, fbacchus@cs.toronto.edu? Abstract. Backtracking
More informationWhat is Search For? CS 188: Artificial Intelligence. Constraint Satisfaction Problems
CS 188: Artificial Intelligence Constraint Satisfaction Problems What is Search For? Assumptions about the world: a single agent, deterministic actions, fully observed state, discrete state space Planning:
More informationNogood Learning for Mixed Integer Programming
Nogood Learning for Mixed Integer Programming Tuomas Sandholm Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213, USA sandholm@cs.cmu.edu Rob Shields Computer Science Department
More informationMotivation for Heuristics
MIP Heuristics 1 Motivation for Heuristics Why not wait for branching? Produce feasible solutions as quickly as possible Often satisfies user demands Avoid exploring unproductive sub trees Better reduced
More informationConstraint Satisfaction Problems (CSPs)
1 Hal Daumé III (me@hal3.name) Constraint Satisfaction Problems (CSPs) Hal Daumé III Computer Science University of Maryland me@hal3.name CS 421: Introduction to Artificial Intelligence 7 Feb 2012 Many
More information: Principles of Automated Reasoning and Decision Making Midterm
16.410-13: Principles of Automated Reasoning and Decision Making Midterm October 20 th, 2003 Name E-mail Note: Budget your time wisely. Some parts of this quiz could take you much longer than others. Move
More informationConflict based Backjumping for Constraints Optimization Problems
Conflict based Backjumping for Constraints Optimization Problems Roie Zivan and Amnon Meisels {zivanr,am}@cs.bgu.ac.il Department of Computer Science, Ben-Gurion University of the Negev, Beer-Sheva, 84-105,
More informationUnit.9 Integer Programming
Unit.9 Integer Programming Xiaoxi Li EMS & IAS, Wuhan University Dec. 22-29, 2016 (revised) Operations Research (Li, X.) Unit.9 Integer Programming Dec. 22-29, 2016 (revised) 1 / 58 Organization of this
More informationSatisfiability-Based Algorithms for 0-1 Integer Programming
Satisfiability-Based Algorithms for 0-1 Integer Programming Vasco M. Manquinho, João P. Marques Silva, Arlindo L. Oliveira and Karem A. Sakallah Cadence European Laboratories / INESC Instituto Superior
More informationChapter 6 Constraint Satisfaction Problems
Chapter 6 Constraint Satisfaction Problems CS5811 - Artificial Intelligence Nilufer Onder Department of Computer Science Michigan Technological University Outline CSP problem definition Backtracking search
More informationWhat is Search For? CSE 473: Artificial Intelligence. Example: N-Queens. Example: N-Queens. Example: Map-Coloring 4/7/17
CSE 473: Artificial Intelligence Constraint Satisfaction Dieter Fox What is Search For? Models of the world: single agent, deterministic actions, fully observed state, discrete state space Planning: sequences
More informationCS 188: Artificial Intelligence. What is Search For? Constraint Satisfaction Problems. Constraint Satisfaction Problems
CS 188: Artificial Intelligence Constraint Satisfaction Problems Constraint Satisfaction Problems N variables domain D constraints x 1 x 2 Instructor: Marco Alvarez University of Rhode Island (These slides
More informationA Re-examination of Limited Discrepancy Search
A Re-examination of Limited Discrepancy Search W. Ken Jackson, Morten Irgens, and William S. Havens Intelligent Systems Lab, Centre for Systems Science Simon Fraser University Burnaby, B.C., CANADA V5A
More informationFebruary 19, Integer programming. Outline. Problem formulation. Branch-andbound
Olga Galinina olga.galinina@tut.fi ELT-53656 Network Analysis and Dimensioning II Department of Electronics and Communications Engineering Tampere University of Technology, Tampere, Finland February 19,
More informationCMU-Q Lecture 7: Searching in solution space Constraint Satisfaction Problems (CSPs) Teacher: Gianni A. Di Caro
CMU-Q 15-381 Lecture 7: Searching in solution space Constraint Satisfaction Problems (CSPs) Teacher: Gianni A. Di Caro AI PLANNING APPROACHES SO FAR Goal: Find the (best) sequence of actions that take
More informationIntegrating Mixed-Integer Optimisation & Satisfiability Modulo Theories
Integrating Mixed-Integer Optimisation & Satisfiability Modulo Theories Application to Scheduling Miten Mistry and Ruth Misener Wednesday 11 th January, 2017 Mistry & Misener MIP & SMT Wednesday 11 th
More informationStochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition
Stochastic Separable Mixed-Integer Nonlinear Programming via Nonconvex Generalized Benders Decomposition Xiang Li Process Systems Engineering Laboratory Department of Chemical Engineering Massachusetts
More informationConstraint Satisfaction Problems. slides from: Padhraic Smyth, Bryan Low, S. Russell and P. Norvig, Jean-Claude Latombe
Constraint Satisfaction Problems slides from: Padhraic Smyth, Bryan Low, S. Russell and P. Norvig, Jean-Claude Latombe Standard search problems: State is a black box : arbitrary data structure Goal test
More informationCourse Summary! What have we learned and what are we expected to know?
Course Summary! What have we learned and what are we expected to know? Overview! Introduction Modelling in MiniZinc Finite Domain Constraint Solving Search Linear Programming and Network Flow Mixed Integer
More informationSearch Strategy Simulation in Constraint Booleanization
Search Strategy Simulation in Constraint Booleanization Jinbo Huang Optimisation Research Group, NICTA and Research School of Computer Science, Australian National University Abstract Within the recently
More informationHeuristic Backtracking Algorithms for SAT
Heuristic Backtracking Algorithms for SAT A. Bhalla, I. Lynce, J.T. de Sousa and J. Marques-Silva IST/INESC-ID, Technical University of Lisbon, Portugal fateet,ines,jts,jpmsg@sat.inesc.pt Abstract In recent
More informationOn the selection of Benders cuts
Mathematical Programming manuscript No. (will be inserted by the editor) On the selection of Benders cuts Matteo Fischetti Domenico Salvagnin Arrigo Zanette Received: date / Revised 23 February 2010 /Accepted:
More informationAdvanced Operations Research Techniques IE316. Quiz 2 Review. Dr. Ted Ralphs
Advanced Operations Research Techniques IE316 Quiz 2 Review Dr. Ted Ralphs IE316 Quiz 2 Review 1 Reading for The Quiz Material covered in detail in lecture Bertsimas 4.1-4.5, 4.8, 5.1-5.5, 6.1-6.3 Material
More informationAnnouncements. Homework 1: Search. Project 1: Search. Midterm date and time has been set:
Announcements Homework 1: Search Has been released! Due Monday, 2/1, at 11:59pm. On edx online, instant grading, submit as often as you like. Project 1: Search Has been released! Due Friday 2/5 at 5pm.
More informationCS 343: Artificial Intelligence
CS 343: Artificial Intelligence Constraint Satisfaction Problems Prof. Scott Niekum The University of Texas at Austin [These slides are based on those of Dan Klein and Pieter Abbeel for CS188 Intro to
More informationLecture 18. Questions? Monday, February 20 CS 430 Artificial Intelligence - Lecture 18 1
Lecture 18 Questions? Monday, February 20 CS 430 Artificial Intelligence - Lecture 18 1 Outline Chapter 6 - Constraint Satisfaction Problems Path Consistency & Global Constraints Sudoku Example Backtracking
More informationCS 4100 // artificial intelligence
CS 4100 // artificial intelligence instructor: byron wallace Constraint Satisfaction Problems Attribution: many of these slides are modified versions of those distributed with the UC Berkeley CS188 materials
More informationAnnouncements. CS 188: Artificial Intelligence Fall 2010
Announcements Project 1: Search is due Monday Looking for partners? After class or newsgroup Written 1: Search and CSPs out soon Newsgroup: check it out CS 188: Artificial Intelligence Fall 2010 Lecture
More informationMVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms
MVE165/MMG631 Linear and integer optimization with applications Lecture 9 Discrete optimization: theory and algorithms Ann-Brith Strömberg 2018 04 24 Lecture 9 Linear and integer optimization with applications
More informationConstraint Satisfaction Problems. Chapter 6
Constraint Satisfaction Problems Chapter 6 Constraint Satisfaction Problems A constraint satisfaction problem consists of three components, X, D, and C: X is a set of variables, {X 1,..., X n }. D is a
More informationImproving Unsatisfiability-based Algorithms for Boolean Optimization
Improving Unsatisfiability-based Algorithms for Boolean Optimization Vasco Manquinho, Ruben Martins, and Inês Lynce IST/INESC-ID, Technical University of Lisbon, Portugal {vmm,ruben,ines}@sat.inesc-id.pt
More informationLinear programming and duality theory
Linear programming and duality theory Complements of Operations Research Giovanni Righini Linear Programming (LP) A linear program is defined by linear constraints, a linear objective function. Its variables
More informationABT with Clause Learning for Distributed SAT
ABT with Clause Learning for Distributed SAT Jesús Giráldez-Cru, Pedro Meseguer IIIA - CSIC, Universitat Autònoma de Barcelona, 08193 Bellaterra, Spain {jgiraldez,pedro}@iiia.csic.es Abstract. Transforming
More informationIntroduction to Mathematical Programming IE406. Lecture 20. Dr. Ted Ralphs
Introduction to Mathematical Programming IE406 Lecture 20 Dr. Ted Ralphs IE406 Lecture 20 1 Reading for This Lecture Bertsimas Sections 10.1, 11.4 IE406 Lecture 20 2 Integer Linear Programming An integer
More informationCS 188: Artificial Intelligence Fall 2011
Announcements Project 1: Search is due next week Written 1: Search and CSPs out soon Piazza: check it out if you haven t CS 188: Artificial Intelligence Fall 2011 Lecture 4: Constraint Satisfaction 9/6/2011
More informationi 1 CONSTRAINT SATISFACTION METHODS FOR GENERATING VALID CUTS J. N. Hooker Graduate School of Industrial Administration Carnegie Mellon University Pittsburgh, PA 15213 USA http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/jnh.html
More informationBayesian network model selection using integer programming
Bayesian network model selection using integer programming James Cussens Leeds, 2013-10-04 James Cussens IP for BNs Leeds, 2013-10-04 1 / 23 Linear programming The Belgian diet problem Fat Sugar Salt Cost
More informationThe MIP-Solving-Framework SCIP
The MIP-Solving-Framework SCIP Timo Berthold Zuse Institut Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 23.05.2007 What Is A MIP? Definition MIP The optimization problem
More informationAnnouncements. Homework 4. Project 3. Due tonight at 11:59pm. Due 3/8 at 4:00pm
Announcements Homework 4 Due tonight at 11:59pm Project 3 Due 3/8 at 4:00pm CS 188: Artificial Intelligence Constraint Satisfaction Problems Instructor: Stuart Russell & Sergey Levine, University of California,
More informationExample: Map coloring
Today s s lecture Local Search Lecture 7: Search - 6 Heuristic Repair CSP and 3-SAT Solving CSPs using Systematic Search. Victor Lesser CMPSCI 683 Fall 2004 The relationship between problem structure and
More informationSolutions for Operations Research Final Exam
Solutions for Operations Research Final Exam. (a) The buffer stock is B = i a i = a + a + a + a + a + a 6 + a 7 = + + + + + + =. And the transportation tableau corresponding to the transshipment problem
More informationSAT Solvers. Ranjit Jhala, UC San Diego. April 9, 2013
SAT Solvers Ranjit Jhala, UC San Diego April 9, 2013 Decision Procedures We will look very closely at the following 1. Propositional Logic 2. Theory of Equality 3. Theory of Uninterpreted Functions 4.
More informationConstructive Search Algorithms
Constructive Search Algorithms! Introduction Historically the major search method for CSPs Reference: S.W.Golomb & L.D.Baumert (1965) Backtrack Programming, JACM 12:516-524 Extended for Intelligent Backtracking
More informationThe Branch & Move algorithm: Improving Global Constraints Support by Local Search
Branch and Move 1 The Branch & Move algorithm: Improving Global Constraints Support by Local Search Thierry Benoist Bouygues e-lab, 1 av. Eugène Freyssinet, 78061 St Quentin en Yvelines Cedex, France tbenoist@bouygues.com
More informationCS 188: Artificial Intelligence Fall 2008
CS 188: Artificial Intelligence Fall 2008 Lecture 4: CSPs 9/9/2008 Dan Klein UC Berkeley Many slides over the course adapted from either Stuart Russell or Andrew Moore 1 1 Announcements Grading questions:
More informationAnnouncements. CS 188: Artificial Intelligence Fall Large Scale: Problems with A* What is Search For? Example: N-Queens
CS 188: Artificial Intelligence Fall 2008 Announcements Grading questions: don t panic, talk to us Newsgroup: check it out Lecture 4: CSPs 9/9/2008 Dan Klein UC Berkeley Many slides over the course adapted
More informationSpace of Search Strategies. CSE 573: Artificial Intelligence. Constraint Satisfaction. Recap: Search Problem. Example: Map-Coloring 11/30/2012
/0/0 CSE 57: Artificial Intelligence Constraint Satisfaction Daniel Weld Slides adapted from Dan Klein, Stuart Russell, Andrew Moore & Luke Zettlemoyer Space of Search Strategies Blind Search DFS, BFS,
More informationIntegrating Probabilistic Reasoning with Constraint Satisfaction
Integrating Probabilistic Reasoning with Constraint Satisfaction IJCAI Tutorial #7 Instructor: Eric I. Hsu July 17, 2011 http://www.cs.toronto.edu/~eihsu/tutorial7 Bottom Line Up Front (BLUF) Thesis: The
More informationApplied Mixed Integer Programming: Beyond 'The Optimum'
Applied Mixed Integer Programming: Beyond 'The Optimum' 14 Nov 2016, Simons Institute, Berkeley Pawel Lichocki Operations Research Team, Google https://developers.google.com/optimization/ Applied Mixed
More informationSome Advanced Topics in Linear Programming
Some Advanced Topics in Linear Programming Matthew J. Saltzman July 2, 995 Connections with Algebra and Geometry In this section, we will explore how some of the ideas in linear programming, duality theory,
More informationThe goal of this paper is to develop models and methods that use complementary
for a Class of Optimization Problems Vipul Jain Ignacio E. Grossmann Department of Chemical Engineering, Carnegie Mellon University, Pittsburgh, Pennsylvania, 15213, USA Vipul_Jain@i2.com grossmann@cmu.edu
More informationA COMPARISON OF ATMS AND CSP TECHNIQUES
A COMPARISON OF ATMS AND CSP TECHNIQUES Johan de Kleer Xerox Palo Alto Research Center 3333 Coyote Hill Road, Palo Alto CA 94304 Abstract A fundamental problem for most AI problem solvers is how to control
More informationRobert Effinger. Final Project Report. Cognitive Robotics J - Spring 2004
Robert Effinger Final Project Report Cognitive Robotics 16.412J - Spring 2004 May 13, 2004 Table of Contents 1.) Table of Contents.. 2 2.) Overall Description.3 a.) Brief Group Project Description b.)
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems [These slides were created by Dan Klein and Pieter Abbeel for CS188 Intro to AI at UC Berkeley. All CS188 materials are available at http://ai.berkeley.edu.] What is Search
More informationIntegrating Probabilistic Reasoning with Constraint Satisfaction
Integrating Probabilistic Reasoning with Constraint Satisfaction IJCAI Tutorial #7 Instructor: Eric I. Hsu July 17, 2011 http://www.cs.toronto.edu/~eihsu/tutorial7 Getting Started Discursive Remarks. Organizational
More informationA generic framework for solving CSPs integrating decomposition methods
A generic framework for solving CSPs integrating decomposition methods L. Blet 1,3, S. N. Ndiaye 1,2, and C. Solnon 1,3 1 Université de Lyon - LIRIS 2 Université Lyon 1, LIRIS, UMR5205, F-69622 France
More informationConstraint Satisfaction Problems
Constraint Satisfaction Problems CE417: Introduction to Artificial Intelligence Sharif University of Technology Spring 2013 Soleymani Course material: Artificial Intelligence: A Modern Approach, 3 rd Edition,
More informationPrinciples of Autonomy and Decision Making
Massachusetts Institute of Technology 16.410-13 Principles of Autonomy and Decision Making Problem Set #6 (distributed 10/22/04). Paper solutions are due no later than 5pm on Friday, 10/29/04. Please give
More informationConstraint Programming
Volume title 1 The editors c 2006 Elsevier All rights reserved Chapter 1 Constraint Programming Francesca Rossi, Peter van Beek, Toby Walsh 1.1 Introduction Constraint programming is a powerful paradigm
More informationCS 4700: Foundations of Artificial Intelligence. Bart Selman. Search Techniques R&N: Chapter 3
CS 4700: Foundations of Artificial Intelligence Bart Selman Search Techniques R&N: Chapter 3 Outline Search: tree search and graph search Uninformed search: very briefly (covered before in other prerequisite
More informationSRI VIDYA COLLEGE OF ENGINEERING & TECHNOLOGY REPRESENTATION OF KNOWLEDGE PART A
UNIT II REPRESENTATION OF KNOWLEDGE PART A 1. What is informed search? One that uses problem specific knowledge beyond the definition of the problem itself and it can find solutions more efficiently than
More informationHow to use your favorite MIP Solver: modeling, solving, cannibalizing. Andrea Lodi University of Bologna, Italy
How to use your favorite MIP Solver: modeling, solving, cannibalizing Andrea Lodi University of Bologna, Italy andrea.lodi@unibo.it January-February, 2012 @ Universität Wien A. Lodi, How to use your favorite
More informationPrimal Heuristics in SCIP
Primal Heuristics in SCIP Timo Berthold Zuse Institute Berlin DFG Research Center MATHEON Mathematics for key technologies Berlin, 10/11/2007 Outline 1 Introduction Basics Integration Into SCIP 2 Available
More informationOn Mixed-Integer (Linear) Programming and its connection with Data Science
On Mixed-Integer (Linear) Programming and its connection with Data Science Andrea Lodi Canada Excellence Research Chair École Polytechnique de Montréal, Québec, Canada andrea.lodi@polymtl.ca January 16-20,
More informationI R TECHNICAL RESEARCH REPORT. On the Use of Integer Programming Models in AI Planning. by Thomas Vossen, Michael Ball, Amnon Lotem, Dana Nau TR 99-84
TECHNICAL RESEARCH REPORT On the Use of Integer Programming Models in AI Planning by Thomas Vossen, Michael Ball, Amnon Lotem, Dana Nau TR 99-84 I R INSTITUTE FOR SYSTEMS RESEARCH ISR develops, applies
More informationInteger Programming ISE 418. Lecture 1. Dr. Ted Ralphs
Integer Programming ISE 418 Lecture 1 Dr. Ted Ralphs ISE 418 Lecture 1 1 Reading for This Lecture N&W Sections I.1.1-I.1.4 Wolsey Chapter 1 CCZ Chapter 2 ISE 418 Lecture 1 2 Mathematical Optimization Problems
More informationConstraint Optimisation Problems. Constraint Optimisation. Cost Networks. Branch and Bound. Dynamic Programming
Summary Network Search Bucket Elimination Soft Soft s express preferences over variable assignments Preferences give dierent values over variable assignment A student can follow only one class at a time
More information