Home >

news ヘルプ

論文・著書情報


タイトル
和文: 
英文:Hill-climbing for a Noisy Potential Field using Information Entropy 
著者
和文: 金 必宰, 中村 慧, 倉林 大輔.  
英文: Piljae Kim, Satoru Nakamura, Daisuke Kurabayashi.  
言語 English 
掲載誌/書名
和文: 
英文:Paladyn. Journal of Behavioral Robotics 
巻, 号, ページ Vol. 2    No. 2    pp. 94-99
出版年月 2011年10月11日 
出版者
和文: 
英文:Versita, co-published with Springer Verlag 
会議名称
和文: 
英文: 
開催地
和文: 
英文: 
公式リンク http://versita.com/pjbr/
 
DOI https://doi.org/10.2478/s13230-011-0020-x
アブストラクト For a robot navigation system used in an unpredictable environment, it is generally e..ective to create a pathway that robots can track for carrying out a given task, such as reaching a goal. In the biological world, ants construct a foraging path using a volatile substance called a pheromone, which has been widely studied and whose characteristics have been used in a transportation network model. When a navigation path is constructed by autonomous agents using this pheromone model, the created potential field can be very noisy, with many local peaks due to the unsynchronized updates of the field. In this paper, a new hill-climbing algorithm is proposed. The algorithm minimizes information entropy and can track dynamic and noisy potential fields. The proposed algorithm is evaluated through a computer simulation.

©2007 Institute of Science Tokyo All rights reserved.