By Topic

Hierarchical memory structure for the real-time search for action acquisition of an autonomous mobile robot

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Doki, K. ; Aichi Inst. of Technol., Toyota, Japan ; Hayakawa, S. ; Suzuki, T. ; Okuma, S.
more authors

This paper proposes a new memory structure for the real-time search with the computational resource boundary. In the proposed memory, each memory is hierarchically stored based an the frequency recall. Moreover, the number of checked memories is varied based on the available computational resource for the action acquisition in order to treat the trade-off between the computational amount for the memory retrieval and the one of the search. When the search system utilises stored memories, the one with the highest frequency of recall is started checking from. This makes the efficient retrieval possible even if the available computational resource for the memory retrieval is not enough. In this paper, the proposed method is applied to the action acquisition for autonomous mobile robots in the moving obstacles' avoidance problem. Its usefulness is shown through some experimental result's and the verification.

Published in:

Intelligent Control, 2002. Proceedings of the 2002 IEEE International Symposium on

Date of Conference: