arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1510.00331cs.ROcs.AIstat.ML
收藏

基于多模态层次Dirichlet过程的主动感知

Multimodal Hierarchical Dirichlet Process-based Active Perception

Ritsumeikan University(立命馆大学)

Tadahiro Taniguchi, Toshiaki Takano, Ryo Yoshino

摘要:

在本文中,我们提出了一种主动感知方法识别对象类别的基础上多模态层次狄利克雷过程(MHDP)。MHDP使机器人能够使用多模态信息来形成对象类别,例如,视觉、听觉和触觉信息,可以通过对对象执行动作来观察。然而,对目标对象执行许多动作需要很长时间。在实时场景中,即,当时间有限时,机器人必须确定对于识别目标对象最有效的动作集合。我们提出了一种基于MHDP的主动感知方法,使用信息增益(IG)最大化标准和懒惰的贪心算法。我们表明,IG最大化标准是最佳的意义上说,该标准是相当于最小化的预期Kullback-Leibler分歧之间的最终识别状态和识别状态后的下一组动作。然而,直接计算IG实际上是不可能的。因此,我们通过利用MHDP的一个性质,得到了一个有效的Monte Carlo近似方法。我们还表明,IG作为一个集函数,因为MHDP的图形模型的结构具有次模和非减属性。因此,IG最大化问题被简化为子模块最大化问题。这意味着贪婪和懒惰的贪心算法是有效的,并有一个理论上的理由,他们的表现。我们进行了一个实验,使用上躯干人形机器人和第二个使用合成数据。实验结果表明,该方法使机器人能够选择一组动作,使其能够快速,准确地识别目标物体。结果支持我们的理论结果。

英文摘要:

In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory, and haptic information, which can be observed by performing actions on an object. However, performing many actions on a target object requires a long time. In a real-time scenario, i.e., when the time is limited, the robot has to determine the set of actions that is most effective for recognizing a target object. We propose an MHDP-based active perception method that uses the information gain (IG) maximization criterion and lazy greedy algorithm. We show that the IG maximization criterion is optimal in the sense that the criterion is equivalent to a minimization of the expected Kullback--Leibler divergence between a final recognition state and the recognition state after the next set of actions. However, a straightforward calculation of IG is practically impossible. Therefore, we derive an efficient Monte Carlo approximation method for IG by making use of a property of the MHDP. We also show that the IG has submodular and non-decreasing properties as a set function because of the structure of the graphical model of the MHDP. Therefore, the IG maximization problem is reduced to a submodular maximization problem. This means that greedy and lazy greedy algorithms are effective and have a theoretical justification for their performance. We conducted an experiment using an upper-torso humanoid robot and a second one using synthetic data. The experimental results show that the method enables the robot to select a set of actions that allow it to recognize target objects quickly and accurately. The results support our theoretical outcomes.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑