نتایج جستجو برای: hierarchical task analysis

تعداد نتایج: 3111523  

1999
S. J. J. Smith D. S. Nau A. Throop

This paper describes the results of applying a modified version of hierarchical task-network (HTN) planning to the problem of declarer play in contract bridge. We represent information about bridge in a task network that is extended to represent multi-agency and uncertainty. Our game-playing procedure uses this task network to generate game trees in which the set of alternative choices is deter...

2009
Tayfun Gökmen Halaç Övünç Çetin Erdem Eser Ekinci Riza Cenk Erdur Oguz Dikenelli

In this paper, we introduce an agent planner architecture that can reduce the basic artifacts of agent planning paradigms, semantic services and business process languages into a common workflow model. These artifacts are then executed by means of a workflow component that the architecture includes. By having a workflow component in an agent infrastructure, various agent programming paradigms i...

1999
Dana S. Nau Yue Cao Amnon Lotem Hector Muñoz-Avila

SHOP (Simple Hierarchical Ordered Planner) is a domain-independent H T N planning system with the following characteristics. • SHOP plans for tasks in the same order that they will later be executed. This avoids some goalinteraction issues that arise in other HTN planners, so that the planning algorithm is relatively simple. • Since SHOP knows the complete world-state at each step of the planni...

Journal: :CoRR 2011
Ilche Georgievski Alexander Lazovik Marco Aiello

Hierarchical Task Network (HTN) planning uses task decomposition to plan for an executable sequence of actions as a solution to a problem. In order to reason effectively, an HTN planner needs expressive domain knowledge. For instance, a simplified HTN planning system such as JSHOP2 uses such expressivity and avoids some task interactions due to the increased complexity of the planning process. ...

2013
Pankaj R. Telang Felipe Meneguzzi Munindar P. Singh

We consider the problem of relating an agent’s internal state (its beliefs and goals) and its social state (its commitments to and from other agents) as a way to develop a comprehensive account of decision making by agents in a multiagent system. We model this problem in terms of hierarchical task networks (HTNs) and show how HTN planning provides a natural representation and reasoning framewor...

1999
Adele E. Howe Eric Dahlman Christoper Hansen Michael Scheetz Anneliese Amschler Andrews

To date, no one planner has demonstrated clearly superior performance. Although researchers have hypothesized that this should be the case, no one has performed a large study to test its limits. In this research, we tested performance of a set of planners to determine which is best on what types of problems. The study included six planners and over 200 problems. We found that performance, as me...

2008
Marc Cavazza Cameron G. Smith Daniel Charlton Li Zhang Markku Turunen Jaakko Hakulinen

In this paper, we describe the development of an Embodied Conversational Agent (ECA) implementing the concept of a companion, i.e. an agent supporting the persistent representation of user activities and dialogue-based communication with the user. This first experiment implements a Health and Fitness companion aimed at promoting a healthier lifestyle. The system operates by generating an ‘ideal...

1994
Subbarao Kambhampati Mark Drummond

Although task reduction (HTN) planning historically preceded partial order (PO) planning, and is understood to be more general than the latter, very little analysis has been done regarding its performance. Part of the reason for this has been the lack of systematic understanding of the functionalities provided by HTN planning over and above that of partial order planning. HTN planning has been ...

2010
Christopher W. Geib Robert P. Goldman

Previous work on the YAPPR plan recognition system provided algorithms for translating conventional HTN plan libraries into lexicalized grammars and treated the problem of plan recognition as one of parsing. To produce these grammars required a fixed bound for any loops within the grammar and a presented a problem for optional actions within HTN plans. In this work we show that well known trans...

2004
William J. Farrell Benjamin Grooters Frank Vetesi

Estimation of the Enemy’s Course of Action (ECOA) is required for assessing enemy intent and mission impact, both of which are key functional components embodied in the Joint Directors of Laboratories (JDL) Level 3 (Threat Refinement) processing description. Most ECOA estimation approaches assume that the set of ECOA hypotheses are enumerated in advance and therefore reduce the problem of ECOA ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید