Automating Redesign of Electro-Mechanical Assemblies (2009)
William C. Regli, James Hendler, Dana S. Nau
Automating redesign of electro-mechanical artifacts presents many difficult problems to the developers of intelligent CAD systems. To address this need requires we identify new AI technologies for...
Semantics for hierarchical task-network planning (2009)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Zhiyang Yao, Ra K. Gupta, Dana S. Nau
This document contains the draft version of the following paper: Z. Yao, S.K. Gupta, and D.S. Nau. A geometric algorithm for finding the largest milling cutter. Journal of Manufacturing Processes,...
Using a Feature Algebra for Reasoning about Geometric Feature Interactions* (2009)
Raghu R. Karinthi, Dana S. Nau
( AD generated objects can be defined in terms of the complete geometry of the part. In automated process planning, the geometry is the same, but the meaning associated with this geometric structure...
● You will need to do a term project related to AI planning ◆ Formulate an idea to investigate, and a way to carry out the investigation (either theoretically or experimentally or both) ● I’d...
Derivational Replay in an Universal Classical Planning Framework (2008)
Héctor Muñoz-avila, Dana S. Nau, Tsz-chiu Au
Abstract: The status of plan adaptation has been somewhat controversial in the AI-planning literature, due to a conflict between worst-case complexity analyses (which have led to pessimistic...
Zhiyang Yao, Satyandra K. Gupta, Dana S. Nau
This document contains the draft version of the following paper: Z. Yao, S.K. Gupta, and D. Nau. Algorithms for selecting cutters in multi-part
Abstract Feature-based Similarity Assessment of Solid Models (2008)
This paper presents our initial efforts to develop a systematic approach for assessing the similarity of solid models based on how they will be manufactured. The goal of this work is to develop...
To appear, AAAI-99 Using Planning Graphs for Solving HTN Planning Problems (2008)
Amnon Lotem, Dana S. Nau, James A. Hendler
In this paper we present the GraphHTN algorithm, a hybrid planning algorithm that does Hierarchical Task-Network (HTN) planning using a combination of HTNstyle problem reduction and Graphplan-style...
TOWARD HYBRID VARIANT/GENERATIVE PROCESS PLANNING (2007)
This paper describes our ongoing work on a hybrid approach to process planning, that attempts to combine the best characteristics of both variant and generative process planning while avoiding the...
In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. We dene the A-SHOP algorithm, an agentized adaptation of the SHOP planning...
W. C. Regli, S. K. Gupta, D. S. Nau, Dana S. Nau, Satyandra K. Gupta
Available as CS-TR-3375, UMIACS-TR-94-126, ISR-TR 94-82. The availability oflow-cost computational power is a driving force behind the growing sophistication of CAD software. Tools designed to reduce...
Performance Of IDA* on Trees and Graphs (2007)
Ambuj Mahanti, Subrata Ghosh, Dana S. Nau, Asim K. Pal, Laveen Kanal
We present the following results about IDA* and related algorithms: ffl We show that IDA* is not asymptotically optimal in all of the cases where it was thought to be so. In particular, there are...
Improving the Efficiency of Limited-Memory Heuristic Search (2007)
Subrata Ghosh, Ambuj Mahanti, Dana S. Nau, Address Dana, S. Nau
This paper describes a new admissible tree search algorithm called Iterative Threshold Search (ITS). ITS can be viewed as a much-simplified version of MA* [2], and a generalized version of MREC [15]....
An Application of Distributed Solid Modeling: Feature Recognition (2007)
William C. Regli, Satyandra K. Gupta, Dana S. Nau
The availability of low-cost computational power is a driving force behind the growing sophistication of CAD software. Tools designed to reduce time-consuming build-test-redesign iterations are...
David W. Aha, Leonard A. Breslow, Dana S. Nau, Rosina Weber
Abstract. Some problem-solving tasks are amenable to integrated case retrieval and generative planning techniques. This is certainly true for some decision support tasks, in which a user controls the...
A GEOMETRIC ALGORITHM FOR FINDING THE MAXIMAL CUTTER FOR 2-D MILLING OPERATIONS (2007)
Zhiyang Yao, Ra K. Gupta, Dana S. Nau
ABSTRACT: In this paper, we present a geometric algorithm of finding the maximal cutter for 2-D milling operations. Our algorithm works not only for the common closed pocket problem, but also for the...
Kiran Hebbar, Ioannis Minis, Dana S. Nau
This paper describes EDAPS, an integrated system for designing and planning the manufacture of microwave modules. Microwave modules are complex devices having both electrical and mechanical...
Feature Recognition for Interactive Applications: Exploiting Distributed Resources (2007)
William C. Regli, Satyandra K. Gupta, Dana S. Nau
The availability of low-cost computational power is enabling development of increasingly sophisticated CAD software. Automation of design and manufacturing activities poses many difficult...
Manufacturing-Operation Planning Versus AI Planning (2007)
Dana S. Nau, Satyandra K. Gupta, William C. Regli
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. Many of the issues important to manufacturing engineers have not...
Harvard University, and Industry Manufacturing Feature Instances: Which Ones to Recognize? (2007)
S. K. Gupta, W. C. Regli, D. S. Nau, Satyandra K. Gupta, Dana S. Nau
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
Mihai Ciocoiu, Michael Gruninger, Dana S. Nau
1 In all types of communication, the ability to share information is often hindered because the meaning of information can be drastically affected by the context in which it is viewed and...
Abstract Feature-based Similarity Assessment of Solid Models (2007)
Alexei Elinson, Dana S. Nau, William C. Regli
This paper presents our initial efforts to develop a systematic approach for assessing the similarity of solid models based on how they will be manufactured. The goal of this work is to develop...
Proc. AAAI-94, to appear. An Analysis of Forward Pruning (2007)
Several early game-playing computer programs used forward pruning (i.e., the practice of deliberately ignoring nodes that are believed unlikely to affect a game tree's minimax value), but this...
SiN: Integrating Case-Based Reasoning With Task Decomposition (2007)
Munoz-Avila, Hector, Aha, David W., Nau, Dana S., Weber, Rosina, Breslow, Len, Yaman, Fusun
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate plans given an...
Evaluating Product Machinability for Concurrent Engineering (2006)
Nau, Dana S., Zhang, Guangming, Gupta, Satyandra K., Karinthi, Raghu R.
Decisions made during the design of a machined part can significantly affect the product's cost, quality, and lead time. Thus, in order to address the goals of concurrent engineering, it is important...
A General Approach to Synthesize Problem-Specific Planners (2006)
In this paper, we describe a way to improve the performance of hand-tailorable planners by compiling each domain description into a separate domain-specific planner. We discuss why and when this...
IMPACTing SHOP: Putting an AI Planner into a Multi-Agent Environment (2006)
Dix, Juergen, Munoz-Avila, Hector, Nau, Dana S., Zhang, Lingling
In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. We define the A-SHOP algorithm, an agentized adaptation of the SHOP...
Learning preconditions for planning from plan traces and HTN structure (2005)
Okhtay Ilghami, Dana S. Nau, David W. Aha
Agreat challenge in developing planning systems for practical applications is the difficulty of acquiring the domain information needed to guide such systems. This paper describes a way to learn some...
Learning preconditions for planning from plan traces and HTN structure (2005)
Okhtay Ilghami, Dana S. Nau, Héctor Muñoz-avila, David W. Aha
A great challenge in developing planning systems for practical applications is the difficulty of acquiring the domain information needed to guide such systems. This paper describes a way to learn...
Learning approximate preconditions for methods in hierarchical plans (2005)
Okhtay Ilghami, Dana S. Nau, David W. Aha
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquiring this knowledge...
■ Automated planning technology has become mature enough to be useful in applications that range from game playing to control of space vehicles. In this article, Dana Nau discusses where...
A general approach to synthesize problem-specific planners (2003)
In this paper, we describe a way to improve the performance of hand-tailorable planners by compiling each domain description into a separate domain-specific planner. We discuss why and when this...
IMPACTing SHOP: Putting an AI Planner into a Multi-Agent Environment (2003)
Jürgen Dix, Héctor Muñoz-avila, Dana S. Nau, Lingling Zhang
In this paper we describe a formalism for integrating the SHOP HTN planning sys-tem with the IMPACT multi-agent environment. We define the A-SHOP algorithm, an agentized adaptation of the SHOP...
An HTN Planner That can Reason About Time (2002)
In this paper we present a formalism for explicitly representing time in HTN planning. Actions can have durations and intermediate effects in this formalism. Methods can specify qualitative and...
An HTN Planner That can Reason About Time (2002)
In this paper we present a formalism for explicitly representing time in HTN planning. Actions can have durations and intermediate effects in this formalism. Methods can specify qualitative and...
HTN Planning in Answer Set Programming (2002)
Dix, Jurgen, Kuter, Ugur, Nau, Dana S.
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...
HTN Planning in Answer Set Programming (2002)
Dix, Jurgen, Kuter, Ugur, Nau, Dana S.
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...
Planning in a Multi-Agent Environment: Theory and Practice (2002)
Dix, Juergen, Munoz-Avila, Hector, Nau, Dana S., Zhang, Lingling
We give the theoretical foundations and empirical evaluation of a planning agent, SHOP, performing \htn planning in a multi-agent environment. SHOP is based on \ashop, an agentized version of the...
Planning in a Multi-Agent Environment: Theory and Practice (2002)
Dix, Juergen, Munoz-Avila, Hector, Nau, Dana S., Zhang, Lingling
We give the theoretical foundations and empirical evaluation of a planning agent, SHOP, performing \htn planning in a multi-agent environment. SHOP is based on \ashop, an agentized version of the...
Tsz-chiu Au, Héctor Muñoz-avila, Dana S. Nau
Abstract. In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on...
CaMeL: Learning method preconditions for HTN planning (2002)
A great challenge in using any planning system to solve real-world problems is the difficulty of acquiring the domain knowledge that the system will need. We present a way to address part of this...
Planning in a multiagent environment: Theory and practice (2002)
Jurgen Dix, Hector Munoz-avila, Dana S. Nau, Lingling Zhang
We give the theoretical foundations and empirical evaluation of a planning agent, shop, performing HTN planning in a multi-agent environment. shop is based on A-SHOP, an agentized version of the...
CaMeL: Learning method preconditions for HTN planning (2002)
A great challenge in using any planning system to solve real-world problems is the difficulty of acquiring the domain knowledge that the system will need. We present a way to address part of this...
Tsz-chiu Au, Héctor Muñoz-avila, Dana S. Nau
Abstract. In this paper we present an algorithm called DerUCP, which can be regarded as a general model for plan adaptation using Derivational Analogy. Using DerUCP, we show that previous results on...
A Geometric Algorithm for Finding the Largest Milling Cutter (2001)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular:1. We give a general...
Ontology-based translation / (2001)
Thesis research directed by Dept. of Computer Science.
A Geometric Algorithm for Finding the Largest Milling Cutter (2001)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for 2-D milling operations to be performed using a single cutter. In particular:1. We give a general...
SiN: Integrating Case-Based Reasoning with Task Decomposition (2001)
Héctor Muñoz-avila, David W. Aha, Dana S. Nau, Rosina Weber, Len Breslow, Fusun Yamal
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate plans given an...
SiN: Integrating Case-Based Reasoning with Task Decomposition (2001)
Héctor Muñoz-avila, David W. Aha, Dana S. Nau, Rosina Weber, Len Breslow, Fusun Yaman
This paper describes SiN, a novel case-based planning algorithm that combines conversational case retrieval with generative planning. SiN is provably correct, and can generate plans given an...
IMPACTing SHOP: Foundations for integrating HTN Planning and Multi-Agency (2000)
Munoz-Avila, Hector, Dix, Juergen, Nau, Dana S., Cao, Yue
In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. Our formalism provides an agentized adaptation of the SHOP planning...
IMPACTing SHOP: Foundations for integrating HTN Planning and Multi-Agency (2000)
Munoz-Avila, Hector, Dix, Juergen, Nau, Dana S., Cao, Yue
In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. Our formalism provides an agentized adaptation of the SHOP planning...
A Geometric Algorithm for Finding the Largest Milling Cutter (2000)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for2-D milling operations to be performed using a single cutter. In particular:1. We give a general...
Selecting Flat End Mills for 2-1/2D Milling Operations (2000)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
The size of milling cutter significantly affects the machining time. Therefore, in order to perform milling operations efficiently, we need to select a set of milling cutters with optimal sizes. It...
A Geometric Algorithm for Multi-Part Milling Cutter Selection (2000)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
Mass customization results in smaller batch sizes in manufacturing that require large numbers of setup and tool changes. The traditional process planning that generates plans for one part at a time...
Integrating conversational case retrieval with generative planning (2000)
Munoz-Avila, Hector, Aha, David W., Breslow, Leonard A., Nau, Dana S., Weber, Rosina O.
Some problem-solving tasks are amenable to integrated case retrieval and generative planning techniques. This is certainly true for some decision support tasks, in which a user controls the...
A Geometric Algorithm for Finding the Largest Milling Cutter (2000)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
In this paper, we describe a new geometric algorithm to determine the largest feasible cutter size for2-D milling operations to be performed using a single cutter. In particular:1. We give a general...
Selecting Flat End Mills for 2-1/2D Milling Operations (2000)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
The size of milling cutter significantly affects the machining time. Therefore, in order to perform milling operations efficiently, we need to select a set of milling cutters with optimal sizes. It...
A Geometric Algorithm for Multi-Part Milling Cutter Selection (2000)
Yao, Zhiyang, Gupta, Satyandra K., Nau, Dana S.
Mass customization results in smaller batch sizes in manufacturing that require large numbers of setup and tool changes. The traditional process planning that generates plans for one part at a time...
IMPACTing SHOP: Foundations for integrating HTN Planning and Multi-Agency (2000)
Héctor Muñoz-Avila, Jürgen Dix, Dana S. Nau, Yue Cao
Keywords: HTN-planning, multi-agents In this paper we describe a formalism for integrating the SHOP HTN planning system with the IMPACT multi-agent environment. Our formalism provides an agentized...
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains (2000)
We describe in this paper a new method for extracting knowledge on Hierarchical Task-Network (HTN) planning problems for speeding up the search. This knowledge is gathered by propagating properties...
A Geometric Algorithm For Finding The Maximal Cutter For Milling Operations (2000)
Zhiyang Yao, Satyandra K. Gupta, Ra K. Gupta, Dana S. Nau
: In this paper, we present a geometric algorithm of finding the maximal cutter for 2-D milling operations. Our algorithm works not only for the common closed pocket problem, but also for the general...
Case-Based Reasoning for Decision Making (1998)
Nau, Dana S., Munoz-Avila, Hector
This report describes the goal of the project, advances made towards achieving that goal in the first year and a plan to be followed for the second year. The main goal of the project is to provide a...
A Critical Look at Critics in HTN Planning (1998)
Erol, Kutluhan, Hendler, James A., Nau, Dana S., Tsuneto, Reiko
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have...
Semantics for Hierarchical Task-Network Planning (1998)
Erol, Kutluhan, Hendler, James A., Nau, Dana S.
One big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
CaMeL: Learning Method Preconditions for HTN Planning (1998)
Ilghami, Okhtay, Nau, Dana S., Munoz-Avila, Hector, Aha, David W.
A great challenge in using any planning system to solve real-world problems is the difficulty of acquiring the domain knowledge that the system will need. We present a way to address part of this...
Learning Preconditions for Planning from Plan Traces and HTN Structure (1998)
Ilghami, Okhtay, Nau, Dana S., Munoz-Avila, Hector, Aha, David W.
A great challenge in developing planning systems for practical applications is the difficulty of acquiring the domain information needed to guide such systems. This paper describes a way to learn...
Learning Approximate Preconditions for Methods in Hierarchical Plans (1998)
Ilghami, Okhtay, Munoz-Avila, Hector, Nau, Dana S., Aha, David W.
A significant challenge in developing planning systems for practical applications is the difficulty of acquiring the domain knowledge needed by such systems. One method for acquiring this knowledge...
Control strategies in HTN planning: Theory versus practice (1998)
AI planning techniques are beginning to find use in a number of practical planning domains. However, the backward-chaining and partial-order-planning control strategies traditionally used in AI...
The latest world-championship competition for computer bridge programs was the Baron Barclay World Bridge Computer Challenge, hosted in July 1997 by the American Contract Bridge League. As reported...
Automated Manufacturability Analysis: A Survey (1997)
Corresponding Saty, Ra K. Gupta, Satyandra K. Gupta, Satyandra K. Gupta, William C. Regli, William C. Regli, ...
In the marketplace of the 21st century, there is no place for traditional "over-the-wall" communications between design and manufacturing. In order to "design it right the very first...
Automated Manufacturability Analysis: A Survey (1997)
Corresponding Saty, Ra K. Gupta, Satyandra K. Gupta, Satyandra K. Gupta, William C. Regli, William C. Regli, ...
In the marketplace of the 21st century, there is no place for traditional #over-the-wall" communications between design and manufacturing. In order to #design it right the very #rst time,"...
Integrating Tradeoff Analysis and Plan-Based Evaluation of Designs for Microwave Modules (1996)
Trichur, Vinai S., Ball, Michael O., Baras, John S., Hebbar, Kiran, Minis, Ioannis, Nau, Dana S., ...
Previously, we have described two systems, EDAPS and EXTRA, which support design and process planning for the manufacture of microwave modules, complex devices with both electrical and mechanical...
Complexity Results for HTN Planning (1996)
Kutluhan Erol, James Hendler, Dana S. Nau
Most practical work on AI planning systems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on...
Complexity Results for HTN Planning (1996)
Kutluhan Erol, James Hendler, Dana S. Nau
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on...
A Planning Approach to Declarer Play in Contract Bridge (1995)
Smith, S., Nau, Dana S., Throop, T.
Although game-tree search works well in perfect-information games, it is less suitable for imperfect-information games such as contract bridge. The lack of knowledge about the opponents' possible...
A Planning Approach to Declarer Play in Contract Bridge (1995)
Smith, S., Nau, Dana S., Throop, T.
Although game-tree search works well in perfect-information games, it is less suitable for imperfect-information games such as contract bridge. The lack of knowledge about the opponents' possible...
Feature Recognition for Interactive Applications: Exploiting Distributed Resources (1995)
Regli, William C., Gupta, Satyandra K., Nau, Dana S.
The availability of low-cost computational power is a driving force behind the growing sophistication of CAD software. Tools designed to reduce time-consuming build-test-redesign iterations are...
Feature Recognition for Interactive Applications: Exploiting Distributed Resources (1995)
Regli, William C., Gupta, Satyandra K., Nau, Dana S.
The availability of low-cost computational power is a driving force behind the growing sophistication of CAD software. Tools designed to reduce time-consuming build-test-redesign iterations are...
On the Asymptotic Performance of IDA* (1995)
Mahanti, Ambuj, Ghosh, S., Nau, Dana S., Pal, A. K., Kanal, L.N.
Since best-first search algorithms such as A* require large amounts of memory, they sometimes cannot run to completion, even on problem instances of moderate size. This problem has led to the...
Improving the Efficiency of Limited-Memory Heuristic Search (1995)
Ghosh, Subrata, Mahanti, Ambuj, Nau, Dana S.
This paper describes a new admissible tree search algorithm called Iterative Threshold Search (ITS). ITS can be viewed as a much-simplified version of MA*, and a generalized version of MREC ITS's...
On the Asymptotic Performance of IDA* (1995)
Mahanti, Ambuj, Ghosh, S., Nau, Dana S., Pal, A. K., Kanal, L.N.
Since best-first search algorithms such as A* require large amounts of memory, they sometimes cannot run to completion, even on problem instances of moderate size. This problem has led to the...
Improving the Efficiency of Limited-Memory Heuristic Search (1995)
Ghosh, Subrata, Mahanti, Ambuj, Nau, Dana S.
This paper describes a new admissible tree search algorithm called Iterative Threshold Search (ITS). ITS can be viewed as a much-simplified version of MA*, and a generalized version of MREC ITS's...
Manufacturing-Operation Planning Versus AI Planning (1995)
Nau, Dana S., Gupta, Satyandra K., Regli, William C.
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. Many of the issues important to manufacturing engineers have now...
Manufacturing-Operation Planning Versus AI Planning (1995)
Nau, Dana S., Gupta, Satyandra K., Regli, William C.
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. Many of the issues important to manufacturing engineers have now...
Semantics for Hierarchical Task-Network Planning (1995)
Erol, Kutluhan, Hendler, James A., Nau, Dana S.
One big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Estimation of Setup Time for Machined Parts: Accounting for Work-Holding Constraints (1995)
Das, Diganta, Gupta, Satyandra K., Nau, Dana S.
For machined parts, setup time is a major component of the total time required to create a machined part. If the setup time can be reduced, this will not only decrease the machining time, but will...
Automated Manufacturability Analysis: A Survey (1995)
Das, Diganta, Gupta, Satyandra K., Regli, W.C., Nau, Dana S.
In the marketplace of the 21st century, there is no place for traditional ``over-the-wall'' communications between design and manufacturing. In order to ``design it right the very first time,''...
Current Trends and Future Challenges in Automated Manufacturability Analysis (1995)
Gupta, Satyandra K., Das, Diganta, Regli, W.C., Nau, Dana S.
In the marketplace of the 21st century, there is no place for traditional communications between design and manufacturing. In order to ``design it right the first time,'' designers must ensure that...
Generating Redesign Suggestions to Reduce Setup Cost: A Step towards Automated Redesign (1995)
Das, Diganta, Gupta, Satyandra K., Nau, Dana S.
All mechanical designs pass through a series of formal and informal redesign steps, involving the analysis of functionality, manufacturability, cost and other life-cycle factors. The speed and...
Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this paper we address the problem of representing and recognizing a complete class of...
Complexity, decidability and undecidability results for domain-independent planning (1995)
Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is...
Manufacturing feature instances: Which ones to recognize (1995)
Satyandra K. Gupta, William C. Regli, Dana S. Nau
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
W. C. Regli, S. K. Gupta, D. S. Nau, William C. Regli, William C. Regli, ...
Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this paper we address the problem of representing and recognizing the complete class...
Manufacturing feature instances: Which ones to recognize (1995)
Satyandra K. Gupta, William C. Regli, Dana S. Nau
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
Complexity, decidability and undecidability results for domain-independent planning (1995)
Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is...
Diganta Das, Satyandra K. Gupta, Dana S. Nau
All mechanical designs pass through a series of formal and informal redesign steps, involving the analysis of functionality, manufacturability, cost and other life-cycle factors. The speed and...
AI Planning Versus Manufacturing-Operation Planning: A Case Study (1995)
Dana S. Nau, Satyandra K. Gupta
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. In order to adapt AI planning techniques to manufacturing, it is...
Feature-based Similarity Assessment of Solid Models (1995)
Alexei Elinson, Dana S. Nau, William C. Regli
This paper presents our initial efforts to develop a systematic approach for assessing the similarity of solid models based on how they will be manufactured. The goal of this work is to develop...
AI Planning Versus Manufacturing-Operation Planning: A Case Study (1995)
Dana S. Nau, Satyandra K. Gupta, W.C. Regli
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. In order to adapt AI planning techniques to manufacturing, it is...
A Critical Look at Critics in HTN Planning (1995)
Kutluhan Erol, James Hendler, Dana S. Nau, Reiko Tsuneto
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have...
Complexity Results for HTN Planning (1995)
Kutluhan Erol, James Hendler, Dana S. Nau
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on...
A Critical Look at Critics in HTN Planning (1995)
Kutluhan Erol, James Hendler, Dana S. Nau, Reiko Tsuneto
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have...
Diganta Das, Satyandra K. Gupta, Dana S. Nau
For machined parts, setup time is a major component of the total time required to manufacture a machined part from a stock. If the number of setups and hence setup time can be reduced, this will not...
Manufacturing-Operation Planning versus AI Planning (1995)
Dana S. Nau, Satyandra K. Gupta, William C. Regli
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. Many of the issues important to manufacturing engineers have not...
Extracting Alternative Machining Features: An Algorithmic Approach (1995)
William C. Regli, William C. Regli, William C. Regli, Satyandra K. Gupta, Satyandra K. Gupta, Dana S. Nau, ...
Automated recognition of features from CAD models has been attempted for a wide range of application domains. In this paper we address the problem of representing and recognizing the complete class...
Complexity, decidability and undecidability results for domain-independent planning (1995)
Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is...
A critical look at critics in htn planning (1995)
Kutluhan Erol, James Hendler, Dana S Nau, Reiko Tsuneto
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems Hierarchical Task Network (HTN) planning syetems use critics for this purpose Critics have...
AI planning versus manufacturing-operation planning: a case study (1995)
Dana S. Nau, Satyandra K. Gupta, William C. Regli
Although AI planning techniques can potentially be useful in several manufacturing domains, this potential remains largely unrealized. In order to adapt AI planning techniques to manufacturing, it is...
A critical look at critics in HTN planning (1995)
Kutluhan Erol, James Hendler, Dana S. Nau, Reiko Tsuneto
Detecting interactions and resolving conflicts is one of the key issues for generative planning systems. Hierarchical Task Network (HTN) planning systems use critics for this purpose. Critics have...
Manufacturing Feature Instances: Which Ones to Recognize? (1994)
Gupta, Satyandra K., Regli, William C., Nau, Dana S.
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
Manufacturing Feature Instances: Which Ones to Recognize? (1994)
Gupta, Satyandra K., Regli, William C., Nau, Dana S.
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
Integrating DFM with CAD through Design Critiquing (1994)
Gupta, Satyandra K., Regli, William C., Nau, Dana S.
The increasing focus on design for manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify...
Integrating DFM with CAD through Design Critiquing (1994)
Gupta, Satyandra K., Regli, William C., Nau, Dana S.
The increasing focus on design for manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify...
Semantics for HTN Planning (1994)
Erol, Kutluhan, Hendler, James, Nau, Dana S.
(Also cross-referenced as ISR-TR-95-9) One big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a clear theoretical framework. In particular, no...
Complexity Results for HTN Planning (1994)
Erol, Kutluhan, Hendler, James, Nau, Dana S.
(Also cross-referenced as ISR-TR-95-10) Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there...
Semantics for HTN Planning (1994)
Erol, Kutluhan, Hendler, James, Nau, Dana S.
(Also cross-referenced as ISR-TR-95-9) One big obstacle to understanding the nature of hierarchical task network (HTN) planning has been the lack of a clear theoretical framework. In particular, no...
Complexity Results for HTN Planning (1994)
Erol, Kutluhan, Hendler, James, Nau, Dana S.
(Also cross-referenced as ISR-TR-95-10) Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there...
Reducing Setup Cost by Automated Generation of Redesign Suggestions (1994)
Das, Diganta, Gupta, Satyandra K., Nau, Dana S.
All mechanical designs pass through a series of formal and informal redesign steps, involving the analysis of functionality, manufacturability, cost and other life-cycle factors. The speed and...
UMCP: A sound and complete procedure for hierarchical task-network planning (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Semantics for hierarchical task-network planning (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Semantics for hierarchical task-network planning (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Semantics for hierarchical task-network planning (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Manufacturing Feature Instances: Which Ones to Recognize? (1994)
Satyandra Gupta Mechanical, Satyandra K. Gupta, William C. Regli, Dana S. Nau
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
A Methodology for Systematic Generation and Evaluation of Alternative Operation Plans (1994)
Satyandra Gupta Dana, Dana S. Nau, William C. Regli
This chapter describes a methodology for analyzing some of the manufacturability aspects of machined parts during the design stage of the product development cycle, so that problems related to...
Building MRSEV Models for CAM Applications (1994)
Satyandra K. Gupta, Thomas R. Kramer, Dana S. Nau, William C. Regli, Guangming Zhang
In integrating CAD and CAM applications, one major problem is how to interpret CAD information in a manner that makes sense for CAM. Our goal is to develop a general approach that can be used with a...
Integrating DFM with CAD through Design Critiquing (1994)
Satyandra K. Gupta, William C. Regli, Dana S. Nau
In research on concurrent engineering and engineering design, the increasing use of design for manufacturability (DFM) is expanding the scope of traditional design activities in order to identify and...
Manufacturing Feature Instances: Which Ones to Recognize? (1994)
Satyandra K. Gupta, William C. Regli, Dana S. Nau
Manufacturing features and feature-based representations have become an integral part of research on manufacturing systems, largely due to their ability to model correspondences between design...
Integrating DFM with CAD through Design Critiquing (1994)
Satyandra Gupta Mechanical, Satyandra K. Gupta, William C. Regli, Dana S. Nau
The increasing focus on design for manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify...
A Systematic Approach for Analyzing the Manufacturability of Machined Parts (1994)
Satyandra Gupta Dana, Dana S. Nau
The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed...
Feature Recognition for Manufacturability Analysis (1994)
William C. Regli, Satyandra K. Gupta, Dana S. Nau
While automated recognition of features has been attempted for a wide range of applications, no single existing approach possesses the functionality required to perform manufacturability analysis. In...
Reducing Setup Cost By Automated Generation Of Redesign Suggestions (1994)
Diganta Das Mechanical, Diganta Das, Satyandra K. Gupta, Dana S. Nau
All mechanical designs pass through a series of formal and informal redesign steps, involving the analysis of functionality, manufacturability, cost and other life-cycle factors. The speed and...
Reducing Setup Cost by Automated Generation of Redesign Suggestions (1994)
Diganta Das, Satyandra K. Gupta, Dana S. Nau
All mechanical designs pass through a series of formal and informal redesign steps, involving the analysis of functionality, manufacturability, cost and other life-cycle factors. The speed and...
A Systematic Approach for Analyzing the Manufacturability of Machined Parts (1994)
Satyandra K. Gupta, Dana S. Nau
The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed...
A Methodology for Systematic Generation and Evaluation of Alternative Operation Plans (1994)
Satyandra K. Gupta, Dana S. Nau, William C. Regli, Guangming Zhang
This chapter describes a methodology for analyzing some of the manufacturability aspects of machined parts during the design stage of the product development cycle, so that problems related to...
On the Nature and Role of Modal Truth Criteria in Planning (1994)
Subbarao Kambhampati, Dana S. Nau
Chapman's paper, "Planning for Conjunctive Goals," has been widely acknowledged for its contribution toward understanding the nature of partial-order planning, and it has been one of...
On the Nature of Modal Truth Criteria in Planning (1994)
Subbarao Kambhampati, Dana S. Nau
Chapman's paper, "Planning for Conjunctive Goals," has been widely acknowledged for its contribution toward understanding the nature of nonlinear (partial-order) planning, and it has...
On the Nature of Modal Truth Criteria in Planning (1994)
Subbarao Kambhampati, Dana S. Nau
Chapman's paper, "Planning for Conjunctive Goals," has been widely acknowledged for its contribution toward understanding the nature of nonlinear (partial-order) planning, and it has...
Building MRSEV Models for CAM Applications (1994)
Satyandra Gupta, Thomas R. Kramer, Dana S. Nau, William C. Regli, Guangming Zhang
In integrating CAD and CAM applications, one major problem is how to interpret CAD information in a manner that makes sense for CAM. Our goal is to develop a general approach that can be used with a...
On the Nature and Role of Modal Truth Criteria in Planning (1994)
Subbarao Kambhampati, Dana S. Nau
Chapman's paper, "Planning for Conjunctive Goals," has been widely acknowledged for its contribution toward understanding the nature of partial-order planning, and it has been one of...
Semantics for Hierarchical Task-Network Planning (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
Complexity, Decidability and Undecidability Results for Domain-Independent Planning (1994)
Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is...
ITS: An Efficient Limited-Memory Heuristic Tree Search Algorithm (1994)
Subrata Ghosh, Ambuj Mahanti, Dana S. Nau
This paper describes a new admissible tree search algorithm called Iterative Threshold Search (ITS). ITS can be viewed as a much-simplified version of MA* [1], and a generalized version of MREC [12]....
Integrating DFM with CAD through Design Critiquing (1994)
Satyandra Gupta, William C. Regli, Dana S. Nau
The increasing focus on design for manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify...
Integrating DFM with CAD through Design Critiquing (1994)
Satyandra K. Gupta, William C. Regli, Dana S. Nau
The increasing focus on design for manufacturability (DFM) in research in concurrent engineering and engineering design is expanding the scope of traditional design activities in order to identify...
On the Nature and Role of Modal Truth Criteria in Planning (1994)
Subbarao Kambhampati, Dana S. Nau
Chapman's paper, "Planning for Conjunctive Goals," has been widely acknowledged for its contribution toward understanding the nature of partial-order planning, and it has been one of...
UMCP: A Sound and Complete Procedure for Hierarchical Task Network Planning (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
HTN planning: Complexity and expressivity (1994)
Kutluhan Erol, James Hendler, Dana S. Nau
Most practical work on AI planning systems during the last fteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on...
On the Nature of Modal Truth Criteria in Planning (1994)
Subbarao Kambhampati, Dana S. Nau
Chapman’s paper, “Planning for Conjunctive Goals, ” has been widely acknowledged for its contribution toward understanding the nature of nonlinear (partial-order) planning, and it has been one...
A Systematic Approach for Analyzing the Manufacturability of Machined Parts (1993)
Gupta, Satyandra K., Nau, Dana S.
The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed...
A Systematic Approach for Analyzing the Manufacturability of Machined Parts (1993)
Gupta, Satyandra K., Nau, Dana S.
The ability to quickly introduce new quality products is a decisive factor in capturing market share. Because of pressing demands to reduce lead time, analyzing the manufacturability of the proposed...
Strategic planning for imperfect information games (1993)
Although game-tree search works well in perfectinformation games, there are problems in trying to use it for imperfect-information games such as bridge. The lack of knowledge about the opponents...
Development of Machining Alternatives, Based on MRSEVs (1993)
Dana S. Nau, Satyandra K. Gupta, Thomas R. Kramer, William C. Regli, Guangming Zhang
One missing link between CAD and CAM is the lack of a systematic methodology for generating and evaluating alternative ways to manufacture a proposed design. To address this problem, we are...
On the complexity of possible truth (1993)
Chapman’s paper, “Planning for Conjunctive Goals,” (Chapman, 1987) has been widely acknowledged as a major step towards understanding the nature of nonlinear planning, and it has been one of...
Enabling-condition interactions and finding good plans (1993)
In AI planning research, the best-known goal interaction is the deleted-condition interaction, in which the side-effect of achieving one condition is to delete some other condition that will be...
Complexity, Decidability and Undecidability Results for Rule- Based Expert Systems (1992)
Blanksteen, Scott, Hendler, Jim, Nau, Dana S.
We prove the equivalence of domain-independent planning systems and rule-based expert systems. We use this equivalence to examine how the complexity of deriving conclusions in rule-based expert...
Complexity, Decidability and Undecidability Results for Rule- Based Expert Systems (1992)
Blanksteen, Scott, Hendler, James A., Nau, Dana S.
We prove the equivalence of domain-independent planning systems and rule-based expert systems. We use this equivalence to examine how the complexity of deriving conclusions in rule-based expert...
On the Complexity of Blocks-World Planning (1992)
In this paper, we show that in the best-known version of the blocks world (and several related versions), planning is difficult, in the sense that finding an optimal plan is NP-hard. However, the...
Merging Separately Generated Plans with Restricted Interactions (1992)
Qiang Yang, Dana S. Nau, James Hendler
Generating action sequences to achieve a set of goals is a computationally difficult task. When multiple goals are present, the problem is even worse. Although many solutions to this problem have...
Merging Separately Generated Plans with Restricted Interactions (1992)
Qiang Yang, Dana S. Nau, James Hendler
Generating action sequences to achieve a set of goals is a computationally difficult task. When multiple goals are present, the problem is even worse. Although many solutions to this problem have...
Erol, Kutluhan, Nau, Dana S., Subrahmanian, V.S.
In this paper, we examine how the complexity of domain-independent planning with STRIPS-like operators depends on the nature of the planning operators. We show conditions under which plannning is...
Erol, Kutluhan, Nau, Dana S., Subrahmanian, V.S.
In this paper, we examine how the complexity of domain-independent planning with STRIPS-like operators depends on the nature of the planning operators. We show conditions under which plannning is...
On the Complexity of Blocks-World Planning (1991)
In this paper, we show that blocks-world planning is difficult, in the sense that finding an optimal plan is NP-hard. This is true regardless of whether or not, the goal state is completely...
Complexity Results for Blocks-World Planning (1991)
Although blocks-world planning is well-known, its complexity has not previously been analyzed, and different planning researchers have expressed conflicting opinions about its difficulty. In this...
Kutluhan Erol, Dana S. Nau, V. S. Subrahmanian
In this paper, we examine how the complexity of domain-independent planning with STRIPS-style operators depends on the nature of the planning operators. We show conditions under which planning is...
An Algebraic Approach to Feature Interactions. (1989)
Nau, Dana S., Karinthi, Raghu R.
Various approaches have been proposed to provide communication between CAD systems and process planning systems, including automated feature extraction, design by features, and human- supervised...
Comparing Minimax and Product in a Variety of Games. (1987)
In applications of game tree searching, the most widely used back-up rule is the minimax rule. Research has shown that minimax does not perform well in some games - and this has led to interest in...
Nau, Dana S., Chang, Tien-Chien
In most frame-based reasoning systems, the information being manipulated is represented using frames, but the problem-solving knowledge that manipulates the frames is represented as production rules....
Typescript.
Recognition of Volumetric Features from CAD Models: Problem Formalization and Algorithms
Automated recognition of features from CAD models has been attempted for a wide range of application domains in mechanical engineering. However, the absence of a clear mathematical formalism for the...
UMCP: A Sound and Complete Procedure for Hierarchical Task-Network Planning
Kutluhan Erol, James Hendler, Dana S. Nau
One big obstacle to understanding the nature of hierarchical task network (htn) planning has been the lack of a clear theoretical framework. In particular, no one has yet presented a clear and...
HTN Planning: Complexity and Expressivity
Kutluhan Erol, James Hendler, Dana S. Nau
Most practical work on AI planning systems during the last fifteen years has been based on hierarchical task network (HTN) decomposition, but until now, there has been very little analytical work on...