Now showing items 1-9 of 9

    • Hierarchical Goal Network Planning: Initial Results 

      Shivashankar, Vikas; Kuter, Ugur; Nau, Dana (2011-05-31)
      In applications of HTN planning, repeated problems have arisen from the lack of correspondence between HTN tasks and classical-planning goals. We describe these problems and provide a new Hierarchical Goal Network (HGN) ...
    • HTN Planning in Answer Set Programming 

      Dix, Jürgen; Kuter, Ugur; Nau, Dana (UMIACS, University of Maryland, 2002-05-22)
      In this paper we introduce a formalism for solving Hierarchical Task NEtwork (HTN) Planning using Answer Set Programming (ASP). The ASP paradigm evolved out of the stable semantics for logic programs in recent years and ...
    • Interactive Planning under Uncertainty with Causal Modeling and Analysis 

      Kuter, Ugur; Nau, Dana; Lemmer, John F. (2003-01-21)
      This paper describes a new technique for interactive planning under conditions of uncertainty. Our approach is based on the use of the Air Force Research Laboratory's Causal Analysis Tool (CAT), a system for creating ...
    • M-Translog-2: A Planning Domain Designed for AIPS-2002 

      Wu, Dan; Nau, Dana (2002-10-03)
      This document describes UM-Translog-2, which is an extended version of the UM Translog planning domain. The extensions include some numerical-computation features to make the domain a more realistic model of transpor ...
    • Manufacturing Cell Formation by State-Space Search 

      Ghosh, Subrata; Mahanti, Ambuj; Nagi, Rakesh; Nau, Dana (1993)
      This paper addresses the problem of grouping machines in order to design cellular manufacturing cells, with an objective to minimize intercell flow. This problem is replaced to one of the major aims of group technology ...
    • On the Use of Integer Programming Models in AI Planning 

      Vossen, Thomas; Ball, Michael O.; Lotem, Amnon; Nau, Dana (1999)
      Recent research has shown the promise of using propositional reasoning and search to solve AI planning problems. In this paper, we further explore this area by applying Integer Programming to solve AI planning problems. ...
    • SHOP and M-SHOP: Planning with Ordered Task Decomposition 

      Nau, Dana; Cao, Yue; Lotem, Amnon; Munoz-Avila, Hector (2000-06-17)
      SHOP (Simple Hierarchical Ordered Planner) and M-SHOP (Multi-task-list SHOP) are planning algorithms with the following characteristics. * SHOP and M-SHOP plan for tasks in the same order that they will later be executed. ...
    • SHOP: Simple Hierarchical Ordered Planner 

      Nau, Dana; Cao, Yue; Lotem, Amnon; Munoz-Avia, Hector (1999-03-17)
      SHOP (Simple Hierarchical Ordered Planner) is a domain-independent HTN Planning system with the following characteristics. * SHOP plans for tasks in the same order that they will later be executed. This avoids some of the ...
    • Theoretical and Experimental Analysis of an Evolutionary Social-Learning Game 

      Carr, Ryan; Raboin, Eric; Parker, Austin; Nau, Dana (2012-01-13)
      An important way to learn new actions and behaviors is by observing others, and several evolutionary games have been developed to investigate what learning strategies work best and how they might have evolved. In this paper ...