Asynchronous forward-bounding with backjumping Academic Article uri icon


  • Abstract. The Asynchronous forward-bounding (AFB) algorithm [GMZ06] is a distributed constraint optimization problem (DisCOP) solver. We extend the AFB algorithm by adding a backjumping mechanism, resulting in the AFB-BJ algorithm. AFB-BJ is based on accumulated information on bounds of all values and on processing concurrently a queue of candidate goals for the next move back. The AFB-BJ algorithm is shown experimentally to be a very efficient algorithm for DisCOPs. The algorithm is described in detail and its …

publication date

  • January 1, 2007