default search action
5th AIPS 2000: Breckenridge, CO, USA
- Steve A. Chien, Subbarao Kambhampati, Craig A. Knoblock:
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, Breckenridge, CO, USA, April 14-17, 2000. AAAI 2000, ISBN 1-57735-111-8
Oral Presentations
- José Luis Ambite, Craig A. Knoblock, Steven Minton:
Learning Plan Rewriting Rules. 3-12 - Marco Baioletti, Stefano Marcugini, Alfredo Milani:
DPPlan: An Algorithm for Fast Solutions Extraction from a Planning Graph. 13-21 - J. Christopher Beck:
Heuristics for Constraint-Directed Scheduling with Inventory. 22-31 - Marcel A. Becker, Stephen F. Smith:
Mixed-Initiative Resource Management: The AMC Barrel Allocator. 32-41 - Michael Beetz, Henrik Grosskreutz:
Probabilistic Hybrid Action Models for Predicting Concurrent Percept-Driven Robot Behavior. 42-51 - Blai Bonet, Hector Geffner:
Planning with Incomplete Information as Heuristic Search in Belief Space. 52-61 - Hyeong Soo Chang, Robert Givan, Edwin K. P. Chong:
On-line Scheduling via Sampling. 62-71 - Rina Dechter:
A New Perspective on Algorithms for Optimizing Policies under Uncertainty. 72-81 - Minh Binh Do, Subbarao Kambhampati:
Solving Planning-Graph by Compiling It into CSP. 82-91 - Filippo Focacci, Philippe Laborie, Wim Nuijten:
Solving Scheduling Problems with Setup Times and Alternative Resources. 92-101 - Maria Fox, Derek Long:
Utilizing Automatically Inferred Invariants in Graph Construction and Search. 102-111 - Alfonso Gerevini, Ivan Serina:
Fast Plan Adaptation through Planning Graphs: Local and Systematic Search Techniques. 112-121 - Judy Goldsmith, Robert H. Sloan:
The Complexity of Model Aggregation. 122-129 - Eric A. Hansen, Zhengzhu Feng:
Dynamic Programming for POMDPs Using a Factored State Representation. 130-139 - Patrik Haslum, Hector Geffner:
Admissible Heuristics for Optimal Planning. 140-149 - Patrik Haslum, Peter Jonsson:
Planning with Reduced Operator Sets. 150-158 - Milos Hauskrecht, Luis E. Ortiz, Ioannis Tsochantaridis, Eli Upfal:
Computing Global Strategies for Multi-Market Commodity Trading. 159-166 - Rune Møller Jensen, Manuela M. Veloso:
OBDD-Based Universal Planning for Multiple Synchronized Agents in Non-Deterministic Domains. 167-176 - Ari K. Jónsson, Paul H. Morris, Nicola Muscettola, Kanna Rajan, Benjamin D. Smith:
Planning in Interplanetary Space: Theory and Practice. 177-186 - Sven Koenig, Yaxin Liu:
Representations of Decision-Theoretic Planning Tasks. 187-195 - Derek Long, Maria Fox:
Automatic Synthesis and Use of Generic Types in Planning. 196-205 - Amnon Lotem, Dana S. Nau:
New Advances in GraphHTN: Identifying Independent Subproblems in Large HTN Domains. 206-215 - Thomas Leo McCluskey:
Object Transition Sequences: A New Form of Abstraction for HTN Planners. 216-225 - Atif M. Memon, Martha E. Pollack, Mary Lou Soffa:
Plan Generation for GUI Testing. 226-235 - Gregg R. Rabideau, Barbara Engelhardt, Steve A. Chien:
Using Generic Preferences to Incrementally Improve Plan Quality. 236-245 - Matthew D. Schmill, Tim Oates, Paul R. Cohen:
Learning Planning Operators in Real-World, Partially Observable Environments. 246-253 - Benjamin D. Smith, Martin S. Feather, Nicola Muscettola:
Challenges and Methods in Testing the Remote Agent Planner. 254-263 - Ioannis Tsamardinos, Martha E. Pollack, John F. Horty:
Merging Plans with Quantitative Temporal Constraints, Temporally Extended Actions, and Conditional Branches. 264-272 - Michel Cayrol, Pierre Régnier, Vincent Vidal:
New Results about LCGP, a Least Committed GraphPlan. 273-282 - Richard J. Wallace, Eugene C. Freuder:
Dispatchable Execution of Schedules Involving Consumable Resources. 283-290
Poster Presentations
- Tamara Babaian, James G. Schmolze:
PSIPLAN: Open World Planning with y-Forms. 292-299 - Steve A. Chien, Russell Knight, Andre Stechert, Rob Sherwood, Gregg R. Rabideau:
Using Iterative Repair to Improve the Responsiveness of Planning and Scheduling. 300-307 - Minh Binh Do, Biplav Srivastava, Subbarao Kambhampati:
Investigating the Effect of Relevance and Reachability Constraints on SAT Encodings of Planning. 308-314 - Subbarao Kambhampati, Romeo Sanchez Nigenda:
Distance-Based Goal-Ordering Heuristics for Graphplan. 315-322 - Kee-Eung Kim, Thomas L. Dean, Nicolas Meuleau:
Approximate Solutions to Factored Markov Decision Processes via Greedy Search in the Space of Finite State Controllers. 323-330 - Jana Koehler, Kilian Schuster:
Elevator Control as a Planning Problem. 331-338 - Russell Knight, Gregg R. Rabideau, Steve A. Chien:
Computing Valid Intervals for Collections of Activities with Shared States and Resources. 339-346 - Marta Cialdea Mayer, Andrea Orlandini, Giulio Balestreri, Carla Limongelli:
A Planning Fully Based on Linear Time Logic. 347-354 - Karen L. Myers:
Planning with Conflicting Advice. 355-362 - Ioannis Refanidis, Ioannis P. Vlahavas:
Exploiting State Constraints in Heuristic State-Space Planning. 363-370 - Ute Schmid, Fritz Wysotzki:
Applying Inductive Program Synthesis to Macro Learning. 371-378 - Austin Tate, John Levine, Peter Jarvis, Jeff Dalton:
Using AI Planning Technology for Army Small Unit Operations. 379-386 - Manuela M. Veloso, Elly Winner, Scott Lenser, James Bruce, Tucker R. Balch:
Vision-Servoed Localization and Behavior-Based Planning for an Autonomous Quadruped Legged Robot. 387-394 - Thierry Vidal:
A Unified Dynamic Approach for Dealing with Temporal Uncertainty and Conditional Planning. 395-402
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.