Online belief tracking using regression for contingent planning

被引:12
|
作者
Brafman, Ronen I. [1 ]
Shani, Guy [1 ]
机构
[1] Ben Gurion Univ Negev, Beer Sheva, Israel
关键词
Contingent planning; Partial observability; Non-deterministic planning; Regression; Belief;
D O I
10.1016/j.artint.2016.08.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In online contingent planning under partial observability an agent decides at each time step on the next action to execute, given its initial knowledge of the world, the actions executed so far, and the observation made. Such agents require some representation of their belief state to determine which actions are valid, or whether the goal has been achieved. Efficient maintenance of a belief state is, given its potential exponential size, a key research challenge in this area. In this paper we develop the theory of regression as a useful tool for belief-state maintenance. We provide a formal description of regression, discussing various alternatives and optimization techniques, and analyze its space and time complexity. In particular, we show that, with some care, the regressed formula will contain variables relevant to the current query only, rather than all variables in the problem description. Consequently, under suitable assumptions, the complexity of regression queries is at most exponential in its contextual width. This parameter is always upper bounded by Bonet and Geffner's width parameter, introduced in their state-of-the-art factored belief tracking (FBT) method. In addition, we show how to obtain a poly-sized circuit representation for the online regression formula even with non-deterministic actions. We provide an empirical comparison of regression with FBT-based belief maintenance, showing the power of regression for online belief tracking. We also suggest caching techniques for regression, and demonstrate their value in reducing runtime in current benchmarks. (C) 2016 Elsevier B.V. All rights reserved.
引用
收藏
页码:131 / 152
页数:22
相关论文
共 50 条
  • [1] Computing Contingent Plan Graphs using Online Planning
    Maliah, Shlomi
    Komarnitski, Radimir
    Shani, Guy
    ACM TRANSACTIONS ON AUTONOMOUS AND ADAPTIVE SYSTEMS, 2022, 16 (01)
  • [2] Landmark-based heuristic online contingent planning
    Maliah, Shlomi
    Shani, Guy
    Brafman, Ronen, I
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2018, 32 (05) : 602 - 634
  • [3] Landmark-based heuristic online contingent planning
    Shlomi Maliah
    Guy Shani
    Ronen I. Brafman
    Autonomous Agents and Multi-Agent Systems, 2018, 32 : 602 - 634
  • [4] CONTINGENT PLANNING AS BELIEF SPACE SEARCH
    Kim, Incheol
    Kim, Hyunsik
    ICAART 2011: PROCEEDINGS OF THE 3RD INTERNATIONAL CONFERENCE ON AGENTS AND ARTIFICIAL INTELLIGENCE, VOL 1, 2011, : 694 - 697
  • [5] Domain independent heuristics for online stochastic contingent planning
    Blumenthal, Oded
    Shani, Guy
    ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2024,
  • [6] TRACKING OF QUANTIZED SIGNALS BASED ON ONLINE KERNEL REGRESSION
    Ruiz-Moreno, Emilio
    Beferull-Lozano, Baltasar
    2021 IEEE 31ST INTERNATIONAL WORKSHOP ON MACHINE LEARNING FOR SIGNAL PROCESSING (MLSP), 2021,
  • [7] Comparative criteria for partially observable contingent planning
    Dorin Shmaryahu
    Guy Shani
    Jörg Hoffmann
    Autonomous Agents and Multi-Agent Systems, 2019, 33 : 481 - 517
  • [8] Comparative criteria for partially observable contingent planning
    Shmaryahu, Door
    Shani, Guy
    Hoffmann, Joerg
    AUTONOMOUS AGENTS AND MULTI-AGENT SYSTEMS, 2019, 33 (05) : 481 - 517
  • [9] Unavoidable deadends in deterministic partially observable contingent planning
    Lera Shtutland
    Dorin Shmaryahu
    Ronen I. Brafman
    Guy Shani
    Autonomous Agents and Multi-Agent Systems, 2023, 37
  • [10] Optimizing Parallel Belief Propagation in Junction Trees using Regression
    Zheng, Lu
    Mengshoel, Ole
    19TH ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING (KDD'13), 2013, : 757 - 765