{"title":"利用Kohonen拓扑保持映射网络学习最小环境表示","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":"{\"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}","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}
Using the Kohonen topology preserving mapping network for learning the minimal environment representation
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.<>