Temporally extended goal recognition in fully observable non-deterministic domain models

被引:0
|
作者
Pereira, Ramon Fraga [1 ]
Fuggitti, Francesco [2 ,3 ,4 ]
Meneguzzi, Felipe [5 ]
De Giacomo, Giuseppe [3 ,6 ]
机构
[1] Univ Manchester, Manchester, England
[2] IBM Res AI, Cambridge, MA USA
[3] Sapienza Univ Rome, Rome, Italy
[4] York Univ, Toronto, ON, Canada
[5] Univ Aberdeen, Aberdeen, Scotland
[6] Univ Oxford, Oxford, England
基金
欧洲研究理事会;
关键词
Automated planning; Goal recognition; Non-deterministic planning; Linear temporal logic;
D O I
10.1007/s10489-023-05087-1
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Goal Recognition is the task of discerning the intended goal that an agent aims to achieve, given a set of goal hypotheses, a domain model, and a sequence of observations (i.e., a sample of the plan executed in the environment). Existing approaches assume that goal hypotheses comprise a single conjunctive formula over a single final state and that the environment dynamics are deterministic, preventing the recognition of temporally extended goals in more complex settings. In this paper, we expand goal recognition to temporally extended goals in Fully Observable Non-Deterministic (fond) planning domain models, focusing on goals on finite traces expressed in Linear Temporal Logic (ltl f) and Pure-Past Linear Temporal Logic (ppltl). We develop the first approach capable of recognizing goals in such settings and evaluate it using different ltl(f) and ppltl goals over six fond planning domain models. Empirical results show that our approach is accurate in recognizing temporally extended goals in different recognition settings.
引用
收藏
页码:470 / 489
页数:20
相关论文
共 50 条
  • [1] Temporally extended goal recognition in fully observable non-deterministic domain modelsTemporally extended goal recognition in FOND planning
    Ramon Fraga Pereira
    Francesco Fuggitti
    Felipe Meneguzzi
    Giuseppe De Giacomo
    [J]. Applied Intelligence, 2024, 54 : 470 - 489
  • [2] Learning partially observable non-deterministic action models
    Rao, Dong-Ning
    Jiang, Zhi-Hua
    Jiang, Yun-Fei
    [J]. Ruan Jian Xue Bao/Journal of Software, 2014, 25 (01): : 51 - 63
  • [3] Causal Bounds and Observable Constraints for Non-deterministic Models
    Ramsahai, Roland R.
    [J]. JOURNAL OF MACHINE LEARNING RESEARCH, 2012, 13 : 829 - 848
  • [4] Compact Policies for Fully-Observable Non-Deterministic Planning as SAT
    Geffner, Tomas
    Geffner, Hector
    [J]. TWENTY-EIGHTH INTERNATIONAL CONFERENCE ON AUTOMATED PLANNING AND SCHEDULING (ICAPS 2018), 2018, : 88 - 96
  • [5] Strong Fully Observable Non-Deterministic Planning with LTL and LTLf Goals
    Camacho, Alberto
    McIlraith, Sheila A.
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2019, : 5523 - 5531
  • [6] Computing Contingent Plans via Fully Observable Non-Deterministic Planning
    Muise, Christian
    Belle, Vaishak
    McIlraith, Sheila A.
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2322 - 2329
  • [7] Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
    D'Ippolito, Nicolas
    Rodriguez, Natalia
    Sardina, Sebastian
    [J]. JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2018, 61 : 593 - 621
  • [9] Towards Fully Observable Non-Deterministic Planning as Assumption-Based Automatic Synthesis
    Sardina, Sebastian
    D'Ippolito, Nicolas
    [J]. PROCEEDINGS OF THE TWENTY-FOURTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI), 2015, : 3200 - 3206
  • [10] Deterministic and non-deterministic stable models
    Sacca, D
    Zaniolo, C
    [J]. JOURNAL OF LOGIC AND COMPUTATION, 1997, 7 (05) : 555 - 579