{"title":"D++算法:移动机器人实时无碰撞路径规划","authors":"P. Cheng, Pin-Jyun Chen","doi":"10.1109/IROS.2010.5652124","DOIUrl":null,"url":null,"abstract":"This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially to find a shortest path. In the later of this article, we demonstrated some examples to show that D++ algorithm is very efficient for path-planning and also very practicable on real mobile robot system.","PeriodicalId":420658,"journal":{"name":"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"The D++ algorithm: Real-Time and collision-free path-planning for mobile robot\",\"authors\":\"P. Cheng, Pin-Jyun Chen\",\"doi\":\"10.1109/IROS.2010.5652124\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially to find a shortest path. In the later of this article, we demonstrated some examples to show that D++ algorithm is very efficient for path-planning and also very practicable on real mobile robot system.\",\"PeriodicalId\":420658,\"journal\":{\"name\":\"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 IEEE/RSJ International Conference on Intelligent Robots and Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IROS.2010.5652124\",\"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 IEEE/RSJ International Conference on Intelligent Robots and Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IROS.2010.5652124","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
The D++ algorithm: Real-Time and collision-free path-planning for mobile robot
This paper proposed an improved algorithm that we call “D++” which can be applied to real-time and collision-free path -planning to solve some problems of common methods at present. D++ algorithm combines the Dijkstra's algorithm with sensor-based method so that D++ algorithm can deal with problems of unknown, large, complex, or dynamic environment, and need only local environmental information initially to find a shortest path. In the later of this article, we demonstrated some examples to show that D++ algorithm is very efficient for path-planning and also very practicable on real mobile robot system.