Planning based on Dynamic Bayesian Network algorithm Using Dynamic Programming and Variable Elimination

被引:0
|
作者
Jung, Sungmin [1 ]
Moon, Gyubok [1 ]
Kim, Yongjun [1 ]
Oh, Kyungwhan [1 ]
机构
[1] Sogang Univ, Dept Comp Sci & Engn, Seoul 100611, South Korea
关键词
Human-Robot Interaction; Planning; Dynamic Bayesian Networks; Moderated DBN; Machine Repository Pioneer [12;
D O I
暂无
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
According to the development of robot technology, Human-Robot Interaction (HRI) is the field of study highlighted. The study aims to find the goal of human action considering their intention and behavior based on their respective habits. To gain the principle of behavior on the goal by understanding that of human, engineers draw the inference of the result needed from Planning through HRI. In this paper, plan inference for aimed goal is modeled by calculating with probability, what task system performs through the observed behavior. Dynamic Bayesian Network (DBN) uses the probabilistic inference to reveal the relation of data varying according to time. Machine Repository Pioneer data of UCI has proved that accuracy and efficiency of inference is higher than the existing DBN by lowering useless calculation applying the variable elimination method and the concept of dynamic programming for DBN algorithm.
引用
收藏
页码:87 / 92
页数:6
相关论文
共 50 条
  • [41] Optimal caching algorithm based on dynamic programming
    Guo, CJ
    Xiang, Z
    Zhong, YZ
    Long, JD
    INTERNET MULTIMEDIA MANAGEMENT SYSTEMS II, 2001, 4519 : 285 - 295
  • [42] Vehicular delay tolerant network routing algorithm based on trajectory clustering and dynamic Bayesian network
    Jiagao Wu
    Shenlei Cai
    Hongyu Jin
    Linfeng Liu
    Wireless Networks, 2023, 29 : 1873 - 1889
  • [43] A stereo matching using variable windows and dynamic programming
    Dong, WP
    Lee, YS
    Jeong, CS
    AI 2005: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2005, 3809 : 1277 - 1280
  • [44] A hybrid algorithm based on dynamic programming method and discrete particle swarm optimization algorithm for fleet planning
    School of Transportation, Wuhan University of Technology, Wuhan 430000, China
    Harbin Gongcheng Daxue Xuebao, 2006, SUPPL. 2 (288-295):
  • [45] EFFICIENT GOAL PROGRAMMING ALGORITHM USING CONSTRAINT PARTITIONING AND VARIABLE ELIMINATION
    ARTHUR, JL
    RAVINDRAN, A
    MANAGEMENT SCIENCE, 1978, 24 (08) : 867 - 868
  • [46] Multiperiod planning for utility systems using dynamic programming
    Kim, JH
    Lee, MH
    Han, C
    Kim, SH
    You, SH
    COMPUTERS & CHEMICAL ENGINEERING, 1999, 23 : S519 - S522
  • [47] CAPACITY PLANNING USING INTERACTIVE STOCHASTIC DYNAMIC PROGRAMMING
    Nowak, Maciej
    Trzaskalik, Tadeusz
    SOR'13 PROCEEDINGS: THE 12TH INTERNATIONAL SYMPOSIUM ON OPERATIONAL RESEARCH IN SLOVENIA, 2013, : 207 - 212
  • [48] Patient admission planning using Approximate Dynamic Programming
    Peter J. H. Hulshof
    Martijn R. K. Mes
    Richard J. Boucherie
    Erwin W. Hans
    Flexible Services and Manufacturing Journal, 2016, 28 : 30 - 61
  • [49] Patient admission planning using Approximate Dynamic Programming
    Hulshof, Peter J. H.
    Mes, Martijn R. K.
    Boucherie, Richard J.
    Hans, Erwin W.
    FLEXIBLE SERVICES AND MANUFACTURING JOURNAL, 2016, 28 (1-2) : 30 - 61
  • [50] Binocular Vision SLAM Algorithm Based on Dynamic Region Elimination in Dynamic Environment
    Wei T.
    Li X.
    Jiqiren/Robot, 2020, 42 (03): : 336 - 345