most citedSAPA: A Multi-objective Metric Temporal Planner

154 citations · 374 across the 7 of their papers we have counts for

collaborators
Showing cs.AIShow all

6 papers · 1 filter

cs.AI201114 cited

AltAltp: Online Parallelization of Plans with Heuristic State Search

S. Kambhampati, R. Sanchez

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 di…

cs.AI2011154 cited

SAPA: A Multi-objective Metric Temporal Planner

M. Do, S. 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 h…

cs.AI201140 cited

Planning Graph as a (Dynamic) CSP: Exploiting EBL, DDB and other CSP Search Techniques in Graphplan

S. Kambhampati

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 t…

cs.AI201122 cited

Synthesizing Robust Plans under Incomplete Domain Models

Tuan Nguyen, Subbarao Kambhampati, Minh Do

Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task. While domain experts…

cs.AI20119 cited

Cost Based Satisficing Search Considered Harmful

William Cushing, J. Benton, Subbarao Kambhampati

Recently, several researchers have found that cost-based satisficing search with A* often runs into problems. Although some "work arounds" have been proposed to ameliorate the prob…

cs.AI2011131 cited

Planning Graph Heuristics for Belief Space Search

D. Bryce, S. Kambhampati, D. 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 distan…