日本ロボット学会誌
Online ISSN : 1884-7145
Print ISSN : 0289-1824
ISSN-L : 0289-1824
ベクトル量子化による決定論的方策地図の不可逆圧縮
上田 隆一深瀬 武小林 祐一新井 民夫神谷 昌吾
著者情報
ジャーナル フリー

2005 年 23 巻 1 号 p. 104-112

詳細
抄録

For real-time decision making of a robot, there is an approach that utilizes the look-up table of the pre-computed result of dynamic programming. The look-up table records appropriate behavior for every situation of the robot and its surroundings. A robot that is installed the look-up table can decide its behavior only with a reference of the table. However, a table is usually too large to be loaded on the memory of usual robots. For the solution of this problem, we have proposed to use vector quantization for compressing the table. In this paper, we evaluate this method quantitatively. Then, we newly introduce an information entropy function that searches an appropriate way of blocking. For simulations and experiments, a look-up table for soccer behavior was created and compressed. As the results, the entropy function could find an appropriate way of blocking and the compression method with the blocking way enable the table to be compressed to 1.5% size.

著者関連情報
© 社団法人 日本ロボット学会
前の記事 次の記事
feedback
Top