论文信息 - Row Straightening via local interactions

Row Straightening via local interactions

A number of agents can arrange themselves equidistantly in a row via a sequence of adjustments, based on a simple “local” interaction. The convergence of the configuration to the desired one is exponentially fast. A similarity is shown between this phenomenon and the dynamics of pulse propagation along a distributedRC line, and a conjecture is made concerning the evolution of a similar system with a probabilistic rule of behavior.

A. Bruckstein | I. Wagner

[1] G. Darboux,et al. Sur un problème de géométrie élémentaire , 1878 .

[2] M. Kac. Random Walk and the Theory of Brownian Motion , 1947 .

[3] A Property of Linear Cyclic Transformations , 1953 .

[4] F. B. Hildebrand,et al. Introduction To Numerical Analysis , 1957 .

[5] M. R. Spiegel. Mathematical handbook of formulas and tables , 1968 .

[6] Peter Lancaster,et al. The theory of matrices , 1969 .

[7] P. Davis. Cyclic Transformations of Polygons and the Generalized Inverse , 1977, Canadian Journal of Mathematics.

[8] Sequences of Polygons , 1979 .

[9] T. Sakurai,et al. Approximation of wiring delay in MOSFET LSI , 1983, IEEE Journal of Solid-State Circuits.

[10] R. J. Antinone,et al. The modeling of resistive interconnects for integrated circuits , 1983 .

[11] F. R. Gantmakher. The Theory of Matrices , 1984 .

[12] S. Gueron,et al. Self-organization of front patterns in large wildebeest herds , 1993 .

[13] Masaaki Kijima. Numerical Calculation of Ruin Probabilities for Skip-Free Markov Chains , 1993, SIAM Rev..

[14] Andrew B. Kahng,et al. Delay Analysis of VLSI Interconnections Using the Diffusion Equation Model , 1994, 31st Design Automation Conference.

[15] Guillermo Sapiro,et al. Evolutions of Planar Polygons , 1995, Int. J. Pattern Recognit. Artif. Intell..

[16] Geoffrey C. Shephard,et al. A Polygon Problem , 1996 .