東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Probabilistic topological maps.

Georgia Institute of Technology.

FindBook

Google Book

Amazon

博客來

Probabilistic topological maps.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Probabilistic topological maps./
作者:	Ranganathan, Ananth.
面頁冊數:	184 p.
附註:	Adviser: Frank Dellaert.
Contained By:	Dissertation Abstracts International69-04B.
標題:	Artificial Intelligence. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3308816
ISBN:	9780549558668

Probabilistic topological maps.
Ranganathan, Ananth.

Probabilistic topological maps. - 184 p.

Adviser: Frank Dellaert.

Thesis (Ph.D.)--Georgia Institute of Technology, 2008.

Topological maps are light-weight, graphical representations of environments that are scalable and amenable to symbolic manipulation. Thus, they are well-suited for basic robot navigation applications, and also provide a representational basis for the procedural and semantic information needed for higher-level robotic tasks. However, their widespread use has been impeded in part by the lack of reliable, general purpose algorithms for their construction.

ISBN: 9780549558668Subjects--Topical Terms:

769149
Artificial Intelligence.

Probabilistic topological maps.
LDR:03475nmm 2200337 a 45 001 886300
005 20101007
008 101007s2008 ||||||||||||||||| ||eng d
020 $a 9780549558668
035 $a (UMI)AAI3308816
035 $a AAI3308816
040 $a UMI $c UMI
100 1 $a Ranganathan, Ananth. $3 1057991
245 1 0 $a Probabilistic topological maps.
300 $a 184 p.
500 $a Adviser: Frank Dellaert.
500 $a Source: Dissertation Abstracts International, Volume: 69-04, Section: B, page: 2427.
502 $a Thesis (Ph.D.)--Georgia Institute of Technology, 2008.
520 $a Topological maps are light-weight, graphical representations of environments that are scalable and amenable to symbolic manipulation. Thus, they are well-suited for basic robot navigation applications, and also provide a representational basis for the procedural and semantic information needed for higher-level robotic tasks. However, their widespread use has been impeded in part by the lack of reliable, general purpose algorithms for their construction.
520 $a In this dissertation, I present a probabilistic framework for the construction of topological maps that addresses topological ambiguity, is failure-aware, computationally efficient, and can incorporate information from various sensing modalities. The framework addresses the two major problems of topological mapping, namely topological ambiguity and landmark detection.
520 $a The underlying idea behind overcoming topological ambiguity is that the computation of the Bayesian posterior distribution over the space of topologies is an effective means of quantifying this ambiguity, caused due to perceptual aliasing and environment variability. Since the space of topologies is combinatorial, the posterior on it cannot be computed exactly. Instead, I introduce the concept of Probabilistic Topological Maps (PTMs), a sample-based representation that approximates the posterior distribution over topologies given the available sensor measurements. Sampling algorithms for the efficient computation of PTMs are described.
520 $a The PTM framework can be used with a wide variety of landmark detection schemes under mild assumptions. As part of the evaluation, I describe a novel landmark detection technique that makes use of the notion of "surprise" in measurements that the robot obtains, the underlying assumption being that landmarks are places in the environment that generate surprising measurements. The computation of surprise in a Bayesian framework is described and applied to various sensing modalities for the computation of PTMs.
520 $a The PTM framework is the first instance of a probabilistic technique for topological mapping that is systematic and comprehensive. It is especially relevant for future robotic applications which will need a sparse representation capable of accomodating higher level semantic knowledge. Results from experiments in real environments demonstrate that the framework can accomodate diverse sensors such as camera rigs and laser scanners in addition to odometry. Finally, results are presented using various landmark detection schemes besides the surprise-based one.
590 $a School code: 0078.
650 4 $a Artificial Intelligence. $3 769149
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Robotics. $3 1018454
690 $a 0771
690 $a 0800
690 $a 0984
710 2 $a Georgia Institute of Technology. $3 696730
773 0 $t Dissertation Abstracts International $g 69-04B.
790 $a 0078
790 1 0 $a Dellaert, Frank, $e advisor
791 $a Ph.D.
792 $a 2008
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3308816