Finding the shortest path in the shortest time using PCNN's
A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time.
Saved in:
Published in | IEEE transactions on neural networks Vol. 10; no. 3; pp. 604 - 606 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
United States
IEEE
1999
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time. |
---|---|
AbstractList | A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time. A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time Taking the subject of maze running, finding the shortest path and doing so with minimum effort is attempted. The preferred approach for this problem is to use a pulse-coupled neural network (PCNN). The PCNN is capable of running mazes nondeterministically with constant time per step. As a result, when a signal emerges, the PCNN takes the shortest path in the shortest time. A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time.A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges, it has taken the shortest path in the shortest time. |
Author | Kinser, J.M. Caulfield, H.J. |
Author_xml | – sequence: 1 givenname: H.J. surname: Caulfield fullname: Caulfield, H.J. organization: Fisk Univ., Nashville, TN, USA – sequence: 2 givenname: J.M. surname: Kinser fullname: Kinser, J.M. |
BackLink | https://www.ncbi.nlm.nih.gov/pubmed/18252559$$D View this record in MEDLINE/PubMed |
BookMark | eNqF0TtPwzAQB3APRfQBAysDykTFkNbP2BYTqiggVYUBZstJHGqUR4mdgW-Pq5RKIASTJft3p__5xmBQN7UB4AzBGUJQzjme8QRxJAZghCBlscSYD8HYuTcIEWUwOQZDJDDDjMkRuF7aOrf1a-Q3JnKbpvXG-Wir_Say9fdLbysTdW6Hnxbr9dSdgKNCl86c7s8JeFnePi_u49Xj3cPiZhVnRDIfS4JzTVEmdQJZVhCITAJTYaiguSgyolmRC8rSAuc0xUIWiaYihMMJz1CCNJmAad932zbvXYiiKusyU5a6Nk3nlERSIsYY_1dyQsLgkOMgL_-UWGBBoGD_w0QyFGIGeLGHXVqZXG1bW-n2Q339dQDzHmRt41xrCpVZr71tat9qWyoE1W6DimPVbzBUXP2oODT9xZ731hpjDm7_-Ak2pqGF |
CODEN | ITNNEP |
CitedBy_id | crossref_primary_10_1109_TNN_2002_804229 crossref_primary_10_1016_j_neuroimage_2008_12_021 crossref_primary_10_1007_s11063_007_9057_6 crossref_primary_10_1016_j_imavis_2009_06_007 crossref_primary_10_1016_j_neucom_2008_12_008 crossref_primary_10_1007_s11831_016_9182_3 crossref_primary_10_1016_j_neucom_2006_08_006 crossref_primary_10_1109_TNNLS_2013_2293775 crossref_primary_10_1109_TSMCB_2012_2221695 crossref_primary_10_1109_TNN_2009_2029858 crossref_primary_10_1007_s11063_006_9030_9 crossref_primary_10_1016_j_engappai_2023_107101 crossref_primary_10_1109_TNN_2005_844902 crossref_primary_10_1016_j_chaos_2006_01_097 crossref_primary_10_1016_j_robot_2013_12_004 crossref_primary_10_1016_j_dsp_2011_02_004 crossref_primary_10_1016_j_asoc_2012_05_007 crossref_primary_10_1016_j_neucom_2014_09_012 crossref_primary_10_1007_s11831_018_9253_8 crossref_primary_10_1016_j_neucom_2008_07_010 crossref_primary_10_3724_SP_J_1004_2008_01169 crossref_primary_10_1109_72_761715 crossref_primary_10_1007_s00521_013_1506_8 crossref_primary_10_1016_j_neucom_2009_04_005 crossref_primary_10_1109_TNNLS_2019_2905113 crossref_primary_10_1016_j_patrec_2004_03_005 crossref_primary_10_1016_j_knosys_2016_08_027 crossref_primary_10_1016_j_neucom_2012_12_030 crossref_primary_10_1109_TSMCB_2007_903369 |
Cites_doi | 10.1162/neco.1990.2.3.293 10.1364/AO.33.006239 10.1364/OL.18.001253 10.1007/978-3-642-70210-5_20 10.1073/pnas.87.18.7200 10.1016/0893-6080(91)90026-2 10.1109/72.761715 10.1117/1.600797 |
ContentType | Journal Article |
DBID | RIA RIE AAYXX CITATION NPM 7SC 8FD JQ2 L7M L~C L~D 7X8 7SP F28 FR3 KR7 |
DOI | 10.1109/72.761718 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef PubMed Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional MEDLINE - Academic Electronics & Communications Abstracts ANTE: Abstracts in New Technology & Engineering Engineering Research Database Civil Engineering Abstracts |
DatabaseTitle | CrossRef PubMed Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional MEDLINE - Academic Civil Engineering Abstracts Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | PubMed Computer and Information Systems Abstracts Computer and Information Systems Abstracts MEDLINE - Academic Civil Engineering Abstracts |
Database_xml | – sequence: 1 dbid: NPM name: PubMed url: https://proxy.k.utb.cz/login?url=http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: RIE name: IEEE Electronic Library (IEL) - NZ url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Anatomy & Physiology Computer Science |
EndPage | 606 |
ExternalDocumentID | 18252559 10_1109_72_761718 761718 |
Genre | Journal Article |
GroupedDBID | --- -~X .DC 0R~ 29I 4.4 53G 5GY 5VS 6IK 97E AAJGR AASAJ AAWTH ABAZT ABJNI ABQJQ ABVLG ACGFS AETIX AGQYO AGSQL AHBIQ AI. AIBXA ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD F5P HZ~ H~9 ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS S10 TAE TN5 VH1 AAYOK AAYXX CITATION RIG NPM 7SC 8FD JQ2 L7M L~C L~D 7X8 7SP F28 FR3 KR7 |
ID | FETCH-LOGICAL-c395t-932da41c9a605cf301e60b8e484d8fc3a5fd845bf2d4b289f6a48559267c161a3 |
IEDL.DBID | RIE |
ISSN | 1045-9227 |
IngestDate | Fri Jul 11 02:32:21 EDT 2025 Thu Jul 10 22:47:00 EDT 2025 Tue Aug 05 11:19:27 EDT 2025 Mon Jul 21 11:04:33 EDT 2025 Thu Apr 03 06:58:34 EDT 2025 Tue Jul 01 02:44:28 EDT 2025 Thu Apr 24 23:08:22 EDT 2025 Tue Aug 26 21:00:24 EDT 2025 |
IsPeerReviewed | false |
IsScholarly | false |
Issue | 3 |
Language | English |
License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c395t-932da41c9a605cf301e60b8e484d8fc3a5fd845bf2d4b289f6a48559267c161a3 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Article-1 ObjectType-Feature-2 |
PMID | 18252559 |
PQID | 26951161 |
PQPubID | 23500 |
PageCount | 3 |
ParticipantIDs | proquest_miscellaneous_26951161 crossref_citationtrail_10_1109_72_761718 pubmed_primary_18252559 proquest_miscellaneous_919915557 proquest_miscellaneous_733252072 proquest_miscellaneous_28283085 crossref_primary_10_1109_72_761718 ieee_primary_761718 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 1900 |
PublicationDate | 1999-00-00 |
PublicationDateYYYYMMDD | 1999-01-01 |
PublicationDate_xml | – year: 1999 text: 1999-00-00 |
PublicationDecade | 1990 |
PublicationPlace | United States |
PublicationPlace_xml | – name: United States |
PublicationTitle | IEEE transactions on neural networks |
PublicationTitleAbbrev | TNN |
PublicationTitleAlternate | IEEE Trans Neural Netw |
PublicationYear | 1999 |
Publisher | IEEE |
Publisher_xml | – name: IEEE |
References | ref8 ref7 ref3 ref6 ref5 kinser (ref4) 1996; 35 ref2 ref1 |
References_xml | – ident: ref1 doi: 10.1162/neco.1990.2.3.293 – ident: ref3 doi: 10.1364/AO.33.006239 – ident: ref2 doi: 10.1364/OL.18.001253 – ident: ref6 doi: 10.1007/978-3-642-70210-5_20 – ident: ref8 doi: 10.1073/pnas.87.18.7200 – ident: ref7 doi: 10.1016/0893-6080(91)90026-2 – ident: ref5 doi: 10.1109/72.761715 – volume: 35 start-page: 2158 year: 1996 ident: ref4 article-title: stabilized input with a feedback pulse-coupled neural network publication-title: Opt Eng doi: 10.1117/1.600797 |
SSID | ssj0014506 |
Score | 1.3949955 |
Snippet | A pulse coupled neural network (PCNN) can run mazes nondeterministically (taking all possible paths) with constant time per step. Thus, when a signal emerges,... Taking the subject of maze running, finding the shortest path and doing so with minimum effort is attempted. The preferred approach for this problem is to use... |
SourceID | proquest pubmed crossref ieee |
SourceType | Aggregation Database Index Database Enrichment Source Publisher |
StartPage | 604 |
SubjectTerms | Bioinformatics Biotechnology Inspection Intelligent networks Missiles Neural networks Neurons Pixel Shortest-path problems Steady-state |
Title | Finding the shortest path in the shortest time using PCNN's |
URI | https://ieeexplore.ieee.org/document/761718 https://www.ncbi.nlm.nih.gov/pubmed/18252559 https://www.proquest.com/docview/26951161 https://www.proquest.com/docview/28283085 https://www.proquest.com/docview/733252072 https://www.proquest.com/docview/919915557 |
Volume | 10 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9NAEB61OZUDpSnQ8CgrhICLE2cftlecqoioQiLiQKXerH25VBQHYecAv56ZtRNo1VSVfLBWs9J6H97v2535BuCNkFbk2gakJUYn0mRZYithyWlcSY-P0BSc_HmRnZ7JT-fqvNfZjrEwIYTofBbG9Brv8v3SreiobIKUG3-lu7CLvK0L1dpcGEgV02giuVCJ5jzvRYSmqZ7kfNxVvLb1xFwq22Fl3F7m-13cdhNVCcmr5Pt41dqx-3NDs_GeLX8ED3uYyU66eXEAO6EewuFJjRT7x2_2lkXHz3iiPoT9dWYH1i_0ITz4T6bwED7ML2PsC0OwyJpv5J7btIxyGbPL-nohpapn5Et_wb7MFot3zWM4m3_8OjtN-qQLiRNatQniOW_k1GmDRMdVuP5DltoiyEL6onLCqMoXUtmKe2mRrVWZIX0ZzbPcIXo04gkM6mUdjoAFj2jBF7YyykjunRE2nTpvqqk1xqR-BO_X41G6XpGcEmNclZGZpLrMedn13Aheb0x_djIctxkNqec3BuvSV-sxLnHp0H2IqcNy1ZQ8Q3iJbb7DoiB9tEKNgG2xyIXgiqc5326iybtMKZWP4Gk3xf59AvJz4nTPbm35c9jrRCLowOcFDNpfq_ASIVBrj-Pk_wvFBgOV |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1Lb9NAEB5BOUAPLaRQwqsrhICLU2cftlecqoooQBtxaKXerH0ZKsBBtXNofz0zaydQ1CAkH6zVWFrv8_t2Z74BeCWkFbm2AWmJ0Yk0WZbYSlhyGlfS4yM0BScfz7Lpqfx4ps56ne0YCxNCiM5nYUSv8S7fz92Cjsr2kXLjUnob7uC2r3gXrLW6MpAqJtJEeqESzXneywiNU72f81H36bXNJ2ZTWQ8s4wYz2e4it5uoS0h-Jd9Gi9aO3NVfqo3_Wff7sNUDTXbQjYwHcCvUA9g5qJFk_7hkr1l0_Yxn6gPYXuZ2YP1UH8DmH0KFO_Buch6jXxjCRdZ8JQfdpmWUzZid19cLKVk9I2_6L-zz4Wz2pnkIp5P3J4fTpE-7kDihVZsgovNGjp02SHVchStAyFJbBFlIX1ROGFX5QipbcS8t8rUqM6Qwo3mWO8SPRjyCjXpeh8fAgke84AtbGWUk984Im46dN9XYGmNSP4S3y_4oXa9JTqkxvpeRm6S6zHnZtdwQXq5Mf3ZCHDcZDajlVwbL0r1lH5c4eehGxNRhvmhKniHAxDr_w6IghbRCDYGtsciF4IqnOV9vosm_TCmVD2G3G2K_fwEZOrG6JzfWfA_uTk-Oj8qjD7NPT-FeJxlBxz_PYKO9WITnCIha-yJOhF9u7Qbf |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Finding+the+shortest+path+in+the+shortest+time+using+PCNN%27s&rft.jtitle=IEEE+transactions+on+neural+networks&rft.au=Caulfield%2C+H+J&rft.au=Kinser%2C+J+M&rft.date=1999&rft.issn=1045-9227&rft.volume=10&rft.issue=3&rft.spage=604&rft.epage=606&rft_id=info:doi/10.1109%2F72.761718&rft.externalDBID=NO_FULL_TEXT |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1045-9227&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1045-9227&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1045-9227&client=summon |