二维网格中的移动机器人路径规划

D. Dalalah
{"title":"二维网格中的移动机器人路径规划","authors":"D. Dalalah","doi":"10.5281/ZENODO.1075250","DOIUrl":null,"url":null,"abstract":"A topologically oriented neural network is very\nefficient for real-time path planning for a mobile robot in changing\nenvironments. When using a recurrent neural network for this\npurpose and with the combination of the partial differential equation\nof heat transfer and the distributed potential concept of the network,\nthe problem of obstacle avoidance of trajectory planning for a\nmoving robot can be efficiently solved. The related dimensional\nnetwork represents the state variables and the topology of the robot's\nworking space. In this paper two approaches to problem solution are\nproposed. The first approach relies on the potential distribution of\nattraction distributed around the moving target, acting as a unique\nlocal extreme in the net, with the gradient of the state variables\ndirecting the current flow toward the source of the potential heat. The\nsecond approach considers two attractive and repulsive potential\nsources to decrease the time of potential distribution. Computer\nsimulations have been carried out to interrogate the performance of\nthe proposed approaches.","PeriodicalId":23764,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","volume":"36 1","pages":"220-227"},"PeriodicalIF":0.0000,"publicationDate":"2010-02-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Mobile Robot Path Planning In A 2-Dimentional Mesh\",\"authors\":\"D. Dalalah\",\"doi\":\"10.5281/ZENODO.1075250\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A topologically oriented neural network is very\\nefficient for real-time path planning for a mobile robot in changing\\nenvironments. When using a recurrent neural network for this\\npurpose and with the combination of the partial differential equation\\nof heat transfer and the distributed potential concept of the network,\\nthe problem of obstacle avoidance of trajectory planning for a\\nmoving robot can be efficiently solved. The related dimensional\\nnetwork represents the state variables and the topology of the robot's\\nworking space. In this paper two approaches to problem solution are\\nproposed. The first approach relies on the potential distribution of\\nattraction distributed around the moving target, acting as a unique\\nlocal extreme in the net, with the gradient of the state variables\\ndirecting the current flow toward the source of the potential heat. The\\nsecond approach considers two attractive and repulsive potential\\nsources to decrease the time of potential distribution. Computer\\nsimulations have been carried out to interrogate the performance of\\nthe proposed approaches.\",\"PeriodicalId\":23764,\"journal\":{\"name\":\"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering\",\"volume\":\"36 1\",\"pages\":\"220-227\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-02-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5281/ZENODO.1075250\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Academy of Science, Engineering and Technology, International Journal of Mathematical, Computational, Physical, Electrical and Computer Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5281/ZENODO.1075250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

面向拓扑的神经网络对于移动机器人在变化环境中的实时路径规划是非常有效的。利用递归神经网络,结合热传导偏微分方程和网络的分布势概念,可以有效地解决移动机器人轨迹规划中的避障问题。相关维数网络表示机器人工作空间的状态变量和拓扑结构。本文提出了两种解决问题的方法。第一种方法依赖于分布在运动目标周围的吸引力的势分布,它在网络中充当一个独特的局部极值,状态变量的梯度引导电流流向势热源。第二种方法考虑两个吸引和排斥电位源,以减少电位分布的时间。计算机模拟已经进行,以询问所提出的方法的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Mobile Robot Path Planning In A 2-Dimentional Mesh
A topologically oriented neural network is very efficient for real-time path planning for a mobile robot in changing environments. When using a recurrent neural network for this purpose and with the combination of the partial differential equation of heat transfer and the distributed potential concept of the network, the problem of obstacle avoidance of trajectory planning for a moving robot can be efficiently solved. The related dimensional network represents the state variables and the topology of the robot's working space. In this paper two approaches to problem solution are proposed. The first approach relies on the potential distribution of attraction distributed around the moving target, acting as a unique local extreme in the net, with the gradient of the state variables directing the current flow toward the source of the potential heat. The second approach considers two attractive and repulsive potential sources to decrease the time of potential distribution. Computer simulations have been carried out to interrogate the performance of the proposed approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信