We study local-control algorithms for maximum flow and multicommodity flow problems in distributed networks. We propose a second-order method for accelerating the convergence of the “first-order” distributed algorithms recently proposed by Awerbuch and Leighton. Our experimental study shows that second-order methods are significantly faster than the first-order methods for approximate singleand...

Branch-and-bound algorithms are general methods applicable to various combinatorial optimization problems and parallelization is one of the most hopeful methods to improve these algorithms. Parallel branch-and-bound algorithm implementations can be divided in two types based on whether a central or a distributed control scheme is used. Central control schemes have reduced scalability because of...

As industrial systems grow in complexity, new methodologies for the implementation of their control systems are being developed. Following this line, the application of artificial intelligence (AI) techniques to the implementation of distributed control systems offers several advantages. However, some problems related to the collaboration of both techniques arise, being added to the inherent di...

We consider distributed parameter systems where the underlying dynamics are spatially invariant, and where the controls and measurements are spatially distributed. These systems arise in many applications such as the control of platoons, smart structures, or distributed ow control through the uid boundary. For optimal control problems involving quadratic criteria such as LQR, H2 and H1, it is s...