Distributed Circle Fitting by an Averaging Consensus Algorithm
نویسندگان
چکیده
منابع مشابه
Convergence Speed in Distributed Consensus and Averaging
We propose three new algorithms for the distributed averaging and consensus problems: two for the fixed-graph case, and one for the dynamic-topology case. The convergence times of our fixed-graph algorithms compare favorably with other known methods, while our algorithm for the dynamic-topology case is the first to be accompanied by a polynomial-time bound on the worst-case convergence time. Th...
متن کاملDistributed Path Consensus Algorithm
Path planning methods based on discrete graph searches are highly effective in dealing with large-scale environments, arbitrarily shaped obstacles, frequent map updates and complex cost functions. When it comes to planning for teams of coupled agents however, typical graph searchbased planning techniques quickly become infeasible due to the exponential growth of the dimensionality of the joint ...
متن کاملCorrecting Radial Distortion by Circle Fitting
A powerful and popular approach for estimating radial lens distortion parameters is to use the fact that lines which are straight in the scene should be imaged as straight lines under the pinhole camera model. This paper revisits this problem using the division model to parameterise the lens distortion. This turns out to have significant advantages over the more conventional parameterisation, e...
متن کاملApproximation algorithm for the L1-fitting circle problem
In this paper, we study the problem of L1-fitting a circle to a set of points in the plane, where the target function is the sum of distances of the points to the circle. We show an (1 + ε)-approximation algorithm, with running time O(n + poly(log n, 1/ε)), where poly(log n, 1/ε) is a constant degree polynomial in log n and 1/ε. This is the first subquadratic algorithm for this problem.
متن کاملDistributed protocol for determining when averaging consensus is reached
Distributed averaging over a large network is a well studied problem that converges asymptotically; however, existing protocols does not provide a way for each node to distributively detect the occurrence of convergence. In this paper a method is developed to distributively determine when the consensus has reached within a given error margin. In absence of such a method all nodes in the network...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2014
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.27.14