A Theoretical Study of Domain-Independent Planning ∗ (2009)
Kutluhan Erol, Dana Nau, V. S. Subrahmanian
In two previous conference papers, we examined how the decidability (?) and complexity (?) of domainindependent planning with STRIPS-style planning operators depends on the nature of the operators....
Using Classical Planners to Solve Nondeterministic Planning Problems (2009)
Ugur Kuter, Dana Nau, Elnatan Reisner, Robert P. Goldman
Researchers have developed a huge number of algorithms to solve classical planning problems. We provide a way to use these algorithms, unmodified, to generate strong-cyclic solutions in...
Combining Domain-Independent Planning and HTN Planning: The Duet Planner (2009)
Alfonso Gerevini, Ugur Kuter, Dana Nau, Ro Saetti, Nathaniel Waisbrot
Abstract. Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some of the existing...
Planning for Interactions among Autonomous Agents (2009)
Tsz-chiu Au, Ugur Kuter, Dana Nau
Abstract. AI planning research has traditionally focused on offline planning for static single-agent environments. In environments where an agent needs to plan its interactions with other autonomous...
Combining Domain-Independent Planning and HTN Planning: The Duet Planner ∗ (2009)
Alfonso Gerevini, Ugur Kuter, Dana Nau, Ro Saetti, Nathaniel Waisbrot
Despite the recent advances in planning for classical domains, the question of how to use domain knowledge in planning is yet to be completely and clearly answered. Some of the existing planners use...
Dana Nau, Abdur Chowdhury, Ravi Rajamani
This paper describes an Integrated Product and Process Design (IPPD) tool for the design and manufacture of microwave transmit/receive modules. The tool, which was developed as part of a contract...
Probabilistic Go Theories (2008)
Austin Parker, Fusun Yaman, Dana Nau, V. S. Subrahmanian
There are numerous cases where we need to reason about vehicles whose intentions and itineraries are not known in advance to us. For example, Coast Guard agents tracking boats don’t always know...
Dana Nau, Tsz-chiu Au, Okhtay Ilghami, Ugur Kuter, Dan Wu, ...
automated planning tools that also serve as an investigative platform for research on automated planning methods.
Synthesis of Strategies from Interaction Traces (2008)
Au, Tsz-Chiu, Nau, Dana, Kraus, Sarit
We describe how to take a set of interaction traces produced by different pairs of players in a two-player repeated game, and combine them into a composite strategy. We provide an algorithm that, in...
Finding Most Probable Worlds of Probabilistic Logic Programs (2008)
Samir Khuller, Vanina Martinez, Dana Nau, Gerardo Simari, Amy Sliva, V. S. Subrahmanian
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a...
Conditionalization: Adapting Forward-Chaining Planners to Partially Observable Environments (2008)
Ugur Kuter, Dana Nau, Elnatan Reisner
We provide a general way to take forward-chaining planners for classical planning domains and conditionalize them, i.e., adapt them to generate policies for partially observable planning domains. For...
Lehigh University Abstract (2008)
Dana Nau, Ugur Kuter, Dan Wu, Tsz-chiu Au, Fusun Yaman, Okhtay Ilghami, ...
SHOP and SHOP2 are HTN planning systems that were designed with two goals in mind: to investigate some research issues in automated planning, and to provide some simple, practical planning tools....
A Motion Closed World Asumption (2008)
Fusun Yaman, Dana Nau, V. S. Subrahmanian
Yaman et. al. [Yaman et al., 2004] introduce “go theories ” to reason about moving objects. In this paper, we show that this logic often does not allow us to infer that an object is not present...
Applications: Homeland Security CARA: A Cultural-Reasoning Architecture (2008)
V. S. Subrahmanian, Massimiliano Albanese, María Vanina Martinez, Dana Nau, Diego Reforgiato, Gerardo I. Simari, ...
There’s a constant need to reason about diverse cultures all over the world. For example, the US military might wish to build cultural models of different tribes on the Pakistan-Afghanistan border...
Probabilistic Go Theories (2008)
Austin Parker, Fusun Yaman, Dana Nau, V. S. Subrahmanian
There are numerous cases where we need to reason about vehicles whose intentions and itineraries are not known in advance to us. For example, Coast Guard agents tracking boats don’t always know...
GTE/BBN Technologies RWD Technologies (2008)
Dana Nau, Michael Ball, John Baras, Abdur Chowdhury, Edward Lin, Jeff Meyer, ...
Abstract: A This paper describes the process planning techniques we developed for use in an Integrated Product and Process Design (IPPD) tool for the design and manufacture of microwave...
Is it accidental or intentional? a symbolic approach to the noisy iterated prisoner’s dilemma (2008)
model of a class of multi-agent environments in which agents accumulate payoffs that depend on how successful they are in their repeated interactions with other agents. An important variant of the...
Finding Most Probable Worlds of Probabilistic Logic Programs (2008)
Samir Khuller, Vanina Martinez, Dana Nau, Gerardo Simari, Amy Sliva, V. S. Subrahmanian
Abstract. Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some interesting applications where we are interested in finding a...
Fusun Yaman, Dana Nau, V. S. Subrahmanian
There are numerous applications such as air traffic management, cellular phone location tracking, and vehicle protection systems where there is a critical need to reason about moving objects. In this...
ABSTRACT Measuring the Performance of Automated Planning Systems (2008)
In this paper, we describe existing performance measures for automated planning algorithms, and discuss the limitations and biases inherent in those performance measures. We point out the importance...
These slides are based in part on slides from (2008)
Craig Knoblock, Jose Luis Ambite, Craig Knoblock, Jose Luis Ambite, Craig Knoblock, José Luis Ambite, ...
The material in these notes is copyrighted by its respective authors. It does not count as published. For more information on ICAPS, please visit www.icaps-conference.org. Planning on the Web
Jeff Meyer, Michael Ball, John Baras, Abdur Chowdhury, Edward Lin, Dana Nau, ...
This paper describes the development of a process planning module for an integrated product and process design (IPPD) tool which automates the design and manufacture of microwave modules....
lanning sysfems in f-he real world (2008)
Although game-tree search techniques work well in perfect-information games such as chess, checkers, and Othello, diff-culties arise in adapting them to imperfect-information games such as bridge. In...
Ugur Kuter, Dana Nau, Elnatan Reisner
We provide a general way to take forward-chaining planners for classical planning domains and conditionalize them, i.e., adapt them to generate policies for partially observable planning domains. For...
Process Planning in Microwave Module Production (2007)
Dana Nau, Edward Lin, Jeff Meyer, Michael Ball, John Baras, ...
This paper describes the process planning techniques we developed for us in an integrated product and process design (IPPD) tool for the design and manufacture of microwave transmit/receive modules....
Using MRSEVs to Develop Machining Alternatives (2007)
Dana Nau, Satyandra K. Gupta, Thomas R. Kramer, William C. Regli, Guangming Zhang
this paper, we have outlined our approach for generating and evaluating alternative operation sequences for machined parts. The primary goals of our work are as follows: 1. Pushing process...
Matching Problem Features with Task Selection for Better Performance in HTN Planning (2007)
Reiko Tsuneto, James Hendler, Dana Nau
During the planning process, a planner may often have many different options for what kind of plan refinement to perform next (for example, what task or goal to work on next, what operator or method...
Fusun Yaman, Sibel Adali, Dana Nau, Maria L. Sapino
Abstract. Despite the fact that thousands of applications manipulate plans, there has been no work to date on managing large databases of plans. In this paper, we first propose a formal model of plan...
J Urgen Dix, Ugur Kuter, Dana Nau
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...
Computer Bridge: A Big Win for AI Planning 1 (2007)
A computer program that uses AI planning techniques is now the world’s best program for the game of contract bridge. As reported in The New York Times and The Washington Post, this program—a new...
Martti Mntyl, Dana Nau, Jami Shah
Smooth integration of computer-aided design (CAD) and manufacturing (CAM) is vital for companies ' survival in the present competitive marketplace. One key component in this effort is the...
Matching Problem Features with Task Selection (2007)
For Better Performance, Reiko Tsuneto, James Hendler, Dana Nau
During the planning process, a planner may often have many different options for what kind of plan refinement to perform next (for example, what task or goal to work on next, what operator or method...
Dana Nau, Ugur Kuter, Dan Wu, Tsz-chiu Au, Fusun Yaman, Okhtay Ilghami, ...
SHOP and SHOP2 are HTN planning systems that were designed with two goals in mind: to investigate some research issues in automated planning, and to provide some simple, practical planning tools....
In this paper, we describe existing performance measures for automated planning algorithms, and discuss the limitations and biases inherent in those performance measures. We point out the importance...
Information Gathering During Planning for Web Service Composition (2006)
Kuter, Ugur, Sirin, Evren, Nau, Dana, Parsia, Bijan, Hendler, James
Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service ontologies. Many of the...
PRA: Massively Parallel Heuristic Search (2006)
Evett, Matthew, Hendler, James, Mahanti, Ambuj, Nau, Dana
This paper describes a variant of A* search designed to run on the massively parallel SIMD Connection Machine. The algorithm is designed to run in a limited memory by use of a retraction technique...
WFS + Branch and Bound = Stable Models (2006)
Subrahmanian, V. S., Nau, Dana, Vago, C.
Though the semantics of non-monotonic logic programming has been studied extensively, relatively little work has been done on operational aspects of these semantics. This paper develops techniques to...
Forward-Chaining Planning in Nondeterministic Domains (2006)
This paper presents a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work in nondeterministic...
Accident or intention: That is the question (in the noisy iterated prisoner’s dilemma (2006)
This paper focuses on the Noisy Iterated Prisoner’s Dilemma, a version of the Iterated Prisoner’s Dilemma (IPD) in which there is a nonzero probability that a “cooperate” action will...
Accident or Intention: That Is the Question (in the Noisy Iterated Prisoner's Dilemma) (2006)
This paper focuses on the Noisy Iterated Prisoner's Dilemma, a version of the Iterated Prisoner's Dilemma (IPD) in which there is a nonzero probability that a "cooperate" action...
Fusun Yaman, Dana Nau, V. S. Subrahmanian
There are numerous applications where we need to ensure that multiple moving objects are sufficiently far apart. Furthermore, in many moving object domains, there is positional indeterminacy — we...
Web Service Composition with Volatile Information (2005)
Tsz-chiu Au, Ugur Kuter, Dana Nau
Abstract. In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has...
Game-tree search with combinatorially large belief states (2005)
Austin Parker, Dana Nau, V. S. Subrahmanian
In games such as kriegspiel chess (a chess variant where players have no direct knowledge of the opponent’s pieces ’ locations) the belief state’s sizes dwarf those of other partial information...
Web Service Composition with Volatile Information (2005)
Tsz-chiu Au, Ugur Kuter, Dana Nau
In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has generally...
A hierarchical task-network planner based on symbolic model checking (2005)
Although several approaches have been developed for planning in nondeterministic domains, solving large planning problems is still quite difficult. In this work, we present a novel algorithm, called...
HTN Planning for Web Service Composition Using SHOP2 (2004)
Evren Sirin, Bijan Parsia, Dan Wu, James Hendler, Dana Nau
Automated composition of Web Services can be achieved by using AI planning techniques. Hierarchical Task Network (HTN) planning is especially well-suited for this task. In this paper, we describe how...
Information Gathering During Planning for Web Service Composition (2004)
Ugur Kuter, Evren Sirin, Dana Nau, Bijan Parsia, James Hendler
Abstract. Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service ontologies. Many of...
Information Gathering During Planning for Web Service Composition (2004)
Ugur Kuter, Evren Sirin, Dana Nau, Bijan Parsia, James Hendler
Abstract. Hierarchical Task-Network (HTN) based planning techniques have been applied to the problem of composing Web Services, especially when described using the OWL-S service ontologies. Many of...
Interactive Course-of-Action Planning using Causal Models (2004)
Ugur Kuter, Dana Nau, Don Gossink, John F. Lemmer
Abstract. This paper describes a new technique for interactive planning for coalition operations under conditions of uncertainty. Our approach is based on the use of the Air Force Research...
Fusun Yaman, Dana Nau, V. S. Subrahmanian
There are numerous applications such as air traffic management, cellular phone location tracking, and vehicle protection systems where there is a critical need to reason about moving objects. In this...
Interactive Planning under Uncertainty with Causal Modeling and Analysis (2003)
Kuter, Ugur, Nau, Dana, Lemmer, John F.
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...
Interactive Planning under Uncertainty with Causal Modeling and Analysis (2003)
Kuter, Ugur, Nau, Dana, Lemmer, John F.
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...
Planning in answer set programming using ordered task decomposition (2003)
Jürgen Dix, Ugur Kuter, Dana Nau
In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is an adaptation of...
Planning in answer set programming using ordered task decomposition (2003)
Jürgen Dix, Ugur Kuter, Dana Nau, Jürgen Dix, Ugur Kuter, Dana Nau
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is an adaptation of...
Automatic Web Services Composition Using SHOP2 (2003)
Dan Wu Evren, Dan Wu, Evren Sirin, James Hendler, Dana Nau, Bijan Parsia
Semantic markup of Web services will enable the automation of various kinds of tasks, including discovery, composition, and execution of Web services. We describe how an AI planning system (SHOP2)...
SHOP2: An HTN planning system (2003)
Dana Nau, Okhtay Ilghami, Ugur Kuter, J. William Murdock, Dan Wu, Fusun Yaman
The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel...
Automatic Web services composition using SHOP2 (2003)
Dan Wu, Evren Sirin, James Hendler, Dana Nau, Bijan Parsia
Semantic markup of Web services will enable the automation of various kinds of tasks, including discovery, composition, and execution of Web services. We describe how an AI planning system (SHOP2)...
Planning in answer set programming using ordered task decomposition (2003)
Jürgen Dix, Jürgen Dix, Ugur Kuter, Ugur Kuter, Dana Nau, Dana Nau
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is an adaptation of...
SHOP2: An HTN planning system (2003)
Dana Nau, Okhtay Ilghami, Ugur Kuter, J. William Murdock, Dan Wu, Fusun Yaman
The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel...
Automatic Web services composition using SHOP2 (2003)
Dan Wu, Evren Sirin, James Hendler, Dana Nau, Bijan Parsia
Semantic markup of Web services will enable the automation of various kinds of tasks, including discovery, composition, and execution of Web services. We describe how an AI planning system (SHOP2)...
Automating DAML-S Web Services Composition Using SHOP2 (2003)
Dan Wu, Bijan Parsia, Evren Sirin, James Hendler, And Dana Nau, Dana Nau
The DAML-S Process Model is designed to support the application of AI planning techniques to the automated composition of Web services. SHOP2 is an Hierarchical Task Network (HTN) planner well-suited...
M-Translog-2: A Planning Domain Designed for AIPS-2002 (2002)
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...
M-Translog-2: A Planning Domain Designed for AIPS-2002 (2002)
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...
Total-order planning with partially ordered subtasks (2001)
Dana Nau, Héctor Muñoz-avila, Yue Cao, Amnon Lotem, Steven Mitchell
One of the more controversial recent planning algorithms is the SHOP algorithm, an HTN planning algorithm that plans for tasks in the same order that they are to be executed. SHOP can use...
SHOP and M-SHOP: Planning with Ordered Task Decomposition (2000)
Nau, Dana, Cao, Yue, Lotem, Amnon, Munoz-Avila, Hector
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...
SHOP and M-SHOP: Planning with Ordered Task Decomposition (2000)
Nau, Dana, Cao, Yue, Lotem, Amnon, Munoz-Avila, Hector
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...
Generating and Evaluating Designs and Plans for Microwave Modules (2000)
Dana Nau, Michael Ball, John Baras, Abdur Chowdhury, Edward Lin, Abdur Chowdhury Iitri, ...
This paper describes the process planning techniques we developed for use in an Integrated Product and Process Design (IPPD) tool for the design and manufacture of microwave transmit/receive modules....
Ontology-Based Semantics (2000)
We consider the problem of providing semantics for declarative languages, in a way that would be useful for enabling automated knowledge exchange. If we only have one (first order) language, we can...
Ontology-Based Semantics (2000)
We consider the problem of providing semantics for declarative languages, in a way that would be useful for enabling automated knowledge exchange. If we only have one (first order) language, we can...
Applying Integer Programming to AI Planning (2000)
Thomas Vossen, Michael Ball, Robert H. Smith, Amnon Lotem, Dana Nau
Despite the historical di#erence in focus between AI planning techniques and Integer Programming (IP) techniques, recent research has shown that IP techniques show significant promise in their...
SHOP: Simple Hierarchical Ordered Planner (1999)
Nau, Dana, Cao, Yue, Lotem, Amnon, Munoz-Avia, Hector
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....
SHOP: Simple Hierarchical Ordered Planner (1999)
Nau, Dana, Cao, Yue, Lotem, Amnon, Munoz-Avia, Hector
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....
On the Use of Integer Programming Models in AI Planning (1999)
Vossen, Thomas, Ball, Michael, Lotem, Amnon, Nau, Dana
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...
On the Use of Integer Programming Models in AI Planning (1999)
Vossen, Thomas, Ball, Michael O., Lotem, Amnon, Nau, Dana
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...
Héctor Muñoz-Avila, David W. Aha, Len Breslow, Dana Nau
This paper describes HICAP (Hierarchical Interactive Case-based Architecture for Planning), a general purpose planning architecture that we have developed and applied to assist military commanders...
Using Guidelines to Constrain Interactive Case-Based HTN Planning (1999)
Héctor Muñoz-Avila, Daniel C. Mcfarlane, David W. Aha, Len Breslow, James A. Ballas, Dana Nau
This paper describes HICAP, a general purpose and interactive case-based planning architecture. HICAP is a decision support tool for planning a hierarchical course of action. It integrates a...
Expert Computer Systems for Missile Maintenance. (1998)
Davis,Larry, Roussopoulos,Nick, Nau,Dana, Yeh,Raymond, Kasif,Emily
New paradigms for failure hypothesis formation are considered. An automated maintenance manual is developed and discussed. (Author)
Inferencing in Support of Active Templates (1998)
The primary accomplishments of this project include the following: (1) HICAP is a general purpose planning architecture to assist military commanders with planning NEOs (Noncombatant Evacuation...
Planning With Incomplete Knowledge for the Composition of Web Services (1998)
Sirin, Evern, Hendler, James, Nau, Dana
Web Services is an emerging paradigm in which very loosely coupled software components are published, located, and invoked on the Web as parts of distributed applications. Web Services provide a new...
Interactive Planning under Uncertainty with Casual Modeling and Analysis (1998)
Kuter, Ugur, Nau, Dana, Lemmer, John F.
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...
Automatic Web Services Composition Using SHOP2 (1998)
Wu, Dan, Sirin, Evren, Hendler, James, Nau, Dana, Parsia, Bijan
Semantic markup of Web services will enable the automation of various kinds of tasks, including discovery, composition, and execution of Web services. We describe how an AI planning system (SHOP2)...
Automating DAML-S Web Services Composition Using SHOP2 (1998)
Wu, Dan, Parsia, Bijan, Sirin, Evren, Hendler, James, Nau, Dana
The DAML-S Process Model is designed to support the application of AI planning techniques to the automated composition of Web services. SHOP2 is an Hierarchical Task Network (HTN) planner well-suited...
A Hierarchical Task-Network Planner Based on Symbolic Model Checking (1998)
Kuter, Ugur, Nau, Dana, Pistore, Marco, Traverso, Paolo
Although several approaches have been developed for planning in non-deterministic domains, solving large planning problems is still quite difficult. In this work, we present a novel algorithm, called...
SHOP and M-SHOP: Planning With Ordered Task Decomposition (1998)
Nau, Dana, Cao, Yue, Lotem, Amnon, Munoz-Avila, Hector
SHOP (Simple Hierarchical Ordered Planner) and M-SHOP (Multi-task-list SHOP) are HTN planning algorithms with the following characteristics. SHOP and M-SHOP plan for tasks in the same order that they...
Applications of SHOP and SHOP2 (1998)
Nau, Dana, Au, Tsz-Chiu, Ilghami, Okhtay, Kuter, Ugur, Munoz-Avila, Hector, Murdock, J. W., ...
SHOP and SHOP2 are HTN planning systems that were designed with two goals in mind: to investigate some research issues in automated planning, and to provide some simple, practical planning tools....
Applications of SHOP and SHOP2 (1998)
Nau, Dana, Au, Tsz-Chiu, Ilghami, Okhtay, Kuter, Ugur, Munoz-Avila, Hector, Murdock, J. W., ...
SHOP and SHOP2 are HTN planning systems that were designed with two goals in mind: to investigate some research issues in automated planning, and to provide some simple, practical planning tools....
Web Service Composition With Volatile Information (1998)
Au, Tsz-Chiu, Kuter, Ugur, Nau, Dana
In many Web service composition problems, information may be needed from Web services during the composition process. Existing research on Web service composition (WSC) procedures has generally...
Using Domain-Configurable Search Control for Probabilistic Planning (1998)
We describe how to improve the performance of MDP planning algorithms by modifying them to use the search-control mechanisms of planners such as TLPlan, SHOP2, and TALplanner. In our experiments,...
HTN Planning for Web Service Composition Using SHOP2 (1998)
Sirin, Evren, Parsia, Bijan, Wu, Dan, Hendler, James, Nau, Dana
Automated composition of Web Services can be achieved by using AI planning techniques. Hierarchical Task Network (HTN) planning is especially well-suited for this task. In this paper, we describe how...
Analyzing external conditions to improve the efficiency of htn planning (1998)
Reiko Tsuneto, James Hendler, Dana Nau
One difficulty with existing theoretical work on HTN planning is that it does not address some of the planning constructs that are commonly used in HTN planners for practical applications. Although...
Plan-Refinement Strategies and Search-Space Size (1997)
Reiko Tsuneto, Dana Nau, James Hendler
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which refinement to do next....
Plan-Refinement Strategies and Search-Space Size (1997)
Reiko Tsuneto, Dana Nau, James Hendler
During the planning process, a planner may have many options for refinements to perform on the plan being developed. The planner’s efficiency depends on how it chooses which refinement to do next....
PRA*: Massively Parallel Heuristic Search (1995)
Matthew Evett, Ambuj Mahanti, Dana Nau, James Hendler, James Hendler
In this paper we describe a variant of A* search designed to run on the massively parallel, SIMD Connection Machine (CM-2). The algorithm is designed to run in a limited memory by use of a retraction...
Improvements on a Heuristic Algorithm for Multiple-Query Optimization (1994)
Kyuseok Shim, Timos Sellis, Dana Nau
Multiple-query processing has received a lot of attention recently. The problem arises in many areas, such as extended relational database systems and deductive database systems. In this paper we...
Manufacturing Cell Formation by State-Space Search (1993)
Ghosh, Subrata, Mahanti, Ambuj, Nagi, Rakesh, Nau, Dana
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...
Experiments on Alternatives to Minimax (1993)
Dana Nau, Paul Purdom, Chun-hung Tzeng
In the field of Artificial Intelligence, traditional approaches to choosing moves in games involve the use of the minimax algorithm. However, recent research results indicate that minimaxing may not...