- 1、本文档共5页,可阅读全部内容。
- 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
基于voronoi图法的移动机器人路径规划文档
3 3 Vol. 3 No. 3
2005 7 CHINESE JOU RNAL O CONSTRUCTION MACHINERY Jul. 2005
Voronoi
许松清, 吴海彬, 林 宜, 高洪张, 陈天炎
( , 350002)
: . , Voronoi
, .
, Dijkstra , .
, . T I TMS320L 2407A
(DSP) .
: ; ; Voronoi ; Dijkstra
: TP 24
Path planning of mobile robot based on voronoi diagram method
X U Songqing , W U H aibin , LIN Yi , GA O H ongz hang , CH EN Tiany an
( College of M echanical Engineering and Automation, uzhou U niversity, uzhou 350002, China)
Abstract: A path planning method of mobile robot based on random static environments is studied. Based on
environmental map information and use the Voronoi diagram theory, the collisionfree path for mobile robots
running is built. The given start point and object point of mobile robot are linked to this path network accord
ing to a special formula, then the Dijkstra shortest path search algorithm was used to find out the shortest
path from the start point to the object point. inally, the mobile robot was controlled running along the found
shortest path to get to the object position, so, the intelligent obstacle avoidance of mobile robot was achieved.
Whole system uses the TI Co.s T MS320L 2407A digital signal processor( DSP) chip as controller.
Key words: mobile robot; path network; Voronoi diagram; Dijkstra algorithm
, ,
.
. , ,
; ,
, , . [ 1] ,
[2] ,
.Voronoi , ,
, ,
, .
, .
Voronoi G. Voronoi , ,
: ( 2002J016)
: ( 1981- ) , , , .
3 , : Voronoi 337
, ,
[ 3] [4] Voronoi .
[ 5]
Voronoi , ,
, Voronoi ,
, Voronoi . Voronoi
, , .
Voronoi ,
DSP .
, Dijkstra .
1 Vor
文档评论(0)