default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICAPS 2005: Monterey, California, USA
- Susanne Biundo, Karen L. Myers, Kanna Rajan:
Proceedings of the Fifteenth International Conference on Automated Planning and Scheduling (ICAPS 2005), June 5-10 2005, Monterey, California, USA. AAAI 2005, ISBN 1-57735-220-3
Applications of Planning and Scheduling
- Marco Pistore, Paolo Traverso, Piergiorgio Bertoli:
Automated Composition of Web Services by Planning in Asynchronous Domains. 2-11 - Mark S. Boddy, Johnathan Gohde, Thomas Haigh, Steven A. Harp:
Course of Action Generation for Cyber Security Using Classical Planning. 12-21 - Pascal Van Hentenryck, Yannis Vergados:
Minimizing Breaks in Sport Scheduling with Local Search. 22-29 - Wheeler Ruml, Minh Binh Do, Markus P. J. Fromherz:
On-line Planning and Scheduling for High-speed Manufacturing. 30-39 - John L. Bresina, Ari K. Jónsson, Paul H. Morris, Kanna Rajan:
Activity Planning for the Mars Exploration Rovers. 40-49
Search for Planning and Scheduling
- Stefan Edelkamp:
External Symbolic Heuristic Search with Pattern Databases. 51-60 - Matthew J. Streeter, Stephen F. Smith:
Charecterizing the Distribution of Low-Makespan Schedules in the Job Shop Scheduling Problem. 61-70 - Jörg Hoffmann, Ronen I. Brafman:
Contingent Planning via Heuristic Forward Search witn Implicit Belief States. 71-80 - Daniel Godard, Philippe Laborie, Wim Nuijten:
Randomized Large Neighborhood Search for Cumulative Scheduling. 81-89 - Rong Zhou, Eric A. Hansen:
Beam-Stack Search: Integrating Backtracking with Beam Search. 90-98 - Maxim Likhachev, Sven Koenig:
A Generalized Framework for Lifelong Planning A* Search. 99-108
Temporal Planning
- T. K. Satish Kumar:
On the Tractability of Restricted Disjunctive Temporal Problems. 110-119 - Mausam, Daniel S. Weld:
Concurrent Probabilistic Temporal Planning. 120-129 - Froduald Kabanza, Sylvie Thiébaux:
Search Control in Planning for Temporally Extended Goals. 130-139
Planning and Scheduling for Uncertain and Dynamic Environments
- Héctor Palacios, Blai Bonet, Adnan Darwiche, Hector Geffner:
Pruning Conformant Plans by Counting Models on Compiled d-DNNF Representations. 141-150 - H. Brendan McMahan, Geoffrey J. Gordon:
Fast Exact Planning in Markov Decision Processes. 151-160 - Roman van der Krogt, Mathijs de Weerdt:
Plan Repair as an Extension of Planning. 161-170 - Russell Bent, Pascal Van Hentenryck:
Online Stochastic Optimization Without Distributions. 171-180
Overconstrained Problems
- Ronen I. Brafman, Yuri Chernyavsky:
Planning with Goal Preferences and Constraints. 182-191 - Romeo Sanchez Nigenda, Subbarao Kambhampati:
Planning Graph Heuristics for Selecting Objectives in Over-subscription Planning Problems. 192-201 - Bart Peintner, Michael D. Moffitt, Martha E. Pollack:
Solving Over-constrained Disjunctive Temporal Problems with Preferences. 202-211 - Xiaofang Wang, Stephen F. Smith:
Retaining Flexibility to Maximize Quality: When the Scheduler Has the Right to Decide Activity Durations. 212-221
Domain Models and Learning
- Proshanto Mukherji, Lenhart K. Schubert:
Discovering Planning Invariants as Anomalies in State Descriptions. 223-230 - Adi Botea, Martin Müller, Jonathan Schaeffer:
Learning Partial-Order Macros from Solutions. 231-240 - Qiang Yang, Kangheng Wu, Yunfei Jiang:
Learning Actions Models from Plan Examples with Incomplete Knowledge. 241-250
Anytime Planning and Scheduling
- I-Hsiang Shu, Robert T. Effinger, Brian Charles Williams:
Enabling Fast Flexible Planning through Incremental Temporal Reasoning with Conflict Extraction. 252-261 - Maxim Likhachev, David I. Ferguson, Geoffrey J. Gordon, Anthony Stentz, Sebastian Thrun:
Anytime Dynamic A*: An Anytime, Replanning Algorithm. 262-271 - Laurence A. Kramer, Stephen F. Smith:
Maximizing Availability: A Commitment Heuristic for Oversubscribed Scheduling Problems. 272-280
Combined and New Techniques for Planning
- Michael T. Cox, Chen Zhang:
Planning as Mixed-Initiative Goal Manipulation. 282-291 - Markus Büttner, Jussi Rintanen:
Satisfiability Planning with Constraints on the Number of Actions. 292-299 - Ugur Kuter, Dana S. Nau, Marco Pistore, Paolo Traverso:
A Hierarchical Task-Network Planner based on Symbolic Model Checking. 300-309 - Menkes van den Briel, Thomas Vossen, Subbarao Kambhampati:
Reviving Integer Programming Approaches for AI Planning: A Branch-and-Cut Framework. 310-319 - Alexandru Horia Brie, Philippe Morignot:
Genetic Planning Using Variable Length Chromosomes. 320-329
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.
last updated on 2025-12-04 22:06 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
