Share Email Print

Proceedings Paper

Robot architectures and design paradigms
Author(s): William J. Wolfe; Wendell H. Chun
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

We introduce a generalization of mutually inhibitory networks, and call them homogeneous networks, and provide the harmonic analysis for all such networks. The critical features of such networks are (1) the connection strength matrix is a circulant, symmetric, Toeplitz matrix; and (2) the discrete fourier transform of the first row of the connection strength matrix provides the eigenvalues of the matrix; and (3) the corresponding eigenspaces are spanned by the discrete harmonics from fourier analysis. We apply these ideas to k-winner, k-cluster, on- center off-surround, and knapsack problems, with some thoughts about how to generalize the results to 2 dimensions for problems such as the Assignment Problem and the Traveling Salesman Problem.

Paper Details

Date Published: 4 May 1993
PDF: 11 pages
Proc. SPIE 1831, Mobile Robots VII, (4 May 1993); doi: 10.1117/12.143837
Show Author Affiliations
William J. Wolfe, Univ. of Colorado/Denver (United States)
Wendell H. Chun, Martin Marietta Astronautics Group (United States)

Published in SPIE Proceedings Vol. 1831:
Mobile Robots VII
William J. Wolfe; Wendell H. Chun, Editor(s)

© SPIE. Terms of Use
Back to Top