Discovering Underlying Plans Based on Shallow Models

Author:

Zhuo Hankz Hankui1ORCID,Zha Yantian2,Kambhampati Subbarao2,Tian Xin1

Affiliation:

1. Sun Yat-Sen University, Guangzhou, China

2. Arizona State University, Tempe, USA

Abstract

Plan recognition aims to discover target plans (i.e., sequences of actions) behind observed actions, with history plan libraries or action models in hand. Previous approaches either discover plans by maximally “matching” observed actions to plan libraries, assuming target plans are from plan libraries, or infer plans by executing action models to best explain the observed actions, assuming that complete action models are available. In real-world applications, however, target plans are often not from plan libraries, and complete action models are often not available, since building complete sets of plans and complete action models are often difficult or expensive. In this article, we view plan libraries as corpora and learn vector representations of actions using the corpora; we then discover target plans based on the vector representations. Specifically, we propose two approaches, DUP and RNNPlanner, to discover target plans based on vector representations of actions. DUP explores the EM-style (Expectation Maximization) framework to capture local contexts of actions and discover target plans by optimizing the probability of target plans, while RNNPlanner aims to leverage long-short term contexts of actions based on RNNs (Recurrent Neural Networks) framework to help recognize target plans. In the experiments, we empirically show that our approaches are capable of discovering underlying plans that are not from plan libraries without requiring action models provided. We demonstrate the effectiveness of our approaches by comparing its performance to traditional plan recognition approaches in three planning domains. We also compare DUP and RNNPlanner to see their advantages and disadvantages.

Funder

Guangdong Province Key Laboratory of Big Data Analysis and Processing

Guangdong special branch plans young talent with scientific and technological innovation, Pearl River Science and Technology New Star of Guangzhou

National Natural Science Foundation of China

ONR

AFOSR

Guangdong Natural Science Fund for Distinguished Young Scholars

NASA

Publisher

Association for Computing Machinery (ACM)

Subject

Artificial Intelligence,Theoretical Computer Science

Cited by 8 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Multi-Task Reinforcement Learning with Cost-based HTN Planning;2024 5th International Conference on Computer Engineering and Application (ICCEA);2024-04-12

2. Large-Scale Electroplating Scheduling: A Hierarchical Temporal Planning Approach;Lecture Notes in Computer Science;2024

3. Leveraging Imperfect Explanations for Plan Recognition Problems;Explainable and Transparent AI and Multi-Agent Systems;2023

4. Gradient-based mixed planning with symbolic and numeric action parameters;Artificial Intelligence;2022-12

5. Meta-learning meets the Internet of Things: Graph prototypical models for sensor-based human activity recognition;Information Fusion;2022-04

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3