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...
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...
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...
Improved Adaptation of Web Service Compositions using Value of Changed Information (2007)
Girish Chafle, Prashant Doshi, John Harney, Sumit Mittal, Biplav Srivastava
Workflows often operate in volatile environments in which the component services ’ QoS changes frequently. Optimally adapting to these changes becomes an important problem that must be addressed by...
Domain independent approaches for finding diverse plans. IJCAI (2007)
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevini
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a domain-independent...
Domain independent approaches for finding diverse plans. IJCAI (2007)
Biplav Srivastava, Tuan A. Nguyen, Alfonso Gerevini
In many planning situations, a planner is required to return a diverse set of plans satisfying the same goals which will be used by the external systems collectively. We take a domain-independent...
Understanding Approaches for Web Service Composition and Execution (2007)
Vikas Agarwal, Girish Chafle, Sumit Mittal, Vikas Agarwal, Girish Chafle, Sumit Mittal, ...
publication outside of IBM and will probably be copyrighted is accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of...
A Service Creation Environment Based on End to End Composition of Web Services (2005)
Vikas Agarwal, Koustuv Dasgupta, Neeran Karnik, Arun Kumar, Ashish Kundu, Sumit Mittal, ...
increasingly becoming a business imperative today. Application development is often done in an ad hoc manner, without standard frameworks or libraries, thus resulting in poor reuse of software...
The Case for Automated Planning in Autonomic Computing (2005)
Computing systems have become so complex that the IT industry recognizes the necessity of deliberative methods to make these systems self-configuring, self-healing, selfoptimizing and...
Planning with workflows - an emerging paradigm for web service composition (2004)
In a previous work, we had analyzed the gaps in the prevalent approaches (i.e., Semantic Web Services and WSDLdescribed Web Services) for the problems of modeling, composing, executing, and verifying...
Web Service Composition - Current Solutions and Open Problems (2003)
Biplav Srivastava, Jana Koehler
Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based...
Web service composition - current solutions and open problems (2003)
Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based...
Web service composition - current solutions and open problems (2003)
Composition of Web services has received much interest to support business-to-business or enterprise application integration. On the one side, the business world has developed a number of XML-based...
Efficient planning by effective resource reasoning /--by Biplav Srivastava. (2000)
Thesis (Ph. D.)--Arizona State University, 2000.
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...
Efficient Planning By Effective Resource Reasoning (2000)
Biplav Srivastava, Biplav Srivastava
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...
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...
RealPlan: Decoupling Causal and Resource Reasoning in Planning (2000)
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where increase in resources...
RealPlan: Decoupling Causal and Resource Reasoning in Planning (2000)
Recent work has demonstrated that treating resource reasoning separately from causal reasoning can lead to improved planning performance and rational resource management where increase in resources...
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...
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...
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...
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...
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...
Hybrid Planning for Partially Hierarchical Domains (1998)
Subbarao Kambhampati Amol, 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...
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...
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...
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...
Using refinement search to unify and synthesize classical planners /--by Biplav Srivastava. (1996)
Thesis (M.S.)--Arizona State University, 1996.
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...
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...
Using Refinement Search To Unify And Synthesize Classical Planners (1996)
Biplav Srivastava, Biplav Srivastava
Though domain-dependent planners can be more efficient than general-purpose planners, no flexible and straight-forward framework is available to generate them. The trend in implementing planners has...
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...
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...
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...