Probabilistic Planning via Determinization in Hindsight (2009)
Sungwook Yoon, Alan Fern, Robert Givan, Subbarao Kambhampati
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hindsight optimization...
State Agnostic Planning Graphs: Deterministic, Non-Deterministic, and Probabilistic Planning (2009)
Daniel Bryce, William Cushing, Subbarao Kambhampati
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states, and...
An Online Learning Method for Improving Over-subscription Planning (2009)
Sungwook Yoon, J. Benton, Subbarao Kambhampati
Despite the recent resurgence of interest in learning methods for planning, most such efforts are still focused exclusively on classical planning problems. In this work, we investigate the...
Optimal Ad Ranking for Profit Maximization (2009)
Raju Balakrishnan, Subbarao Kambhampati
Despite the enormous commercial importance of on-line advertisements (ads), there has been little work done to clarify the basis for ranking and displaying them. Most existing methods rank ads as if...
Replanning as a Deliberative Re-selection of Objectives (2009)
William Cushing, J. Benton, Subbarao Kambhampati
Although expressive conceptual theories of replanning have existed for a long time (c.f. Bratman et. al., 1988), computational approaches to replanning have mostly been restricted to plan stability...
Optimal Ad Ranking for Profit Maximization (2009)
Raju Balakrishnan, Subbarao Kambhampati
Despite the enormous commercial importance of on-line advertisements (ads), there has been little work done to clarify the basis for ranking and displaying them. Most existing methods rank ads as if...
Probabilistic Planning via Determinization in Hindsight (2009)
Sungwook Yoon, Alan Fern, Robert Givan, Subbarao Kambhampati
This paper investigates hindsight optimization as an approach for leveraging the significant advances in deterministic planning for action selection in probabilistic domains. Hindsight optimization...
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective (2008)
Thomas Vossen, Subbarao Kambhampati
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state...
Handling Imprecision & Incompleteness in Autonomous Databases (Technical Challenge) (2008)
Subbarao Kambhampati, Yi Chen, Jianchun Fan, Hemal Khatri, Ullas Nambiar, Garrett Wolf
As more and more information from autonomous web databases becomes available to lay users, query processing over these databases must adapt to deal with the imprecise nature of user queries as well...
IPPLAN: Planning as Integer Programming Overview (2008)
Subbarao Kambhampati, Thomas Vossen
IPPLAN is an integer programming based planning system. It builds on the previous work of planning as integer programming, including that of: ILP-PLAN by Kautz and Walser (1999), the state change...
QUIC: Handling Query Imprecision & Data Incompleteness in Autonomous Databases ABSTRACT (2008)
Subbarao Kambhampati, Garrett Wolf, Yi Chen, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, ...
As more and more information from autonomous databases becomes available to lay users, query processing over these databases must adapt to deal with the imprecise nature of user queries as well as...
Abstract A Snapshot of Public Web Services (2008)
Jianchun Fan, Subbarao Kambhampati
Web Service Technology has been developing rapidly as it provides a flexible application-to-application interaction mechanism. Several ongoing research efforts focus on various aspects of web service...
Multi-Objective Query Processing for Data Aggregation (2008)
Jianchun Fan, Subbarao Kambhampati
Most fielded data integration systems focus on data aggregation applications, where individual data sources all export fragments of a single relation. Given a query, the primary query processing...
Kambhampati QPIAD: Query Processing over Incomplete Autonomous Databases (2008)
Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kambhampati
Incompleteness due to missing attribute values (aka “null values”) is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query...
Planning Competition’s Temporal Planning (2008)
William Cushing, Subbarao Kambhampati
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this...
Query Processing over Incomplete Autonomous Databases (2008)
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, Yi Chen, Subbarao Kambhampati
Incompleteness due to missing attribute values (aka “null values”) is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query...
We will motivate the problem of simultaneously handling incompleteness and imprecision in autonomous databases. We will argue that effectively tackling this problem requires solutions to density and...
Finding Inter-Related Plans (2008)
Biplav Srivastava, Subbarao Kambhampati
In many planning situations, a planner is required to return a set of plans satisfying the same goals which will be used by the external systems collectively. The external systems can specify the...
Mining, Using and Maintaining Source Statistics for Adaptive Data Integration (2008)
Jianchun Fan, Subbarao Kambhampati, Zaiqing Nie
To make query processing effective in data integration scenarios, the mediator needs to be able to gather and use statistics about data sources as well as to adapt to the often conflicting user...
and Retrieval During Plan Reuse: ation Structure Based Approach (2008)
Effective mapping and retrieval are important issues in suc-cessful deployment of plan reuse strategies. In this paper we present a domain independent strategy for ranking a set of plausible reuse...
Evaluating temporal planning domains (2008)
William Cushing, Subbarao Kambhampati, Kartik Talamadupula
The last eight years have seen dramatic progress in temporal planning as highlighted by the temporal track in the last three International Planning Competitions (IPC). However, our recent work,...
Planning Competition’s Temporal Planning (2008)
William Cushing, Subbarao Kambhampati
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this...
Evaluating temporal planning domains (2008)
William Cushing, Subbarao Kambhampati, Kartik Talamadupula
The last eight years have seen dramatic progress in temporal planning as highlighted by the temporal track in the last three International Planning Competitions (IPC). However, our recent work,...
Engineering Note Optiplan: Unifying IP-based and Graph-based Planning (2008)
The Optiplan planning system is the first integer programming-based planner that successfully participated in the international planning competition. This engineering note describes the architecture...
Multi-Objective Query Processing for Data Aggregation (2008)
Jianchun Fan, Subbarao Kambhampati
Most fielded data integration systems focus on data aggregation applications, where individual data sources all export fragments of a single relation. Given a query, the primary query processing...
Optiplan: A Planning System that Unifies Integer Programming with Planning Graph (2008)
The Optiplan planning system is the first integer programming-based planner that successfully participated in the international planning competition. This engineering note describes the architecture...
Abstract Effective Interplay of State Space and CSP Views in a Single Planner (2008)
Terry Zimmerman, Subbarao Kambhampati
AI planning has made impressive advances under several different paradigms of the problem structure and search process. Each view brings its particular strengths to bear on the problem and suffers...
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective (2008)
Thomas Vossen, Subbarao Kambhampati
We represent planning as a set of loosely coupled network flow problems, where each network corresponds to one of the state variables in the planning domain. The network nodes correspond to the state...
Query Processing over Incomplete Autonomous Databases (2008)
Garrett Wolf, Hemal Khatri, Bhaumik Chokshi, Yi Chen, Subbarao Kambhampati
Incompleteness due to missing attribute values (aka “null values”) is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query...
Synthesizing Customized Planners from Speci cations (2008)
Biplav Srivastava, Subbarao Kambhampati
Existing plan synthesis approaches in arti cial intelligence fall into two categories { domain independent and domain dependent. The domain independent approaches are applicable across a variety of...
Engineering Note Optiplan: Unifying IP-based and Graph-based Planning (2008)
The Optiplan planning system is the first integer programming-based planner that successfully participated in the international planning competition. This engineering note describes the architecture...
QUIC: Handling Query Imprecision & Data Incompleteness in Autonomous Databases ABSTRACT (2008)
Subbarao Kambhampati, Garrett Wolf, Yi Chen, Hemal Khatri, Bhaumik Chokshi, Jianchun Fan, ...
As more and more information from autonomous databases becomes available to lay users, query processing over these databases must adapt to deal with the imprecise nature of user queries as well as...
Model-Lite Planning: Diverse Multi-Option Plans & Dynamic Objective Functions (2008)
Daniel Bryce, William Cushing, Subbarao Kambhampati
Knowledge acquisition is one major bottle-neck in using planning systems. Model-lite planning reduces this burden by placing responsibility on the planning system to cope with partially specified...
Articles 88 AI MAGAZINE ALTALT Combining Graphplan and Heuristic State Search (2008)
Default Heuristic In, Biplav Srivastava, Xuanlong Nguyen, Subbarao Kambhampati, Minh B. Do, Ullas Nambiar, ...
ynthesis system, called ALTALT. ALTALT is designed to exploit the complementary strengths of two of the currently popular competing approaches for plan generation: (1) GRAPHPLAN and (2) heuristic...
Refinement-Based Planning As Satisfiability (2007)
Amol D. Mali, Subbarao Kambhampati
It has been shown recently that planning problems are easier to solve when they are cast as model finding problems. Some schemes for automated generation of the encodings of the planning problems in...
Frugal Propositional Encodings for Planning (2007)
Amol D. Mali, Subbarao Kambhampati
Casting planning as a satisfiability problem has recently lead to the development of significantly faster planners. One key factor behind their success is the concise nature of the encodings of the...
2.1.1 An Example........................ 12 (2007)
Laurie Ihrig, Subbarao Kambhampati
The aim of case-based planning (CBP) is to improve the e ciency of plan generation by taking advantage of previous problem-solving experience. This paper explores the relative utility of placing CBP...
Research Paper: america22 1 Optimizing Recursive Information Gathering Plans (2007)
Eric Lambrecht, Subbarao Kambhampati
In this paper we describe two optimization techniques that are specially tailored for information gathering. The first is a greedy minimization algorithm that minimizes an information gathering plan...
Learning-assisted automated planning: review, appraisal, and prospects (2007)
Terry Zimmerman, Subbarao Kambhampati
This paper reports on a extensive survey of research work related to machine learning as applied to automated planning over the past 30 years. Major research contributions are characterized broadly...
What Next for Learning in AI Planning? (2007)
Terry Zimmerman, Subbarao Kambhampati
This paper reports on a comprehensive survey of research work related to machine learning as applied to AI planning over the past 15 years. Major research contributions are characterized broadly by...
Running Head: Multi-contributor Causal Structures for Planning (2007)
Explicit causal structure representations have been widely used in classical planning systems to guide a variety of aspects of planning, including plan generation, modification and generalization....
An Iterative and Interactive Approach for Process (2007)
Planning Suresh Batchu, Suresh Batchu, Subbarao Kambhampati, Hirode Kartheek, Jami Shah
Process planning involves producing machining plans for manufacturing mechanical parts. It requires satisfying a variety of hard and soft geometric, kinematic, tolerance based and economic...
Probabilistic planning is multi-objective (2007)
Daniel Bryce, William Cushing, Subbarao Kambhampati
Probabilistic planning is an inherently multi-objective problem where plans must trade-off probability of goal satisfaction with expected plan cost. To date, probabilistic plan synthesis algorithms...
Daniel Bryce, Subbarao Kambhampati
■ The primary revolution in automated planning in the last decade has been the very impressive scaleup in planner performance. A large part of the credit for this can be attributed squarely to the...
An LP-based heuristic for optimal planning (2007)
J. Benton, Subbarao Kambhampati
Abstract. One of the most successful approaches in automated planning is to use heuristic state-space search. A popular heuristic that is used by a number of state-space planners is based on relaxing...
Publications Refereed Journals (2007)
Research Interests Artificial Intelligence, with emphasis on intelligent planning and scheduling. Especially planning systems that can handle real-world problems involving complex temporal and...
Probabilistic planning is multi-objective (2007)
Daniel Bryce, William Cushing, Subbarao Kambhampati
Probabilistic planning is an inherently multi-objective problem where plans must trade-off probability of goal satisfaction with expected plan cost. To date, probabilistic plan synthesis algorithms...
Query processing over incomplete autonomous databases (2006)
Hemal Khatri, Jianchun Fan, Yi Chen, Subbarao Kambhampati
Incompleteness due to missing attribute values (aka “null values”) is very common in autonomous web databases, on which user accesses are usually supported through mediators. Traditional query...
Elicitation and Application of Narrative Constraints Through Mixed- (2006)
Jorge Baier, Jeremy Hussell, Fahiem Bacchus, Sheila A. Mcilraith, Minh B. Do, J. Benton, ...
The planning community has traditionally been primarily concerned with the problem of generating a plan that satisfies a collection of goals. In many real-world planning problems, it is necessary to...
Sequential Monte Carlo in Probabilistic Planning Reachability Heuristics (2006)
Daniel Bryce Subbarao, Daniel Bryce, Subbarao Kambhampati
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan lengths, they often do...
Planning Graph Heuristics for Belief Space Search (2006)
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates.
Planning graph heuristics for belief space search (2006)
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To...
Planning graph heuristics for belief space search (2006)
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Some recent works in conditional planning have proposed reachability heuristics to improve planner scalability, but many lack a formal description of the properties of their distance estimates. To...
Improving Text Collection Selection with Coverage and Overlap Statistics (2005)
Thomas Hernandez, Subbarao Kambhampati
In an environment of distributed text collections, the first step in the information retrieval process is to identify which of all available collections are more relevant to a given query and which...
Cost Sensitive Reachability Heuristics for Handling State Uncertainty (2005)
Daniel Bryce, Subbarao Kambhampati
While POMDPs provide a general platform for non-deterministic conditional planning under a variety of quality metrics they have limited scalability.
Planning graph heuristics for selecting objectives in over-subscription planning problems (2005)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Partial Satisfaction or Over-subscription Planning problems arise in many real world applications. Applications in which the planning agent does not have enough resources to accomplish all of their...
Using Memory to Transform Search on the Planning Graph (2005)
Terry Zimmerman, Subbarao Kambhampati
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions remains one of the most effective ways to generate such plans. However, despite enhancements on a...
Using Memory to Transform Search on the Planning Graph (2005)
Terry Zimmerman, Subbarao Kambhampati
The Graphplan algorithm for generating optimal make-span plans containing parallel sets of actions remains one of the most effective ways to generate such plans. However, despite enhancements on a...
Optiplan: Unifying IP-based and graph-based planning (2005)
The Optiplan planning system combines the ideas presented by Vossen et al. (1999) and Kautz and Selman (1998). It unifies integer programming with graphbased planning and computes optimal parallel...
Integration of biological sources: Current systems and challenges ahead (2004)
Thomas Hern, Subbarao Kambhampati
This paper surveys the area of biological and genomic sources integration, which has recently become a major focus of the data integration research field. The challenges that an integration system...
Integration of biological sources: Current systems and challenges ahead (2004)
Thomas Hern, Subbarao Kambhampati
This paper surveys the area of biological and genomic sources integration, which has recently become a major focus of the data integration research field. The challenges that an integration system...
Optimizing Recursive Information Gathering Plans in EMERAC (2004)
Subbarao Kambhampati, Eric Lambrecht, Ullas Nambiar, Zaiqing Nie, Gnanaprakasam Senthil
Abstract. In this paper we describe two optimization techniques that are specially tailored for information gathering. The first is a greedy minimization algorithm that minimizes an information...
Over-Subscription in Planning: a Partial Satisfaction Problem (2004)
Romeo Sanchez, Subbarao Kambhampati
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals.
Planning in Belief Space with a Labelled Uncertainty Graph (2004)
Daniel Bryce Subbarao, Daniel Bryce, Subbarao Kambhampati
Planning in belief space with a Labelled Uncertainty Graph, LUG, is an approach that uses a very compact planning graph to guide search in the space of belief states to construct conformant and...
A Frequency-based Approach for Mining Coverage Statistics in Data Integration (2004)
Zaiqing Nie, Subbarao Kambhampati
Query optimization in data integration requires source coverage and overlap statistics. Gathering and storing the required statistics presents many challenges, not the least of which is controlling...
A Frequency-based Approach for Mining Coverage Statistics in Data Integration (2004)
Zaiqing Nie, Subbarao Kambhampati
Query optimization in data integration requires source coverage and overlap statistics. Gathering and storing the required statistics presents many challenges, not the least of which is controlling...
Ullas Nambiar, Subbarao Kambhampati
Current approaches for answering queries with imprecise constraints require users to provide distance metrics and importance measures for attributes of interest. In this paper we focus on providing a...
Heuristic Guidance Measures for Conformant Planning (2004)
Daniel Bryce, Subbarao Kambhampati
Scaling conformant planning is a problem that has received much attention of late. Many planners solve the problem as a search in the space of belief states, and some heuristic guidance techniques...
Planning - scheduling connections through exogenous events (2004)
Minh B. Do, Subbarao Kambhampati
Exogenous events appear in many practical planning and scheduling problems but until recently only the latter methodology has explicitly dealt with them. While exogenous events are commonly viewed as...
Effective approaches for partial satisfaction (over-subscription) planning (2004)
Romeo Sanchez, Minh B. Do, Subbarao Kambhampati
In many real world planning scenarios, agents often do not have enough resources to achieve all of their goals. Consequently, they are forced to find plans that satisfy only a subset of the goals....
Planning - scheduling connections through exogenous events (2004)
Minh B. Do, Subbarao Kambhampati
Exogenous events appear in many practical planning and scheduling problems but until recently only the latter methodology has commonly dealt with them. On the one hand, exogenous events that are...
Partial Satisfaction (Over-Subscription) Planning as Heuristic Search (2004)
Minh B. Do, Subbarao Kambhampati
Many planning problems can be characterized as over-subscription problems in that goals have different utilities, actions have different costs and the planning system must choose a subset that will...
Planning - scheduling connections through exogenous events (2004)
Minh B. Do, Subbarao Kambhampati
Exogenous events appear in many practical planning and scheduling problems but until recently only the latter methodology has commonly dealt with them. On the one hand, exogenous events that are...
Optimizing Recursive Information Gathering Plans in EMERAC (2004)
Subbarao Kambhampati, Eric Lambrecht, Ullas Nambiar, Zaiqing Nie, Gnanaprakasam Senthil
In this paper we describe two optimization techniques that are specially tailored for information gathering. The first is a greedy minimization algorithm that minimizes an information gathering plan...
Using available memory to transform Graphplan’s search (2003)
Terry Zimmerman, Subbarao Kambhampati
We present a major variant of the Graphplan algorithm that employs available memory to transform the depth-first nature of Graphplan’s search into an iterative state space view in which heuristics...
Sapa: A scalable multi-objective heuristic metric temporal planner (2003)
Minh B. Do, Subbarao Kambhampati
In this research paper, we discuss Sapa, a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to...
Learning-assisted automated planning: Looking back, taking stock, going forward (2003)
Terry Zimmerman, Subbarao Kambhampati
This paper reports on an extensive survey and analysis of research work related to machine learning as applied to automated planning over the past 30 years. Major research contributions are...
Zaiqing Nie, Subbarao Kambhampati, Thomas Hernandez
Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition there are no...
AltAlt-p: Online parallelization of plans with heuristic state search (2003)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching...
Altalt-p: Online parallelization of plans with heuristic state search (2003)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching...
AltAlt^p: Online Parallelization of Plans with Heuristic State Search (2003)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching...
Parallelizing State Space Plans Online (2003)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Searching for parallel solutions in state space planners is a challenging problem, because it would require the planners to branch on all possible subsets of parallel actions, exponentially...
AltAlt^p: Online Parallelization of Plans with Heuristic State Search (2003)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching...
Planning Graph Based Heuristics for Automated Planning (2003)
Romeo Sanchez Nigenda, Advisor Prof, Subbarao Kambhampati, Prof Chitta Baral, Prof Huan Liu, Jeremy Frank
One of the most successful algorithms in the last few years for solving classical planning problems is Graphplan [3]. This algorithm can be seen as a disjunctive version of forward state space...
Answering Imprecise Database Queries: A Novel Approach (2003)
Ullas Nambiar, Subbarao Kambhampati
A growing number of databases especially those published on the Web are becoming available to external users. Users of these databases are provided simple form-based query interfaces that hide the...
SAPA: A multi-objective metric temporal planner (2003)
Minh B. Do, Subbarao Kambhampati
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the...
Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar
Abstract—Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition,...
SAPA: A multi-objective metric temporal planner (2003)
Minh B. Do, Subbarao Kambhampati
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the...
AltAlt p : Online Parallelization of Plans with Heuristic State Search (2003)
Romeo Sanchez Nigenda, Subbarao Kambhampati
Despite their near dominance, heuristic state search planners still lag behind disjunctive planners in the generation of parallel plans in classical planning. The reason is that directly searching...
Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar
Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition there are no...
Using available memory to transform Graphplan’s search (2003)
Terry Zimmerman, Subbarao Kambhampati
We present a major variant of the Graphplan algorithm that employs available memory to transform the depth-first nature of Graphplan's search into an iterative state space view in which...
Xuanlong Nguyen, Subbarao Kambhampati, Romeo S. Nigenda
Most recent strides in scaling up planning have centered around two competing themes–disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP...
Xuanlong Nguyen, Subbarao Kambhampati, Romeo S. Nigenda
Most recent strides in scaling up planning have centered around two competing themes— disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP...
Mining Coverage Statistics for Websource Selection in a Mediator (2002)
Zaiqing Nie, Ullas Nambiar, Sreelakshmi Vaddi, Subbarao Kambhampati
Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition there are no...
Improving the Temporal Flexibility of Position Constrained Metric Temporal Plans (2002)
Minh B. Do, Subbarao Kambhampati
In this paper we address the problem of post-processing position constrained plans, output by many of the recent efficient metric temporal planners, to improve their execution flexibility....
Havasu: A Multi-Objective, Adaptive Query Processing Framework for Web Data Integration (2002)
Subbarao Kambhampati, Ullas Nambiar, Zaiqing Nie, Sreelakshmi Vaddi
Mediators for web-based data integration need the ability to handle multiple, often conflicting objectives, including cost, coverage and execution flexibility. This requires the development of query...
Planning Graph Heuristics for Belief Space Search (2002)
Daniel Bryce, Subbarao Kambhampati, David E. Smith
Belief space search is a technique for solving planning problems characterized by incomplete state information and non-deterministic actions. Planning problems expressed in this space present a much...
Sapa: A domain-independent heuristic metric temporal planner (2001)
Minh B. Do, Subbarao Kambhampati
Many real world planning problems require goals with deadlines and durative actions that consume resources. In this paper, we present Sapa, a domain-independent heuristic forward chaining planner...
Mining source coverage statistics for data integration (2001)
Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar, Sreelakshmi Vaddi
Recent work in data integration has shown the importance of statistical information about the coverage and overlap of sources for efficient query processing. Despite this recognition there are no...
Planning as Constraint Satisfaction: Solving the planning-graph by compiling it into CSP (2001)
Minh Binh Do, Subbarao Kambhampati
Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily...
Altalt: Combining the advantages of graphplan and heuristic state search (2000)
Romeo Sanchez Nigenda, Xuanlong Nguyen, Subbarao Kambhampati
Most recent strides in scaling up planning have centered around two competing themes–disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by HSP and...
Distance-based Goal-ordering heuristics for Graphplan (2000)
Subbarao Kambhampati, Romeo Sanchez Nigenda
We will discuss the shortcomings of known variable and value ordering strategies for Graphplan's backward search phase, and propose a novel strategy that is based on a notion of the difficulty...
Altalt: Combining the advantages of graphplan and heuristic state search (2000)
Romeo Sanchez Nigenda, Xuanlong Nguyen, Subbarao Kambhampati
Most recent strides in scaling up planning have centered around two competing themes--disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by HSP and...
Altalt: Combining the advantages of graphplan and heuristic state search (2000)
Romeo Sanchez Nigenda, Xuanlong Nguyen, Subbarao Kambhampati
Most recent strides in scaling up planning have centered around two competing themes--disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by HSP and HSPR....
Minh Binh Do, Biplav Srivastava, Subbarao Kambhampati
Currently, Graphplan and Blackbox, which converts Graphplan 's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains its efficiency from...
This paper reviews the connections between Graphplan's planning-graph and the dynamic constraint satisfaction problem and motivates the need for adapting CSP search techniques to the Graphplan...
Biplav Srivastava, Subbarao Kambhampati, Binh Minh Do
In most real-world reasoning problems, planning and scheduling phases are loosely coupled. For example, in project planning, the user comes up with a task list and schedules it with a scheduling tool...
Extracting Effective and Admissible State Space Heuristics from the Planning Graph (2000)
XuanLong Nguyen, Subbarao Kambhampati
Graphplan and heuristic state space planners such as HSP-R and UNPOP are currently two of the most effective approaches for solving classical planning problems. These approaches have hither-to been...
Solving planning-graph by compiling it into CSP (2000)
Minh Binh Do, Subbarao Kambhampati
Although the deep affinity between Graphplan's backward search, and the process of solving constraint satisfaction problems has been noted earlier, these relations have hither-to been primarily...
Xuanlong Nguyen, Subbarao Kambhampati, Romeo S. Nigenda
Most recent strides in scaling up planning have centered around two competing themes--disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by UNPOP, HSP...
AltAlt: Combining the Advantages of Graphplan and Heuristic (2000)
State Search Romeo, Romeo Sanchez Nigenda, Xuanlong Nguyen, Subbarao Kambhampati
Most recent strides in scaling up planning have centered around two competing themes--disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by HSP and...
Investigating the Effect of Relevance and Reachability Constraints on SAT (2000)
Encodings Of Planning, Minh Binh Do, Biplav Srivastava, Subbarao Kambhampati, Which Converts Graphplan’s
Currently, Graphplan and Blackbox, which converts Graphplan 's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains its efficiency from...
Altalt: Combining the advantages of graphplan and heuristic state search (2000)
Romeo Sanchez Nigenda, Xuanlong Nguyen, Subbarao Kambhampati
Most recent strides in scaling up planning have centered around two competing themes–disjunctive planners, exemplified by Graphplan, and heuristic state search planners, exemplified by HSP and...
Scaling up Planning by teasing out Resource Scheduling (1999)
Biplav Srivastava, Subbarao Kambhampati
Abstract. Planning consists of an action selection phase where actions are selected and ordered to reach the desired goals, and a resource allocation phase where enough resources are assigned to...
Optimizing recursive information gathering plans (1999)
Eric Lambrecht, Subbarao Kambhampati, Senthil Gnanaprakasam
In this paper we describe two optimization techniques that are specially tailored for information gathering. The first is a greedy minimization algorithm that minimizes an information gathering plan...
On the utility of Plan-space (causal) Encodings (1999)
Amol D. Mali, Subbarao Kambhampati
Recently, casting planning as propositional satisfiability has been shown to be a very promising technique for plan synthesis. Although encodings based both on statespace planning and on plan-space...
Optimizing source-call ordering in Information Gathering Plans (1999)
Subbarao Kambhampati, Senthil Gnanaprakasam
In this paper we consider the problem of optimizing the order in which source relations are joined in information gathering plans. This problem differs significantly from the traditional database...
Scaling up Planning by teasing out Resource Scheduling (1999)
Biplav Srivastava, Subbarao Kambhampati
Planning consists of an action selection phase where actions are selected and ordered to reach the desired goals, and a resource allocation phase where enough resources are assigned to ensure the...
On the utility of Plan-space (Causal) Encodings (1999)
Amol Mali, Subbarao Kambhampati
Recently, casting planning as propositional satisfiability has been shown to be a very promising technique for plan synthesis. It has been claimed that SAT encodings for planning problems can be...
Optimizing Recursive Information Gathering Plans (1999)
Eric Lambrecht Subbarao, Subbarao Kambhampati, Senthil Gnanaprakasam
In this paper we describe two optimization techniques that are specially tailored for information gathering. The first is a greedy minimization algorithm that minimizes an information gathering plan...
Efficient Planning Through Separate Resource Scheduling (1999)
Biplav Srivastava, Subbarao Kambhampati
Planning consists of selecting a course of actions to achieve the desired goals, and assigning enough resources to ensure successful execution of the chosen actions. Most planners do not distinguish...
Scaling up Planning by teasing out Resource Scheduling (1999)
Biplav Srivastava, Subbarao Kambhampati
Planning consists of an action selection phase where actions are selected and ordered to reach the desired goals, and a resource allocation phase where enough resources are assigned to ensure the...
On the utility of Plan-space (causal) Encodings (1999)
Amol D. Mali, Subbarao Kambhampati
Recently, casting planning as propositional satisfiability has been shown to be a very promising technique for plan synthesis. Although encodings based both on statespace planning and on plan-space...
Improving Graphplan's search with EBL & DDB techniques (1999)
I highlight some inefficiencies of Graphplan’s backward search algorithm, and describe how these can be eliminated by adding explanation-based learning and dependency-directed backtracking...
Exploiting symmetry in the plan-graph via explanation-guided search (1999)
Terry Zimmerman, Subbarao Kambhampati
We present a method for exploiting the symmetry in the planning graph structure and certain redundancies inherent in the Graphplan algorithm, so as to improve its backward search. The main insight...
Hybrid planning for partially hierarchical domains (1998)
Subbarao Kambhampati, Amol Mali, Biplav Srivastava
Hierarchical task network and action-based planning approaches have traditionally been studied separately. In many domains, human expertise in the form of hierarchical reduction schemas exists, but...
Efficiently Executing Information Gathering Plans (1998)
Eric Lambrecht, Subbarao Kambhampati
The most costly aspect of gathering information over the Internet is that of transferring data over the network to answer the user's query. We make two contributions in this paper that alleviate...
The ideas of intelligent backtracking (IB) and explanation-based learning (EBL) have developed independently in the constraint satisfaction, planning, machine learning and problem solving...
Synthesizing Customized Planners from Specifications (1998)
Biplav Srivastava, Subbarao Kambhampati
Existing plan synthesis approaches in artificial intelligence fall into two categories -- domain independent and domain dependent. The domain independent approaches are applicable across a variety of...
Hybrid planning for partially hierarchical domains (1998)
Subbarao Kambhampati, Amol Mali, Biplav Srivastava
Hierarchical task network and action-based planning approaches have traditionally been studied separately. In many domains, human expertise in the form of hierarchical reduction schemas exists, but...
Validation Structure Based Theory of Plan Modification and Reuse, (1997)
Kambhampati, Subbarao, Hendler, James A.
A framework for the flexible and conservative modification of plans enables a planner to modify its plans in response to incremental changes in their specifications, to reuse its existing plans in...
A structured approach for synthesizing planners from specifications (1997)
Biplav Srivastava, Subbarao Kambhampati, Amol D. Mali
Plan synthesis approaches in AI fall into two categories: domain-independent and domain-dependent. The domainindependent approaches are applicable across a variety of domains, but may not be very...
A structured approach for synthesizing planners from specifications (1997)
Biplav Srivastava, Subbarao Kambhampati, Amol D. Mali
Plan synthesis approaches in AI fall into two categories: domain-independent and domain-dependent. The domainindependent approaches are applicable across a variety of domains, but may not be very...
Planning for Information Gathering: A Tutorial Survey (1997)
Eric Lambrecht, Subbarao Kambhampati
We discuss the problem of information gathering, which is that of integrating multiple heterogeneous information sources so they appear as a single information source that a user can pose queries on....
Laurie Ihrig, Subbarao Kambhampati
Case-Based Planning (CBP) provides a way of scaling up domain-independent planning to solve large problems in complex domains. It replaces the detailed and lengthy search for a solution with the...
Process Planner's Assistant: An Interactive And Iterative Approach To . . . (1997)
X. Li, Xiaomin Li, Subbarao Kambhampati, Kartheek Hirode, Jami Shah
Most existing approaches to computer aided process planning aim for full automation by searching for a plan that is optimal with respect to a pre-specified objective function. Such full automation is...
A Structured Approach for Synthesizing Planners from Specifications (1997)
Biplav Srivastava, Subbarao Kambhampati, Amol D. Mali
Plan synthesis approaches in AI fall into two categories: domain-independent and domain-dependent. The domainindependent approaches are applicable across a variety of domains, but may not be very...
Understanding and Extending Graphplan (1997)
Subbarao Kambhampati, Eric Parker, Eric Lambrecht
We provide a reconstruction of Blum and Furst's Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstruction, the process...
The ideas of intelligent backtracking (IB) and explanation based learning (EBL) have developed independently in the constraint satisfaction, planning, machine learning and problem solving...
Laurie H. Ihrig, Subbarao Kambhampati
Case-Based Planning (CBP) provides a way of scaling up domain-independent planning to solve large problems in complex domains. It replaces the detailed and lengthy search for a solution with the...
Process Planner’s Assistant : An Interactive and Iterative Approach to Automating (1997)
Xiaomin Li, Kartheek Hirode, Subbarao Kambhampati, Jami Shah
Most existing approaches to computer aided process planning aim for full automation by searching for a plan that is optimal with respect to a pre-speci ed objective function. Such full automation is...
Planning for information gathering: A tutorial survey (1997)
Eric Lambrecht, Subbarao Kambhampati
We discuss the problem of information gathering, which isthatofintegrating multiple heterogeneous information sources so they appear as a single information source that a user can pose queries on. We...
Refinement planning: status and prospectus (1996)
Most current-day AI planning systems operate by iteratively refining a partial plan until it meets the goal requirements. In the past five years, significant progress has been made in our...
Subbarao Kambhampati, Suresh Katukam, Yong Qu
Given the intractability of domain-independent planning, the ability to control the search of a planner is vitally important. One way of doing this involves learning from search failures. This paper...
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving communities. In this...
Unifying classical planning approaches (1996)
Subbarao Kambhampati, Biplav Srivastava
State space and plan space planning approaches have traditionally been seen as fundamentally different and competing approaches to domain-independent planning. We present a plan representation and a...
Subbarao Kambhampati, Suresh Katukam, Yong Qu
Given the intractability of domain-independent planning, the ability to control the search of a planner is vitally important. One way of doing this involves learning from search failures. This paper...
A Candidate Set based analysis of Subgoal Interactions in conjunctive goal planning (1996)
Subbarao Kambhampati, Laurie Ihrig, Biplav Srivastava
Subgoal interactions have received considerable attention in AI Planning. Earlier analyses by Korf [11] and Joslin and Roach [6] were done in terms of the topology of the space of world states. More...
Learning Search Control rules for Plan-space Planners: Factors affecting the performance (1996)
Given the intractability of domain-independent planning, learning effective search control knowledge is vitally important. One way of learning search control knowledge is to use explanation based...
Design and Implementation of a Replay Framework based on a Partial Order Planner (1996)
Laurie H. Ihrig, Subbarao Kambhampati
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational snlp+ebl), which is based within a partial order planner. dersnlp+ebl replays...
On the role of Disjunctive Representations and Constraint Propagation in Refinement Planning (1996)
Subbarao Kambhampati, Xiuping Yang
Most existing planners intertwine the refinement of a partial plan with search by pushing the individual refinements of a plan into different search branches. Although this approach reduces the cost...
The ideas of dependency directed backtracking (DDB) and explanation based learning (EBL) have developed independently in constraint satisfaction, planning and problem solving communities. In this...
Admissible Pruning Strategies based on plan minimality for Plan-Space Planning (1996)
Although plan-space planners have been shown to be flexible and efficient in plan generation, they do suffer from the problem of "looping" -- that is, they may spend an inordinate amount of...
Refinement Planning: Status and Prospectus (1996)
Most current-day AI planning systems operate by iteratively refining a partial plan until it meets the goal requirements. In the past five years, significant progress has been made in our...
Planning and Scheduling (1996)
Thomas Dean, Subbarao Kambhampati
this article, we provide a framework for characterizing planning and scheduling problems that focuses on properties of the underlying dynamical system and the capabilities of the planning system to...
Using Disjunctive orderings instead of Conflict Resolution in Partial order planning (1996)
Resolving conflicts in partial order planning by means of promotion and demotion has been an standard idea in least commitment planning for over twenty years. Recent analyses of partial order...
Design and Implementation of a Replay Framework based on a Partial Order Planner (1996)
Laurie H. Ihrig, Subbarao Kambhampati
In this paper we describe the design and implementation of the derivation replay framework, dersnlp+ebl (Derivational SNLP + EBL), which is based on a partial order planner. We provide empirical...
A Candidate Set based analysis of Subgoal Interactions in conjunctive goal planning (1996)
Subbarao Kambhampati, Laurie Ihrig, Biplav Srivastava
Subgoal interactions have received considerable attention in AI Planning. Earlier analyses by Korf [11] and Joslin and Roach [6] were done in terms of the topology of the space of world states. More...
An explanation-based approach to improve retrieval in case-based planning (1995)
Laurie Ihrig, Subbarao Kambhampati
When a case-based planner is retrieving a previous case in preparation for solving a new similar problem, it is often not aware of the implicit features of the new problem situation which determine...
Learning search control rules for plan-space planners: Factors affecting the performance (1995)
Given the intractability of domain-independent planning, learning effective search control knowledge is vitally important. One way of learning search control knowledge is to use explanation based...
Subbarao Kambhampati, Craig A. Knoblock, Qiang Yang
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly...
Subbarao Kambhampati, Craig A. Knoblock, Qiang Yang
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly...
Universal Classical Planner: An algorithm for unifying (1995)
State-Space And Plan-Space, Subbarao Kambhampati, Biplav Srivastava
We present a plan representation and a generalized algorithm template, called UCP, for unifying the classical plan-space and state-space planning approaches within a single framework. UCP models...
Automatic Storage and Indexing of Plan Derivations Based on Replay Failures (1995)
Laurie Ihrig, Subbarao Kambhampati
When a case-based planner is retrieving a previous case in preparation for solving a new similar problem, it is often not aware of all of the implicit features of the new problem situation which...
A Comparative Analysis of Partial Order Planning and Task Reduction Planning (1995)
Although task reduction (HTN) planning historically preceded partial order (PO) planning, and is believed to be more general than the latter, very little comparative analysis of the two planning...
An Explanation-Based Approach to Improve Retrieval in Case-Based Planning (1995)
Laurie Ihrig, Subbarao Kambhampati
When a case-based planner is retrieving a previous case in preparation for solving a new similar problem, it is often not aware of the implicit features of the new problem situation which determine...
Admissible Pruning Strategies based on plan minimality for Plan-Space Planning (1995)
Although plan-space planners have been shown to be flexible and efficient in plan generation, they do suffer from the problem of "looping" -- that is, they may spend an inordinate amount of...
An Iterative and Interactive Approach for Process Planning (1995)
Suresh Batchu, Subbarao Kambhampati, Hirode Kartheek, Jami Shah
Process planning involves producing machining plans for manufacturing mechanical parts. It requires satisfying a variety of hard and soft geometric, kinematic, tolerance based and economic...
Admissible Pruning Strategies based on plan (1995)
Although plan-space planners have been shown to be flexible and efficient in plan generation, they do suffer from the problem of "looping" -- that is, they may spend an inordinate amount of...
Admissible pruning strategies based on plan minimality for planspace planning (1995)
Although plan-space planners have been shown to be flexible and efficient in plan generation, they do suffer from the problem of "looping" -- that is, they may spend an inordinate amount of...
In spite of the long history of classical planning, there has been very little comparative analysis of the search space characteristics of the multitude of existing planning algorithms. This has...
Admissible pruning strategies based on plan minimality for planspace planning (1995)
Although plan space planners have been shown to be flexible and efficient in plan generation, they do suffer from the problem of "looping '- that is they may spend an inordinate amount...
On the nature of modal truth criteria in planning (1994)
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...
Refinement Search as a Unifying Framework for analyzing Planning Algorithms (1994)
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly...
Design Tradeoffs in Partial Order (Plan Space) Planning (1994)
Despite the long history of classical planning, there has been very little comparative analysis of the performance tradeoffs offered by the multitude of existing planning algorithms. This is partly...
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...
Evaluating the Effectiveness of Derivation Replay in Partial-order vs State-space Planning (1994)
Laurie H. Ihrig, Subbarao Kambhampati
Case-based planning involves storing individual instances of problem-solving episodes and using them to tackle new planning problems. This paper is concerned with derivation replay, which is the main...
Derivation Replay for Partial-Order Planning (1994)
Laurie H. Ihrig, Subbarao Kambhampati
Derivation replay was first proposed by Carbonell as a method of transferring guidance from a previous problem-solving episode to a new one. Subsequent implementations have used state-space planning...
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...
Comparing Partial Order Planning and Task Reduction Planning: A preliminary report (1994)
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...
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...
Formalizing a Spectrum of Plan Generalizations Based on Modal Truth Criteria (1994)
Plan generalizations are of considerable importance in improving planning performance through reuse. In this paper, we provide a unified framework for analytic (non-inductive) plan generalization...
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...
Learning Explanation-Based Search Control Rules For Partial Order Planning (1994)
Suresh Katukam, Subbarao Kambhampati
This paper presents snlp+ebl, the first implementation of explanation based learning techniques for a partial order planner. We describe the basic learning framework of snlp+ebl, including...
Comparing Partial Order Planning and Task Reduction Planning: A preliminary report (1994)
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...
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...
Agenda State Space Planners (1994)
Subbarao Kambhampati, Subbarao Kambhampati
Seminar course held at ASU in Spring 93
Formalizing a Spectrum of Plan Generalizations Based on Modal Truth Criteria (1994)
Plan generalizations are of considerable importance in improving planning performance through reuse. In this paper, we provide a unified framework for analytic (non-inductive) plan generalization...
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...
Relative Utility of EBG based Plan Reuse in Partial Ordering vs. Total Ordering Planning (1993)
Subbarao Kambhampati, Jengchin Chen
This paper provides a systematic analysis of the relative utility of basing EBG based plan reuse techniques in partial ordering vs. total ordering planning frameworks. We separate the potential...
Recent work on foundations of partial-order planning has emphasized the importance of systematicity and elimination of redundancy in search space as a way to improve planning performance. In this...
In spite of the long history of classical planning, there has been very little comparative analysis of the search space characteristics of the multitude of existing planning algorithms. This has...
Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation (1992)
Explicit causal structure representations have been widely used in classical planning systems to guide a variety of aspects of planning, including plan generation, modification and generalization....
Multi-Contributor Causal Structures for Planning: A Formalization and Evaluation (1992)
Explicit causal structure representations have been widely used in classical planning systems to guide a variety of aspects of planning, including plan generation, modification and generalization....
this paper, based on our experience in designing pla euse and modification framework, we attempted a categorization e a of classes of plan modification strategies based on their coverag nd...
Planning in Concurrent Domains (1990)
Subbarao Kambhampati, Jay M. Tenenbaum
In many real-world situations, a planner is part of an integrated problem-solving environment and must operate concurrently with other planners and special purpose inference engines. Unlike the...
Subbarao Kambhampati, James A. Hendler
A validation-structure-based theory of plan modification and reuse
A theory of plan modification (1990)
We present a theory of plan modification applicable to hierarchical no&ear planning. Our theory utilizes the validation structure of the stored plans to yield a flexible and conservative plan...
Planning in Concurrent Domains (1990)
Subbarao Kambhampati Center, Subbarao Kambhampati
In many real-world situations, a planner is part of an integrated problem-solving environment and must operate concurrently with other planners and special purpose inference engines. Unlike the...
Thesis (Ph. D.)--University of Maryland at College Park, 1989.
Control of Refitting during Plan Reuse (1989)
Subbarao Kambhampati, James A. Hendler
In plan reuse, refitting is the process of modifying an existing plan to make it applicable to a new problem situation. An efficient refitting strategy needs to be conservative, i.e., it should...
Universal Classical Planner: An algorithm for unifying State-space and Plan-space planning
Subbarao Kambhampati, Biplav Srivastava
We present a plan representation and a generalized algorithm template, called UCP, for unifying the classical plan-space and state-space planning approaches within a single framework. UCP models...
Encoding HTN Planning in Propositional Logic
Amol D. Mali, Subbarao Kambhampati
Casting planning problems as propositional satisfiability problems has recently been shown to be an effective way of scaling up plan synthesis. Until now, the benefits of this approach have only been...