Learning action models from plan examples using weighted MAX-SAT Export

@article{Yang:2007, abstract = {AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as input. However, building action models from scratch is a difficult and time-consuming task, even for experts. In this paper, we develop an algorithm called ARMS (action-relation modelling system) for automatically discovering action models from a set of successful observed plans. Unlike the previous work in action-model learning, we do not assume complete knowledge of states in the middle of observed plans. In fact, our approach works when no or partial intermediate states are given. These example plans are obtained by an observation agent who does not know the logical encoding of the actions and the full state information between the actions. In a real world application, the cost is prohibitively high in labelling the training examples by manually annotating every state in a plan example from snapshots of an environment. To learn action models, ARMS gathers knowledge on the statistical distribution of frequent sets of actions in the example plans. It then builds a weighted propositional satisfiability (weighted MAX-SAT) problem and solves it using a MAX-SAT solver. We lay the theoretical foundations of the learning problem and evaluate the effectiveness of ARMS empirically.}, author = {Yang, Q. and Wu, K. and Jiang, Y.}, citeulike-article-id = {4904156}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/j.artint.2006.11.005}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0004370206001408}, doi = {10.1016/j.artint.2006.11.005}, issn = {00043702}, journal = {Artificial Intelligence}, keywords = {action-planning, learning, partially-observable, phd}, month = {February}, number = {2-3}, pages = {107--143}, posted-at = {2009-06-19 13:31:19}, priority = {4}, title = {Learning action models from plan examples using weighted MAX-SAT}, url = {http://dx.doi.org/10.1016/j.artint.2006.11.005}, volume = {171}, year = {2007} }

TY - JOUR ID - Yang:2007 L3 - citeulike-article-id:4904156 N2 - AI planning requires the definition of action models using a formal action and plan description language, such as the standard Planning Domain Definition Language (PDDL), as input. However, building action models from scratch is a difficult and time-consuming task, even for experts. In this paper, we develop an algorithm called ARMS (action-relation modelling system) for automatically discovering action models from a set of successful observed plans. Unlike the previous work in action-model learning, we do not assume complete knowledge of states in the middle of observed plans. In fact, our approach works when no or partial intermediate states are given. These example plans are obtained by an observation agent who does not know the logical encoding of the actions and the full state information between the actions. In a real world application, the cost is prohibitively high in labelling the training examples by manually annotating every state in a plan example from snapshots of an environment. To learn action models, ARMS gathers knowledge on the statistical distribution of frequent sets of actions in the example plans. It then builds a weighted propositional satisfiability (weighted MAX-SAT) problem and solves it using a MAX-SAT solver. We lay the theoretical foundations of the learning problem and evaluate the effectiveness of ARMS empirically. IS - 2-3 JF - Artificial Intelligence SN - 00043702 EP - 143 TI - Learning action models from plan examples using weighted MAX-SAT VL - 171 SP - 107 KW - action-planning KW - learning KW - partially-observable KW - phd AU - Yang, Q AU - Wu, K AU - Jiang, Y PY - 2007/02// UR - http://dx.doi.org/10.1016/j.artint.2006.11.005 ER -