Probabilistic plan recognition under temporal logic tasks

Wentao Yu, Hao Fang, Daiying Tian

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

In this paper, we consider the plan recognition problem in the real-time strategy game. A probabilistic plan recognition algorithm is proposed to predict the future goals and identify the temporal logic tasks of the non-cooperative agent based on the observations. In order to model the temporal logic tasks, the plan library is composed of the Finite Transition System and Nondeterministic Büchi Automation. Specially, we provide a unified framework to combine the plan recognition and the planning, and propose the probability calculation algorithm to calculate the posterior probability distribution of the goals and tasks. Finally, we verify the effectiveness of the proposed algorithm by the compared simulations.

Original languageEnglish
Title of host publicationProceedings of the 38th Chinese Control Conference, CCC 2019
EditorsMinyue Fu, Jian Sun
PublisherIEEE Computer Society
Pages7635-7640
Number of pages6
ISBN (Electronic)9789881563972
DOIs
Publication statusPublished - Jul 2019
Event38th Chinese Control Conference, CCC 2019 - Guangzhou, China
Duration: 27 Jul 201930 Jul 2019

Publication series

NameChinese Control Conference, CCC
Volume2019-July
ISSN (Print)1934-1768
ISSN (Electronic)2161-2927

Conference

Conference38th Chinese Control Conference, CCC 2019
Country/TerritoryChina
CityGuangzhou
Period27/07/1930/07/19

Keywords

  • Büchi Automation
  • Goal Prediction
  • Linear Temporal Logic
  • Probabilistic Plan Recognition

Fingerprint

Dive into the research topics of 'Probabilistic plan recognition under temporal logic tasks'. Together they form a unique fingerprint.

Cite this