Optimal path finding with space variant metric weights via multilayer CNN-UM

Hyongsuk Kim, Youngsu Park, Tamas Roska, Leon O. Chua

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Analogic CNN-based optimal path finding algorithm is proposed to solve the problem with space variant metric weights. The algorithm is based on the analog version of modified dynamic programming which is implemented with nonlinear templates on the multi-layer CNN-UM. The structure is composed of distance computing layer, intermediate layer, and path finding layer. Employment of intermediate layers allows the space variant distance weights to be provided externally and the CNN structure to be compact.

Original languageEnglish
Title of host publicationISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Pages429-432
Number of pages4
DOIs
Publication statusPublished - Dec 1 2001
Event2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001 - Sydney, NSW, Australia
Duration: May 6 2001May 9 2001

Publication series

NameISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings
Volume3

Conference

Conference2001 IEEE International Symposium on Circuits and Systems, ISCAS 2001
CountryAustralia
CitySydney, NSW
Period5/6/015/9/01

ASJC Scopus subject areas

  • Hardware and Architecture
  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Fingerprint Dive into the research topics of 'Optimal path finding with space variant metric weights via multilayer CNN-UM'. Together they form a unique fingerprint.

  • Cite this

    Kim, H., Park, Y., Roska, T., & Chua, L. O. (2001). Optimal path finding with space variant metric weights via multilayer CNN-UM. In ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings (pp. 429-432). [921339] (ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings; Vol. 3). https://doi.org/10.1109/ISCAS.2001.921339