一种改进的势场法路径规划

Qian Jia, Xingsong Wang
{"title":"一种改进的势场法路径规划","authors":"Qian Jia, Xingsong Wang","doi":"10.1109/CCDC.2010.5498836","DOIUrl":null,"url":null,"abstract":"In this paper, an improved potential field method for mobile robots path planning is proposed with modified attractive and repulsive functions.The attractive function decreases the attractive potential around a goal evidently to ensure that the goal position is the global minimum of the total potential field. The repulsive function builds repulsive potential for an arbitrarily shaped obstacle by discretizing outline of the obstacle with points. Therefore, the workspace of the robot is described more exactly. The convergence of this method is discussed to guarantee its reliability for most cases. The simulation has proved that the new potential method can solve the problem of goals nonreachable with obstacles nearby (GNRON), U-shaped trap, and oscillations. Moreover, this method has a great performance in dynamic path planning where a goal and obstacles are moving.","PeriodicalId":227938,"journal":{"name":"2010 Chinese Control and Decision Conference","volume":"243 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":"{\"title\":\"An improved potential field method for path planning\",\"authors\":\"Qian Jia, Xingsong Wang\",\"doi\":\"10.1109/CCDC.2010.5498836\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an improved potential field method for mobile robots path planning is proposed with modified attractive and repulsive functions.The attractive function decreases the attractive potential around a goal evidently to ensure that the goal position is the global minimum of the total potential field. The repulsive function builds repulsive potential for an arbitrarily shaped obstacle by discretizing outline of the obstacle with points. Therefore, the workspace of the robot is described more exactly. The convergence of this method is discussed to guarantee its reliability for most cases. The simulation has proved that the new potential method can solve the problem of goals nonreachable with obstacles nearby (GNRON), U-shaped trap, and oscillations. Moreover, this method has a great performance in dynamic path planning where a goal and obstacles are moving.\",\"PeriodicalId\":227938,\"journal\":{\"name\":\"2010 Chinese Control and Decision Conference\",\"volume\":\"243 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"23\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Chinese Control and Decision Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCDC.2010.5498836\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Chinese Control and Decision Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCDC.2010.5498836","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

摘要

针对移动机器人路径规划问题,提出了一种改进的势场法,改进了吸引函数和排斥函数。吸引函数明显地减小目标周围的吸引势,以保证目标位置是总势场的全局最小值。该斥力函数通过对障碍物的轮廓进行点离散来建立任意形状障碍物的斥力势。从而更准确地描述了机器人的工作空间。讨论了该方法的收敛性,保证了该方法在大多数情况下的可靠性。仿真结果表明,该方法可以有效地解决目标附近有障碍物、u型陷阱和振荡等问题。此外,该方法在目标和障碍物移动的动态路径规划中具有很好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An improved potential field method for path planning
In this paper, an improved potential field method for mobile robots path planning is proposed with modified attractive and repulsive functions.The attractive function decreases the attractive potential around a goal evidently to ensure that the goal position is the global minimum of the total potential field. The repulsive function builds repulsive potential for an arbitrarily shaped obstacle by discretizing outline of the obstacle with points. Therefore, the workspace of the robot is described more exactly. The convergence of this method is discussed to guarantee its reliability for most cases. The simulation has proved that the new potential method can solve the problem of goals nonreachable with obstacles nearby (GNRON), U-shaped trap, and oscillations. Moreover, this method has a great performance in dynamic path planning where a goal and obstacles are moving.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信