Finding the shortest path by use of neural networks

W. Shen, J. Shen, J. Lallemand
{"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}
引用次数: 5

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.<>
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
利用神经网络寻找最短路径
提出了一种利用神经网络在二维空间中寻找最短轨迹的方法。为了有效地解决具有任意形状障碍物的轨迹规划问题,他们提出了一种神经网络,将自由空间转化为具有拓扑特性的结构化路径网络。然后通过模拟缩回的蜂窝网络优化每个拓扑类的代表,使系统的能量最小化。不同类别中最短的就是最终解。这种方法适用于任意形状的障碍物;对二维弹道规划任务进行了仿真和测试,实验结果令人满意
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
The minimax principle of mechanics and its application to the optimal control problem for robot manipulators Characteristics and approximations of optimal force distributions in walking machines on rough terrain Marking and manipulation problems in the shoe industry Polynomial solutions for the direct kinematic problem of planar three-degree-of-freedom parallel manipulators A kinematic criterion for the design analysis of manipulator wrist mechanisms
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1