{"title":"利用神经网络寻找最短路径","authors":"W. Shen, J. Shen, J. Lallemand","doi":"10.1109/ICAR.1991.240398","DOIUrl":null,"url":null,"abstract":"The authors present a method for finding the shortest trajectory in 2D space by neural networks. To solve effectively the trajectory planning problem with obstacles of arbitrary shape, they propose a neural network to transform the free space into a structured path network characterizing its topological property. The representative of each topological class is then optimized by a cellule network simulating a retraction minimizing the energy of the system. And the shortest one from different classes gives therefore the final solution. This method works well for obstacles of arbitrary shape; it is simulated and tested for 2D trajectory planning tasks, and the experimental results are satisfactory.<<ETX>>","PeriodicalId":356333,"journal":{"name":"Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Finding the shortest path by use of neural networks\",\"authors\":\"W. Shen, J. Shen, J. Lallemand\",\"doi\":\"10.1109/ICAR.1991.240398\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors present a method for finding the shortest trajectory in 2D space by neural networks. To solve effectively the trajectory planning problem with obstacles of arbitrary shape, they propose a neural network to transform the free space into a structured path network characterizing its topological property. The representative of each topological class is then optimized by a cellule network simulating a retraction minimizing the energy of the system. And the shortest one from different classes gives therefore the final solution. This method works well for obstacles of arbitrary shape; it is simulated and tested for 2D trajectory planning tasks, and the experimental results are satisfactory.<<ETX>>\",\"PeriodicalId\":356333,\"journal\":{\"name\":\"Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAR.1991.240398\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Fifth International Conference on Advanced Robotics 'Robots in Unstructured Environments","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAR.1991.240398","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Finding the shortest path by use of neural networks
The authors present a method for finding the shortest trajectory in 2D space by neural networks. To solve effectively the trajectory planning problem with obstacles of arbitrary shape, they propose a neural network to transform the free space into a structured path network characterizing its topological property. The representative of each topological class is then optimized by a cellule network simulating a retraction minimizing the energy of the system. And the shortest one from different classes gives therefore the final solution. This method works well for obstacles of arbitrary shape; it is simulated and tested for 2D trajectory planning tasks, and the experimental results are satisfactory.<>