Dynamic Backtracking
نویسندگان
چکیده
منابع مشابه
Dynamic Backtracking
Because of their occasional need to return to shallow points in a search tree, existing backtracking methods can sometimes erase meaningful progress toward solving a search problem. In this paper, we present a method by which backtrack points can be moved deeper in the search space, thereby avoiding this di culty. The technique developed is a variant of dependency-directed backtracking that use...
متن کاملDistributed Dynamic Backtracking
In the scope of distributed constraint reasoning, the main algorithms presented so far have a feature in common: the addition of links between previously unrelated agents, before or during search. This paper presents a new search procedure for finding a solution in a distributed constraint satisfaction problem. This algorithm makes use of some of the good properties of centralised dynamic backt...
متن کاملGSAT and Dynamic Backtracking
There has been substantial recent interest in two new families of search techniques. One family consists of nonsystematic methods such as GSAT; the other contoi-~ systematic approaches that use a polynomial amount of justification information to prune the search space. This paper introduces a new technique that combines these two approaches. The algorithm allows substantial freedom of movement ...
متن کاملRetroactive Ordering for Dynamic Backtracking
Dynamic Backtracking (DBT ) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT , variables are allowed to keep their assignment during backjump, if they are compatible with the set of eliminating explanations. A previous study has shown that when DBT is combined with variable ordering heuristics it performs poorly compared to standard Conflictdirected Backjumping (CB...
متن کاملDynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i.e. the problems are distributed over a number of agents and change over time. Dynamic Distributed Constraint Satisfaction Problems (DDisCSP) [1] are an emerging field for the resolution problems that are dynamic and distributed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1993
ISSN: 1076-9757
DOI: 10.1613/jair.1