Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
Abstract— We study the stereo matching problem for reconstruction of the location of 3D-points on an unknown surface patch from two calibrated identical cameras without using any...
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
Abstract—We present a distributed connectivity service that allows agents in a mobile ad-hoc network to move while preserving connectivity. This allows unmodified motion plannin...
Abstract— We describe a model for planar distributed assembly, in which agents move randomly and independently on a twodimensional grid, joining square blocks together to form a ...