完整後設資料紀錄
DC 欄位語言
dc.contributor.authorCheng, Pi-Yingen_US
dc.contributor.authorChen, Pin-Jyunen_US
dc.date.accessioned2014-12-08T15:30:40Z-
dc.date.available2014-12-08T15:30:40Z-
dc.date.issued2010en_US
dc.identifier.isbn978-1-4244-6675-7en_US
dc.identifier.issn2153-0858en_US
dc.identifier.urihttp://hdl.handle.net/11536/21891-
dc.description.abstractThis 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.en_US
dc.language.isoen_USen_US
dc.titleThe D plus plus Algorithm: Real-Time and Collision-Free Path-Planning for Mobile Roboten_US
dc.typeArticleen_US
dc.identifier.journalIEEE/RSJ 2010 INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2010)en_US
dc.citation.spage3611en_US
dc.citation.epage3616en_US
dc.contributor.department機械工程學系zh_TW
dc.contributor.departmentDepartment of Mechanical Engineeringen_US
dc.identifier.wosnumberWOS:000287672004078-
顯示於類別:會議論文