Title :
Fast computation of optimal paths in two- and higher dimension maps
Author :
Hassoun, Mohamad H.
Author_Institution :
Dept. of Electr. & Comput. Eng., Wayne State Univ., Detroit, MI, USA
Abstract :
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. A neurallike architecture and associated computational rules are proposed for the solution of this class of optimal path-finding problems in two- and higher-dimensional spaces
Keywords :
neural nets; operations research; optimisation; parallel architectures; 2D maps; associated computational rules; complex cost map; fast computations of optimal paths; higher dimension maps; higher-dimensional spaces; highly interconnected networks; least-cost path between two points; neurallike architecture; optimal path-finding problems; simple processing elements; solving difficult optimization problems; Business; Computational modeling; Computer architecture; Computer networks; Cost function; Distributed computing; Heuristic algorithms; Intelligent networks; Polynomials; Search problems;
Conference_Titel :
Circuits and Systems, 1990., IEEE International Symposium on
Conference_Location :
New Orleans, LA
DOI :
10.1109/ISCAS.1990.112178
