Conflict-Directed Backjumping Revisited

06/01/2011
by   X. Chen, et al.
0

In recent years, many improvements to backtracking algorithms for solving constraint satisfaction problems have been proposed. The techniques for improving backtracking algorithms can be conveniently classified as look-ahead schemes and look-back schemes. Unfortunately, look-ahead and look-back schemes are not entirely orthogonal as it has been observed empirically that the enhancement of look-ahead techniques is sometimes counterproductive to the effects of look-back techniques. In this paper, we focus on the relationship between the two most important look-ahead techniques---using a variable ordering heuristic and maintaining a level of local consistency during the backtracking search---and the look-back technique of conflict-directed backjumping (CBJ). We show that there exists a "perfect" dynamic variable ordering such that CBJ becomes redundant. We also show theoretically that as the level of local consistency that is maintained in the backtracking search is increased, the less that backjumping will be an improvement. Our theoretical results partially explain why a backtracking algorithm doing more in the look-ahead phase cannot benefit more from the backjumping look-back scheme. Finally, we show empirically that adding CBJ to a backtracking algorithm that maintains generalized arc consistency (GAC), an algorithm that we refer to as GAC-CBJ, can still provide orders of magnitude speedups. Our empirical results contrast with Bessiere and Regin's conclusion (1996) that CBJ is useless to an algorithm that maintains arc consistency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/04/2020

Playing Chess with Limited Look Ahead

We have seen numerous machine learning methods tackle the game of chess ...
research
06/01/2011

Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan

This paper reviews the connections between Graphplan's planning-graph an...
research
08/23/2012

Optimized Look-Ahead Tree Policies: A Bridge Between Look-Ahead Tree Policies and Direct Policy Search

Direct policy search (DPS) and look-ahead tree (LT) policies are two wid...
research
03/30/2020

Anytime and Efficient Coalition Formation with Spatial and Temporal Constraints

The Coalition Formation with Spatial and Temporal constraints Problem (C...
research
03/18/2022

Look-Ahead Acquisition Functions for Bernoulli Level Set Estimation

Level set estimation (LSE) is the problem of identifying regions where a...
research
10/04/2018

An Efficient Approach for Removing Look-ahead Bias in the Least Square Monte Carlo Algorithm: Leave-One-Out

The least square Monte Carlo (LSM) algorithm proposed by Longstaff and S...
research
03/31/2021

Generalized Conflict-directed Search for Optimal Ordering Problems

Solving planning and scheduling problems for multiple tasks with highly ...

Please sign up or login with your details

Forgot password? Click here to reset