Descending requirements search for DisCSPs Academic Article uri icon


  • Abstract. A new search algorithm, Descending Requirements Search (DESRS), for Distributed CSPs is proposed. The algorithm is composed of two independent phases. In the first phase, agents form a binary hierarchy of groups. The distributed partition algorithm uses a heuristic that prefers to join neighbors that are strongly constrained, into groups. This is done concurrently at all levels of the hierarchy. In the second phase, concurrent independent backtracking search processes grow partial assignments along a hierarchy …

publication date

  • August 1, 2006