ICRA'09 Paper Abstract

Close

Paper FrD6.3

Lee, Sang Hyoung (Hanyang University), Suh, Il Hong (Hanyang University)

Bayesian Network-Based Behavior Control for Skilligent Robots

Scheduled for presentation during the Regular Sessions "Learning and Adaptive Systems - IV" (FrD6), Friday, May 15, 2009, 16:10−16:30, Room: 404

2009 IEEE International Conference on Robotics and Automation, May 12 - 17, 2009, Kobe, Japan

This information is tentative and subject to change. Compiled on January 24, 2022

Keywords Behaviour-Based Systems, Autonomous Agents, Learning and Adaptive Systems

Abstract

A Skilligent robot must be able to learn skills autonomously to accomplish a task. “Skilligence” is the capacity of the robot to control behaviors reasonably, based on the skills acquired during run-time. Behavior control based on Bayesian networks is used to control reasonable behaviors. To accomplish this, subgoals are first discovered by clustering similar features of state transition tuples, which are composed of current states, actions, and next states. Here, features used in clustering are produced using changes of the states in the state transition tuples. Parameters of Bayesian networks and utility functions are learned separately using state transition tuples belonging to each subgoal. To select the best action while executing a task, the expected utility of each subgoal is calculated by the expected utility function and the robot chooses the action that maximizes expected utility calculated by the maximum expected utility (MEU) function. The MEU function is based on the conditional probabilistic distributions of Bayesian networks and utility functions. We also propose a method for reconstructing learned networks and increasing subgoals by incremental learning.

To show the validities of our proposed methods, a task using Dribbling-Box-Into-a-Goal (DBIG) and Obstacle-Avoidance-While-Dribbling-Box (OAWDB) skills is simulated and experimented.

 

 

Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2022 PaperCept, Inc.
Page generated 2022-01-24  07:12:25 PST  Terms of use