Abstract

Extended Partial Dynamic Backtracking (EPDB) is a repair algorithm based on PDB. It deals with Dynamic CSPs based on ordering heuristics and retroactive data structures, safety conditions, and nogoods which are saved during the search process. In this paper, we show that the drawback of both EPDB and PDB is the exhaustive verification of orders, saved in safety conditions and nogoods, between variables. This verification affects remarkably search time, especially since orders are often indirectly deduced. Therefore, we propose a new approach for dynamically changing environments, the Lazy Repairing Backtracking (LRB), which is a fast version of EPDB insofar as it deduces orders directly through the used ordering heuristic. We evaluate LRB on various kinds of problems, and compare it, on the one hand, with EPDB to show its effectiveness compared to this approach, and, on the other hand, with MAC-2001 in order to conclude, from what perturbation rate resolving a DCSP with an efficient approach can be more advantageous than repair.

Keywords

MSC

97P50, 97R40

Cite this article

@article{cai-3808,
  author  = {Yosra Acodad and Amine Benamrane and El Houssine Bouyakhf and Imade Benelallam},
  title   = {Lazy Repairing Backtracking for Dynamic Constraint Satisfaction Problems},
  journal = {Computing and Informatics},
  volume  = {40},
  number  = {5},
  pages   = {1056--1079},
  year    = {2021},
  issn    = {1335-9150},
  doi     = {10.31577/cai_2021_5_1056}
}
Download .bib