東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Tools and algorithms for mobile robo...

Kriechbaum, Kristopher L.

FindBook

Google Book

Amazon

博客來

Tools and algorithms for mobile robot navigation with uncertain localization.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Tools and algorithms for mobile robot navigation with uncertain localization./
作者:	Kriechbaum, Kristopher L.
面頁冊數:	134 p.
附註:	Source: Dissertation Abstracts International, Volume: 67-10, Section: B, page: 6013.
Contained By:	Dissertation Abstracts International67-10B.
標題:	Engineering, Mechanical. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3236233
ISBN:	9780542904394

Tools and algorithms for mobile robot navigation with uncertain localization.
Kriechbaum, Kristopher L.

Tools and algorithms for mobile robot navigation with uncertain localization. - 134 p.

Source: Dissertation Abstracts International, Volume: 67-10, Section: B, page: 6013.

Thesis (Ph.D.)--California Institute of Technology, 2006.

The ability for a mobile robot to localize itself is a basic requirement for reliable long range autonomous navigation. This thesis introduces new tools and algorithms to aid in robot localization and navigation. I introduce a new range scan matching method that incorporates realistic sensor noise models. This method can be thought of as an improved form of odometry. Results show an order of magnitude of improvement over typical mobile robot odometry. In addition, I have created a new sensor-based planning algorithm where the robot follows the locally optimal path to the goal without exception, regardless of whether or not the path moves towards or temporarily away from the goal. The cost of a path is defined as the path length. This new algorithm, which I call "Optim-Bug", is complete and correct. Finally, I developed a new on-line motion planning procedure that determines a path to a goal that optimally allows the robot to localize itself at the goal. This algorithm is called "Uncertain Bug". In particular, the covariance of the robot's pose estimate at the goal is minimized. This characteristic increases the likelihood that the robot will actually be able to reach the desired goal, even when uncertainty corrupts its localization during movement along path. The robot's path is chosen so that it can use known features in the environment to improve its localization. This thesis is a first step towards bringing the tools of mobile robot localization and mapping together with ideas from sensor-based motion planning.

ISBN: 9780542904394Subjects--Topical Terms:

783786
Engineering, Mechanical.

Tools and algorithms for mobile robot navigation with uncertain localization.
LDR:02455nmm 2200289 4500 001 1828725
005 20071024130544.5
008 130610s2006 eng d
020 $a 9780542904394
035 $a (UMI)AAI3236233
035 $a AAI3236233
040 $a UMI $c UMI
100 1 $a Kriechbaum, Kristopher L. $3 1917612
245 1 0 $a Tools and algorithms for mobile robot navigation with uncertain localization.
300 $a 134 p.
500 $a Source: Dissertation Abstracts International, Volume: 67-10, Section: B, page: 6013.
500 $a Adviser: Joel Burdick.
502 $a Thesis (Ph.D.)--California Institute of Technology, 2006.
520 $a The ability for a mobile robot to localize itself is a basic requirement for reliable long range autonomous navigation. This thesis introduces new tools and algorithms to aid in robot localization and navigation. I introduce a new range scan matching method that incorporates realistic sensor noise models. This method can be thought of as an improved form of odometry. Results show an order of magnitude of improvement over typical mobile robot odometry. In addition, I have created a new sensor-based planning algorithm where the robot follows the locally optimal path to the goal without exception, regardless of whether or not the path moves towards or temporarily away from the goal. The cost of a path is defined as the path length. This new algorithm, which I call "Optim-Bug", is complete and correct. Finally, I developed a new on-line motion planning procedure that determines a path to a goal that optimally allows the robot to localize itself at the goal. This algorithm is called "Uncertain Bug". In particular, the covariance of the robot's pose estimate at the goal is minimized. This characteristic increases the likelihood that the robot will actually be able to reach the desired goal, even when uncertainty corrupts its localization during movement along path. The robot's path is chosen so that it can use known features in the environment to improve its localization. This thesis is a first step towards bringing the tools of mobile robot localization and mapping together with ideas from sensor-based motion planning.
590 $a School code: 0037.
650 4 $a Engineering, Mechanical. $3 783786
650 4 $a Engineering, Robotics. $3 1018454
650 4 $a Artificial Intelligence. $3 769149
690 $a 0548
690 $a 0771
690 $a 0800
710 2 0 $a California Institute of Technology. $3 726902
773 0 $t Dissertation Abstracts International $g 67-10B.
790 1 0 $a Burdick, Joel, $e advisor
790 $a 0037
791 $a Ph.D.
792 $a 2006
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3236233