154 citations · 1.1k across the 66 of their papers we have counts for
11 papers · 1 filter
Loosely Coupled Formulations for Automated Planning: An Integer Programming Perspective
Menkes Hector Louis van den Briel, 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 corr…
Optiplan: Unifying IP-based and Graph-based Planning
S. Kambhampati, M. H. L. van den Briel
The Optiplan planning system is the first integer programming-based planner that successfully participated in the international planning competition. This engineering note describe…
Click Efficiency: A Unified Optimal Ranking for Online Ads and Documents
Raju Balakrishnan, Subbarao Kambhampati
Traditionally the probabilistic ranking principle is used to rank the search results while the ranking based on expected profits is used for paid placement of ads. These rankings t…
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…
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…
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…