no code implementations • 7 Apr 2015 • José Bento, Nate Derbinsky, Charles Mathy, Jonathan S. Yedidia
We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms.
no code implementations • 16 Nov 2013 • Nate Derbinsky, José Bento, Jonathan S. Yedidia
In this context, we focus on the Three-Weight Algorithm, which aims to solve general optimization problems.
no code implementations • 8 May 2013 • Nate Derbinsky, José Bento, Veit Elser, Jonathan S. Yedidia
We describe how the powerful "Divide and Concur" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for convex optimization, and introduce an improved message-passing algorithm based on ADMM/DC by introducing three distinct weights for messages, with "certain" and "no opinion" weights, as well as the standard weight used in ADMM/DC.
