Recent papers from Yochan</>


Recent papers from
YOCHAN:


If you got here directly, check out the Yochan Group Homepage for an overview of our activities. The surveys page contains surveys and tutorials we have written.

Following is the list of papers organized by year of publication.

Contact Subbarao Kambhampati by email if you have questions or need further information.

Page accessed times since 2/17/96.


2004

  1. A frequency-based approach for mining coverage statistics in Data Integration.
    Zaiqing Nie and Subbarao Kambhampati. ICDE 2004 (To appear).

  2. Optimizing Recursive Information Gathering Plans in EMERAC.
    S. Kambhampati, E. Lambrecht, U. Nambiar, Z. Nie and G. Senthil. Journal of Intelligent Information Systems. Vol 22, No. 2. February 2004.pp. 119-153. (To appear).

2003

  1. AltAlt-p: Online parallelization of plans with heuristic state search.
    Romeo Sanchez and Subbarao Kambhampati. To appear in JAIR. Volume 19. pp. 631-657. Published: 12/03.
    An extended abstract appears in Proc. IJCAI 2003

  2. Answering Imprecise Database Queries
    Ullas Nambiar and Subbarao Kambhampati. ACM WIDM 2003 (Workshop on Web Information and Data Management).

  3. Information Integration On the Web (Guest Editor's Introduction).
    Subbarao Kambhampati, Craig Knoblock
    IEEE Intelligent Systems. October 2003. (Here is the special issue.)

  4. 1001 ways to skin a planning graph for heuristic fun and profit.
    Subbarao Kambhampati. Slides from the Invited Talk. ICAPS 2003.

  5. Using memory to transform search on the planning graph
    Terry Zimmerman and Subbarao Kambhampati. Submitted for publication.
    An extended abstract appears in Proc. IJCAI 2003

  6. Learning-assisted automated planning: Looking back, taking stock, going forward
    Terry Zimmerman and Subbarao Kambhampati. AI Magazine 24(2):73-96. Summer 2003

  7. Integration of Bioinfomratic Sources: Current Approaches and Systems
    Thomas Hernandez and Subbarao Kambhampati, ASU CSE TR 03-005. July 2003.

  8. Bibfinder/Statminer: Effectively mining and using Coverage and Overlap Statistics in Data Integration
    Zaiqing Nie, Subbarao Kambhampati and Thomas Hernandez. Proc. VLDB 2003. Here is the poster

  9. Frequency-based Coverage Statistics Mining for Data Integration.
    Zaiqing Nie, Subbarao Kambhampati. IJCAI Workshop on Information Integration on the Web. 2003.

  10. A Critique of Knowledge-based planning track at ICP
    Subbarao Kambhampati. Position paper to be presented at the ICAPS Workshop on the Competition: Impact, Organization, Evaluation and Benchmarks. 2003. Here are the talk slides

  11. Heuristic guidance measures for Conformant Planning
    Dan Bryce and Subbarao Kambhampati. ICAPS workshop on Planning under uncertainty and incomplete information. 2003

  12. Sapa: A Scalable Multi-Objective Metric Temporal Planner
    Minh B. Do and Subbarao Kambhampati. Journal of Artificial Intelligence Research. To appear.

  13. Improving the Temporal Flexibility of Position Constrained Metric Temporal Plans.
    Minh B. Do and Subbarao Kambhampati. ASU CSE TR02-003. In Proc. ICAPS 2003.

2002

  1. Research Issues at the Intersection of Planning and Constraint Programming.
    A. Naryek and S. Kambhampati. Constraints Journal. Special Issue on Planning. 2002.

  2. Mining Coverage Statistics for Websource Selection in a Mediator
    Z.Nie, U. Nambiar, S. Lakshmi and S. Kambhampati. ASU CSE TR 02-008. (A short version of this paper appears in Proceedings of CIKM 2002). See the Havasu homepage.

  3. Planning Graph-based heuristics for Cost-sensitive Temporal Planning
    Minh B. Do and Subbarao Kambhampati. AIPS 2002.

  4. Planning Graph as the Basis for deriving Heuristics for Plan Synthesis by State Space and CSP Search.
    XuanLong Nguyen, Subbarao Kambhampati and Romeo Sanchez Nigenda.
    ASU Technical Report. To appear in Artificial Intelligence.
    (PDF)
    See AltAlt Homepage!

  5. Generating parallel plans satisfying multiple criteria in anytime fashion.
    Terry Zimmerman and Subbarao Kambhampati. Presented at the AIPS 2002 Workshop on Planning and Scheduling with Multiple Criteria.

2001

  1. Mining Source Coverage Statistics for Data Integaration
    Zaiqing Nie, Subbarao Kambhampati, Ullas Nambiar and Sreelakshmi Vaddi. To appear in Proc. Proc. 3rd Intl. Workshop on Web Information and Data Management (WIDM) 2001.

  2. Joint optimization of cost and coverage of query plans in data integration
    Zaiqing Nie and Subbarao Kambhampati. To appear in Proc. ACM CIKM 2001.

  3. Sapa: A Domain-Independent Heuristic Metric Temporal Planner
    Minh B. Do and Subbarao Kambhampati. ECP 2001. To appear.

  4. Effective interplay of state-space and CSP views in a single planner
    Terry Zimmerman and Subbarao Kambhampati. Submitted for publication.

  5. Reviving Partial Order Planning
    XuanLong Nguyen, Subbarao Kambhampati. Proc. IJCAI-2001. Here are the slides from IJCAI-01 talk.

  6. Planning as Constraint Satisfaction: Solving the planning graph by compiling it into CSP.
    Minh B. Do and Subbarao Kambhampati. ASU Technical Report. To appear in Artificial Intelligence. (extended version of a paper presented at AIPS-2000).
    (Postscript) (PDF)
    Home page for GP-CSP.

  7. Planning the Project Management Way: Efficient Planning by Effective Integration of Causal and Resource Reasoning in RealPlan.
    Biplav Srivastava, Subbarao Kambhampati, Binh Minh Do
    To appear in Artificial Intelligence
    (Postscript) (PDF) See the RealPlan Homepage.

2000

  1. Integrating Planning and Scheduling: Status and Prospects. Subbarao Kambhampati. Slides of the Invited Talk at KBCS 2000 (Bombay, India, December 2000).

  2. AltAlt: Combining the advantages of Graphplan and Heuristics State Search.
    XuanLong Nguyen, Subbarao Kambhampati and Romeo Sanchez Nigenda.
    In Proc. International Conference on Knowledge-based Computer Systems. Bombay, India. December 2000. (Postscript) (PDF)
    Here are the talk slides.
    See AltAlt Homepage!

  3. ASUPPA: A Framework for Interactive and Iterative Synthesis and Improvement of Process Plans Xialomin Li, Subbarao Kambhampati and Jami Shah. Computers and Information in Engineering Conferene. (ASME 2000 Desighn Engineering Technical Conferences).

  4. Extracting effective and admissible heuristics from the Planning Graph XuanLong Nguyen and Subbarao Kambhampati. In Proc. AAAI-00

  5. RealPlan: Decoupling Causal and Resource Reasoning in Planning Biplav Srivastava. Appears in AAAI-00

  6. Solving Planning Graph by Compiling it into a CSP Binhminh Do and Subbarao Kambhampati. In Proc. AIPS-2000.

  7. Distance based goal ordering heuristics for Graphplan Subbarao Kambhampati and Romeo Sanchez Nigenda. In Proc. AIPS-2000.

  8. Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning P Binhminh Do, Biplav Srivastava and Subbarao Kambhampati. In Proc. AIPS-2000.

  9. Efficiently gathering information on the Internet using AI&DB techniques: The Emerac Project. Talk and project link by S. Kambhampati

  10. Planning Graph as (dynamic) CSP: Exploiting EBL, DDB and other CSP Techniques in Graphplan
    S. Kambhampati. Journal of Artificial Intelligence research (JAIR). 2000.
    shorter version appears in IJCAI-99.The slides from IJCAI talk

1999

  1. Improving Graphplan's search with EBL and DDB techniques. In Proc. IJCAI-1999.

  2. Recent Advances in AI Planning: A Unifying View. Tutorial presented at IJCAI-99. S. Kambhampati

  3. Scaling up planning by teasing out resource scheduling
    B. Srivastava & S. Kambhampati. ASU CSE TR 99-005. Appears in ECP-99. A shorter version Presented at AAAI Spring Symposium on Search Strategies. Here are the talk slides. .

  4. On the utility of Plan-space (causal) Encodings
    A. Mali & S. Kambhampati. In Proc. AAAI-99. (Postscript) (PDF) (Slides of the AAAI Talk)

  5. Exploiting the symmertry in the Planning-graph via Explanation-guided Search
    T. Zimmerman & S. Kambhampati. In Proc. AAAI-99.. (Postscript) (PDF)

  6. Optimizing recursive information gathering plans
    E. Lambrecht, S. Kambhampati and S. Gnanaprakasam. In Proc. IJCAI-99 Talk slides

  7. Optimizing source-call ordering in information gathering plans
    S. Kambhampati and S. Gnanaprakasam. IJCAI-99 Workshop on Intelligent Information Integration. Talk slides

1998

  1. Winning by being Lazy: Hierarchy, Abstraction and Least-commitment in the new-age planning
    S. Kambhampati. Invited talk at
    NIPS-98 workshop on Abstraction and Hierarchy in Reinforcement Learning.

  2. Optimization Strategies for Information Gathering Plans
    E. Lambrecht and S. Kambhampati. November 98. (A shorter version is accepted for presentation at IJCAI-99.)
    ASU CSE TR 98-018

  3. On the relations between intelligent backtracking and explanation based learning in Planning and CSP
    S. Kambhampati
    ASU CSE TR 97-018. Artificial Intelligence, Spring 1999

  4. Encoding HTN planning in propositional logic
    A. Mali and S. Kambhampati
    In Proc. AIPS-98. 1998.

  5. Hybrid planning for partially hierarchical domains
    S. Kambhampati, A. Mali and B. Srivastava.
    In Proc. AAAI-98. 1998. Here is the talk

  6. Frugal propositional encodings for planning
    A. Mali and S. Kambhampati.
    AIPS Workshop on Planning as Combinatorial Search. 1998.

  7. Refinement based planning as satisfiability
    A. Mali and S. Kambhampati.
    AIPS Workshop on Planning as Combinatorial Search. 1998.

  8. Distributed Planning
    A. Mali and S. Kambhampati.
    Survey paper to appear in Encyclopedia of Distributed Computer Science. 1998.

  9. Efficiently executing information gathering plans
    E. Lambrecht and S. Kambhampati.
    AAAI workshop on AI and Information Integration. 1998.

  10. Understanding and Extending Graphplan
    S. Kambhampati, E. Lambrecht and E. Parker
    To be presented at the 4th european conference on planning, 1997 Here is the talk

  11. Synthesizing customized planners from specifications
    B. Srivastava and S. Kambhampati
    Journal of Artificial Intelligence Research. Volume 8. pp 93-128. 1998.
    Reviewed in "The page of positive reviews"

1997

  1. Storing and Indexing plan derivations through explanation-based analysis of retrieval failures
    L. Ihrig and S. Kambhampati
    Journal of Artificial Intelligence, Vol 7, pp. 161-198. 1997.

  2. A structured approach for synthesizing planners from specifications
    B. Srivastava, A. Mali and S. Kambhampati
    12th IEEE Intl. Conf. on Automated Software Engineering, 1997, Lake Tahoe. (To appear)

  3. Challenges in bridging plan-synthesis paradigms
    S. Kambhampati
    To appear as a Challenge paper at IJCAI-97. Here is the challenge homepage

  4. Planning for Information Gathering: A Tutorial Survey
    E. Lambrecht and S. Kambhampati
    ASU CSE TR 97-017, May 1997.

  5. Process Planner's Assistant: An incremental and interactive approach to automating process planning
    X. Li, S. Kambhampati, K. Hirode and J. Shah
    ASME Design Engineering Techical Conference, 1997 (To appear) Compressed version.

  6. Refinement planning as a unifying framework for plan synthesis
    S. Kambhampati
    AI Magazine, Vol 18. No. 2, Summer, 1997. Here is the pdf version of the article as it appears in AI Magazine.
    (Here is an independent survey of this stuff written by someone from Finland...)

  7. Failure Driven Dynamic Search Control for Partial Order Planners: An explanation-based approach
    S. Kambhampati, S. Katukam, Y. Qu
    Artificial Intelligence. 88(1-2), 1997 ASU CSE TR-95-010.

1996

  1. On the role of Disjunctive representations and Constraint Propagation in Refinement Planning
    S. Kambhampati and X. Yang
    Final version of a paper to appear in KRR-96.
    Here is the talk on the paper delivered at KR-96, November 5th, 1996 HTML versionPostscript Version

  2. Design and Implementation of a Replay Framework based on a Partial order Planner.
    L. Ihrig and S. Kambhampat
    AAAI-96

  3. Theoretical Contributions of Artificial Intelligence
    Subbarao Kambhampati. IEEE Computer. Vol. 29 Issue 10.

  4. Refinement planning: Status and Prospectus
    S. Kambhampati.
    AAAI-96 invited talk.
    Color slides (with commentary) ( HTML version or ( Postscript or Compressed Postscript)
    Black and white slides (with commentary) ( Postscript or Compressed Postscript)
    Proceedings paper (a bit dated; talk is more up to date) ( Postscript)

  5. Formalizing Dependency Directed Backtracking and Explanation-based Learning in Refinement Search.
    S. Kambhampati,
    AAAI-96

  6. Unifying Classical Planning Approaches
    S. Kambhampati and B. Srivastava
    ASU CSE Technical Report 96-006. (59 pages) (Submitted for publication)

  7. A Candidate Set based analysis of subgoal interactions in conjunctive goal planning
    S. Kambhampati, L. Ihrig and B. Srivastava
    AIPS-96.

  8. On the nature and role of modal truth criteria in planning
    S. Kambhampati & D.S. Nau
    Artificial Intelligence, 88(1-2). 1996.

1995

  1. Planning and Scheduling
    T. Dean and S. Kambhampati
    CRC Handbook of Computer Science and Engineering (to appear),1995

  2. AI Planning: A prospectus on theory and applications
    S. Kambhampati
    ACM Computing Survyes: Symposium on Artificial Intelligence, Sept. 1995

  3. Admissible pruning strategies based on plan minimality for plan space planning.
    S. Kambhampati
    Proc. of IJCAI-95.
    Here is an extended version with empirical results and proofs

  4. Integrating Replay with EBL to improve planning performance
    L. Ihrig and S. Kambhampati
    To appear in Proc. 3rd European Planning Workshop (EWSP-95). ASU CSE TR 94-003; January 1995.

  5. Universal Classical Planner: An algorithm for unifying state-space and plan-space planning
    S. Kambhampati and B. Srivastava
    To appear in Proc. 3rd European Planning Workshop (EWSP-95). ASU CSE TR 94-002; January 1995.

  6. Automatic storage and indexing of plan derivations based on replay failures.
    L. Ihrig and S. Kambhampati
    In Proc. of IJCAI Workshop on formal methods for reuse of plans, proofs and programs. 1995.

  7. Learning control rules for expressive plan-space planners: Factors influencing the performance
    Y. Qu and S. Kambhampati
    To appear in Proc. 3rd European Planning Workshop (EWSP-95). ASU CSE TR 95-006.

  8. Planning as Refinement Search: A unified framework for evaluating design tradeoffs in partial order planning
    S. Kambhampati, C. Knoblock and Q. Yang
    ASU CSE TR 94-002, Artificial Intelligence Special Issue on Planning and Scheduling. 1995. Here is a Link to the code, data and results of the experiments reported in the paper.(~0.5 Meg)

  9. A comparative analysis of partial order planning and task reduction planning
    S. Kambhampati
    SIGART Bulletin, Special Section on Evaluating Plans, Planners and Planning agents, Vol. 6., No. 1, January, 1995.

  10. An Iterative and Interactive approach for Process Planning
    S. Bathcu, S. Kambhampati, H. Kartheek and J. Shah
    ASU CSE TR 95-023, September 1995.

1994

  1. Multi-Contributor Causal Structures for Planning: A formalization and Evaluation.
    S. Kambhampati
    Artificial Intelligence, Vol. 69, 1994

  2. Derivational replay for partial order planning
    L. Ihrig and S. Kambhampati
    In Proceedings of AAAI-94

  3. Plan-space vs. State-space planning in reuse and replay
    L. Ihrig and S. Kambhampati
    ASU CSE TR 94-006, Revised December 1996

  4. Evaluating the Effectiveness of Derivation Replay in Partial-Order vs. State-Space Planning
    L. Ihrig and S. Kambhampati
    In Proceedings of AAAI-94 Workshop on Case-Based Reasoning

  5. Exploiting causal structure to control retrieval and refitting during plan reuse.
    S. Kambhampati
    Computational Intelligence, Vol 10, No 2, May 1994
    (available in hardcopy only)

  6. Refinement search as a unifying framework for analyzing plan space planners
    S. Kambhampati
    In Proceedings of 2nd Intl. Conf on Ppls. Knowledge Rep. and Reasoning, 1994

  7. Design Tradeoffs in partial order (plan space) planning
    S. Kambhampati
    In Proceedings of 2nd Intl. Conf on AI Planning Systems, 1994

  8. Comparing Partial order planning and Task Reduction planning: A preliminary report
    S. Kambhampati
    In Working notes of AAAI-94 workshop on Comparative analysis of planning algorithms
    (also ASU-CSE TR 94-001, March, 1994)

  9. Planning as Refinement Search: A unified framework for comparative analysis of search space size and performance
    S. Kambhampati
    ASU CSE TR 93-004 (an older version of ASU TR 94-002 above)

  10. On the nature of modal truth criteria in planning
    S. Kambhampati and D.S. Nau
    In Proceedings of AAAI-94

  11. Learning Explanation-based search control rules for Partial-order planning
    S. Katukam and S. Kambhampati
    In Proceedings of AAAI-94

  12. A Unified framework for Explanation Based Generalization of Partially ordered and partially instantiated plans.
    S. Kambhampati and S. Kedar.
    Artificial Intelligence, Vol. 67, No. 1, May 1994

  13. Formalizing a spectrum of Plan Generalization based on Modal Truth Criteria
    S. Kambhampati
    Accepted to Canadian AI conf, 94

  14. Classical Planning: Compilation of notes from a Seminar course held at ASU in Spring 94
    S. Kambhampati
    ASU CSE Working Notes 94-008

1993

  1. Integrating General Purpose Planners and Specialized Reasoners: Case Study of a Hybrid Planning Architecture.
    S. Kambhampati, M.R. Cutkoksy, J.M. Tenenbaum and S. Lee
    IEEE Trans. on Systems, Man and Cybernetics, Special issue on Planning, Scheduling and Control, Vol. 23, No. 6, November/December, 1993) An earlier version appears in Proc. AAAI-91.

  2. On the utility of Systematicity: Understanding tradeoffs between redundancy and Commitment during partial order planning.
    S. Kambhampati
    In Proceedings of IJCAI-93

  3. Relative Utility of EBG based Plan Reuse in partial ordering vs. total ordering planning
    S. Kambhampati and J. Chen.
    In Proceedings of AAAI-93

  4. Classical Planning: Compilation of notes from a Seminar course held at ASU in Spring 93
    S. Kambhampati
    ASU CSE Working Notes 93-003
    (If you retrieve this file, please let me know by e-mail)

1992

  1. Characterizing Multi-contributor causal structures for planning
    S. Kambhampati
    In Proceedings of 1st Intl. Conf. on AI Planning Systems, 1992

  2. A Classification of Plan Modification Strategies Based on Coverage and Information Requirements
    S. Kambhampati
    In Working notes of AAAI 90 Spring Symposium on Case-Based Reasoning, 1990

1991

  1. Explanation-based generalization of partially ordered plans. Subbarao Kambhampati and Smadar Kedar. In Proc. AAAI-1991.

  2. Combining specialized reasoners and general purpose planners: A case study. Subbarao Kambhampati, Mark Cutkosky, Marty Tenenbaum, Soo-Hong Lee. . In Proc. AAAI-1991.

1990

  1. A Theory of Plan Modification Subbarao Kambhampati. In Proc. AAAI-1990.

  2. Mapping and retrieval during plan reuse: A Validation based approach. Subbarao Kambhampati. In Proc. AAAI-1990.

  3. Planning in Concurrent Domains
    S. Kambhampati, J.M. Tenenbaum.
    Proceedings of DARPA Workshop on Innovative approaches to planning, scheduling and control. 1990.

1989

  1. Flexible reuse of plans via annotation and verification .
    Kambhampati S.; Hendler, J.A. Proc. 5th Intl. Conf. on Artificial Intelligence for Applications, 1989. pp: 37 -43

1986

  1. Multi-resolution path planning for mobile robots.
    Kambhampati S.; Davis L.S. IEEE Journal of Robotics and Automation. Vol. RA-2, No. 3, September 1986.



Subbarao Kambhampati
Professor
rao@asu.edu