Institutional Login
Welcome!
To use the personalized features of this site, please
log in
or
register
.
If you have forgotten your username or password, we can
help
.
My Menu
Marked Items
Alerts
Order History
Saved Items
All
Favorites
Content Types
All
Publications
Journals
Book Series
Books
Reference Works
Protocols
Subject Collections
Architecture and Design
Behavioral Science
Biomedical and Life Sciences
Business and Economics
Chemistry and Materials Science
Computer Science
Earth and Environmental Science
Engineering
Humanities, Social Sciences and Law
Mathematics and Statistics
Medicine
Physics and Astronomy
Professional and Applied Computing
中文(简体)
中文(繁體)
English
Deutsch
한국어
日本語
Français
Español
العربية
Русский
Book Chapter
Learning Topological Maps from Sequential Observation and Action Data under Partially Observable Environment
Book Series
Lecture Notes in Computer Science
Publisher
Springer Berlin / Heidelberg
ISSN
0302-9743 (Print) 1611-3349 (Online)
Volume
Volume 2417/2002
Book
PRICAI 2002: Trends in Artificial Intelligence
DOI
10.1007/3-540-45683-X
Copyright
2002
ISBN
978-3-540-44038-3
DOI
10.1007/3-540-45683-X_34
Pages
189-210
Subject Collection
Computer Science
SpringerLink Date
Tuesday, January 01, 2002
Add to marked items
Add to shopping cart
Add to saved items
Permissions & Reprints
Recommend this chapter
PDF (407.1 KB)
Free Preview
Learning Topological Maps from Sequential Observation and Action Data under Partially Observable Environment
Takehisa Yairi
3
, Masahito Togami
3
and Koichi Hori
3
(3)
Research Center for Advanced Science and Technology, University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8904, Japan
Abstract
A
map
is an abstract internal representation of an environment for a mobile robot, and how to learn it autonomously is one of the most fundamental issues in the research fields of intelligent robotics and artificial intelligence. In this paper, we propose a
topological
map learning method for mobile robots which constructs a
POMDP
-based discrete state transition model from time-series data of observations and actions. The main point of this method is to find a set of states or nodes of the map gradually so that it minimizes the three types of entropies or uncertainties of the map about “what observations are obtained”, “what actions are available” and “what state transitions are expected”. It is shown that the topological structure of the state transition model is effectively obtained by this method.
Takehisa
Yairi
Email:
yairi@ai.rcast.u-tokyo.ac.jp
Masahito
Togami
Email:
togami@ai.rcast.u-tokyo.ac.jp
Koichi
Hori
Email:
hori@ai.rcast.u-tokyo.ac.jp
Fulltext Preview (Small,
Large
)
References secured to subscribers.
more options
Find
Query Builder
Close
|
Clear
Title (ti)
Summary (su)
Author (au)
ISSN (issn)
ISBN (isbn)
DOI (doi)
And
Or
Not
(
)
* (wildcard)
"" (exact)
Within all content
Within this book series
Within this book
Export this chapter
Export this chapter as
RIS
|
Text
Frequently asked questions
|
General information on journals and books
|
Send us your feedback
|
Impressum
|
Contact
© Springer.
Part of Springer Science+Business Media
Privacy, Disclaimer, Terms and Conditions, © Copyright Information
MetaPress Privacy Policy
Remote Address: 38.107.191.107 • Server: mpweb23
HTTP User Agent: CCBot/1.0 (+http://www.commoncrawl.org/bot.html)