東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A theory for comparing robot systems.

University of Illinois at Urbana-Champaign.

FindBook

Google Book

Amazon

博客來

A theory for comparing robot systems.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	A theory for comparing robot systems./
作者:	O'Kane, Jason Matthew.
面頁冊數:	146 p.
附註:	Adviser: Steven M. LaValle.
Contained By:	Dissertation Abstracts International68-11B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3290339
ISBN:	9780549341291

A theory for comparing robot systems.
O'Kane, Jason Matthew.

A theory for comparing robot systems. - 146 p.

Adviser: Steven M. LaValle.

Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.

As robots interact with the physical world, their usefulness depends directly on how effectively they can sense and move through their environments. Unfortunately, sensors provide only limited (and sometimes incorrect) information. In extreme cases, no sensors at all will be available. Therefore, for robots to be useful, they must act effectively in spite of uncertainty about the current state. This reality motivates a careful study of the information requirements of the problems we intend to solve. What sensing and actuation abilities are needed to complete a given task? Are some robot systems provably "more powerful," in terms of the tasks they can complete, than others? Can we find meaningful equivalence classes of robot systems? This thesis presents two related lines of research that make progress toward answering these questions.

ISBN: 9780549341291Subjects--Topical Terms:

626642
Computer Science.

A theory for comparing robot systems.
LDR:03629nam 2200301 a 45 001 856725
005 20100709
008 100709s2007 ||||||||||||||||| ||eng d
020 $a 9780549341291
035 $a (UMI)AAI3290339
035 $a AAI3290339
040 $a UMI $c UMI
100 1 $a O'Kane, Jason Matthew. $3 1023579
245 1 2 $a A theory for comparing robot systems.
300 $a 146 p.
500 $a Adviser: Steven M. LaValle.
500 $a Source: Dissertation Abstracts International, Volume: 68-11, Section: B, page: 7445.
502 $a Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 2007.
520 $a As robots interact with the physical world, their usefulness depends directly on how effectively they can sense and move through their environments. Unfortunately, sensors provide only limited (and sometimes incorrect) information. In extreme cases, no sensors at all will be available. Therefore, for robots to be useful, they must act effectively in spite of uncertainty about the current state. This reality motivates a careful study of the information requirements of the problems we intend to solve. What sensing and actuation abilities are needed to complete a given task? Are some robot systems provably "more powerful," in terms of the tasks they can complete, than others? Can we find meaningful equivalence classes of robot systems? This thesis presents two related lines of research that make progress toward answering these questions.
520 $a First, we introduce a new technique for comparing the power of robot systems based on how they progress through their information spaces, which encapsulate the robots' state uncertainty. The goal is to understand the relative power of different sets of sensors and actuators and to determine which of these sets enable the robot to complete its task. This line of research is inspired by the theory of computation, which has produced similar results for abstract computing machines. The central idea is a dominance relation over robot systems, formalizing the idea that some robots are more powerful than others. This comparison induces a partial order over the set of robot systems. We prove some basic properties of this partial order, show that it is directly related to the robots' ability to complete tasks, and give several examples.
520 $a Second, we apply these ideas to the problem of active, global localization for mobile robots. Sensor systems of varying ability have been proposed and successfully used to complete this task. We probe the lower limits of this range by describing three extremely simple robot models and addressing the active localization problem for each. The robot, whose state includes its position and orientation, moves in a fully known, simply connected polygonal environment. We pose the localization task as a planning problem in the robot's information space. We consider robots equipped with (1) angular and linear odometers, (2) a compass and contact sensor, and (3) an angular odometer and contact sensor. We present localization algorithms for models 1 and 2 and show that no algorithm exists for model 3. An implementation with simulation examples is presented. These three results, combined with the comparison results mention above, allow us to fully classify a set of 15 robot models according to their ability to complete the localization task.
590 $a School code: 0090.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Robotics. $3 1018454
690 $a 0771
690 $a 0984
710 2 $a University of Illinois at Urbana-Champaign. $3 626646
773 0 $t Dissertation Abstracts International $g 68-11B.
790 $a 0090
790 1 0 $a LaValle, Steven M., $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3290339