| Popis: |
Highly interconnected networks of relatively simple processing elements are shown to be very effective in solving difficult optimization problems. Problems that fall into the broad category of finding a least cost path between two points, given a distributed and sometimes complex cost map, are studied in this paper. A neural-like architecture and associated computational rules are proposed for the solution of this class of optimal path-finding problems in two- and higher-dimensional spaces. |
