Using the Kohonen topology preserving mapping network for learning the minimal environment representation

S. Najand, Z. Lo, B. Bavarian
{"title":"Using the Kohonen topology preserving mapping network for learning the minimal environment representation","authors":"S. Najand, Z. Lo, B. Bavarian","doi":"10.1109/IJCNN.1992.226979","DOIUrl":null,"url":null,"abstract":"The authors present the application of the Kohonen self-organizing topology-preserving neural network for learning and developing a minimal representation for the open environment in mobile robot navigation. The input to the algorithm consists of the coordinates of randomly selected points in the open environment. No specific knowledge of the size, number, and shape of the obstacles is needed by the network. The parameter selection for the network is discussed. The neighborhood function, adaptation gain, and the number of training sample points have direct effect on the convergence and usefulness of the final representation. The environment dimensions and a measure of environment complexity are used to find approximate bounds and requirements on these parameters.<<ETX>>","PeriodicalId":286849,"journal":{"name":"[Proceedings 1992] IJCNN International Joint Conference on Neural Networks","volume":"315 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1992] IJCNN International Joint Conference on Neural Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IJCNN.1992.226979","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

The authors present the application of the Kohonen self-organizing topology-preserving neural network for learning and developing a minimal representation for the open environment in mobile robot navigation. The input to the algorithm consists of the coordinates of randomly selected points in the open environment. No specific knowledge of the size, number, and shape of the obstacles is needed by the network. The parameter selection for the network is discussed. The neighborhood function, adaptation gain, and the number of training sample points have direct effect on the convergence and usefulness of the final representation. The environment dimensions and a measure of environment complexity are used to find approximate bounds and requirements on these parameters.<>
利用Kohonen拓扑保持映射网络学习最小环境表示
作者提出了Kohonen自组织拓扑保持神经网络在开放环境中学习和开发最小表示的应用。该算法的输入由开放环境中随机选择的点的坐标组成。网络不需要具体了解障碍物的大小、数量和形状。讨论了网络参数的选择。邻域函数、自适应增益和训练样本点的个数直接影响最终表示的收敛性和有用性。使用环境维度和环境复杂性的度量来找到这些参数的近似界限和要求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信