default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICAPS 2004: Whistler, British Columbia, Canada
- Shlomo Zilberstein, Jana Koehler, Sven Koenig:
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), June 3-7 2004, Whistler, British Columbia, Canada. AAAI 2004, ISBN 1-57735-200-9
Cognitive Robotics (Joint ICAPS/KR Session)
- Ronald P. A. Petrick, Fahiem Bacchus:
Extending the Knowledge-Based Approach to Planning with Incomplete Information and Sensing. 2-11 - Yves Martin, Iman Narasamdya, Michael Thielscher:
Knowledge of Other Agents and Communicative Actions in the Fluent Calculus. 12-22 - Alfredo Gabaldon:
Precondition Control and the Progression Algorithm. 23-32 - Jérôme Lang:
A Preference-Based Interpretation of Other Agents' Actions. 33-42
Knowledge in Planning (Joint ICAPS/KR Session)
- Anthony Barrett:
From Hybrid Systems to Universal Plans via Domain Compilation. 44-51 - Hector Geffner:
Planning Graphs and Knowledge Compilation. 52-62 - James P. Delgrande, Torsten Schaub, Hans Tompits:
Domain-Specific Preferences for Causal Reasoning and Planning. 63-72 - Hanna Pasula, Luke S. Zettlemoyer, Leslie Pack Kaelbling:
Learning Probabilistic Relational Planning Rules. 73-82
Search in Planning and Scheduling (Joint ICAPS/KR Session)
- Weixiong Zhang, Xiaotao Zhang:
An Improved Integer Local Search for Complex Scheduling Problems. 83-91 - Rong Zhou, Eric A. Hansen:
Breadth-First Heuristic Search. 92-100 - Jussi Rintanen:
Phase Transitions in Classical Planning: An Experimental Study. 101-110 - Chitta Baral, Thomas Eiter:
A Polynomial Time Algorithm for Constructing k-Maintainable Policies. 111-121
Search in Planning and Scheduling
- Robert C. Holte, Jack Newton, Ariel Felner, Ram Meshulam, David Furcy:
Multiple Pattern Databases. 122-131 - Sharlee Climer, Weixiong Zhang:
A Linear Search Strategy using Bounds. 132-141 - Richard E. Korf:
Optimal Rectangle Packing: New Results. 142-149 - Vincent Vidal:
A Lookahead Strategy for Heuristic Search Planning. 150-160
Classical Planning
- Malte Helmert:
A Planning Heuristic Based on Causal Graph Analysis. 161-170 - Alfonso Gerevini, Alessandro Saetti, Ivan Serina:
An Empirical Analysis of Some Heuristic Features for Local Search in LPG. 171-180 - Adi Botea, Martin Müller, Jonathan Schaeffer:
Using Component Abstraction for Automatic Generation of Macro-Actions. 181-190 - Alan Fern, Sung Wook Yoon, Robert Givan:
Learning Domain-Specific Control Knowledge from Random Walks. 191-199
Scheduling
- Laurent Michel, Pascal Van Hentenryck:
Iterative Relaxations for Iterative Flattening in Cumulative Scheduling. 200-208 - Nicola Policella, Stephen F. Smith, Amedeo Cesta, Angelo Oddi:
Generating Robust Schedules through Temporal Flexibility. 209-218 - Russell Bent, Pascal Van Hentenryck:
The Value of Consensus in Online Stochastic Scheduling. 219-226 - Laura Barbulescu, Adele E. Howe, L. Darrell Whitley, Mark Roberts:
Trading Places: How to Schedule More in a Multi-Resource Oversubscribed Scheduling Problem. 227-234 - Laurence A. Kramer, Stephen F. Smith:
Task Swapping for Schedule Improvement: A Broader Analysis. 235-243 - Jeffrey K. MacKie-Mason, Anna Osepayshvili, Daniel M. Reeves, Michael P. Wellman:
Price Prediction Strategies for Market-Based Scheduling. 244-252 - Riad Aggoune:
Two-Job Shop Scheduling Problems with Availability Constraints. 253-259 - Nicola Muscettola:
Incremental Maximum Flows for Fast Envelope Computation. 260-269
Model Checking and Plan Recognition
- Piergiorgio Bertoli, Marco Pistore:
Planning with Extended Goals and Partial Observability. 270-278 - Robert P. Goldman, Michael J. S. Pelican, David J. Musliner:
Guiding Planner Backjumping Using Verifier Traces. 279-286 - Suchi Saria, Sridhar Mahadevan:
Probabilistic Plan Recognition in Multiagent Systems. 287-296 - Nate Blaylock, James F. Allen:
Statistical Goal Parameter Recognition. 297-305
Probabilistic Planning
- Branislav Kveton, Milos Hauskrecht:
Heuristic Refinements of Approximate Linear Programming for Factored Continuous-State Markov Decision Processes. 306-314 - Dmitri A. Dolgov, Edmund H. Durfee:
Optimal Resource Allocation and Policy Formulation in Loosely-Coupled Markov Decision Processes. 315-324 - Håkan L. S. Younes, Reid G. Simmons:
Policy Generation for Continuous-time Stochastic Domains with Concurrency. 325-334
Nondeterministic Planning
- Rune Møller Jensen, Manuela M. Veloso, Randal E. Bryant:
Fault Tolerant Planning: Toward Probabilistic Uncertainty Models in Symbolic Non-Deterministic Planning. 335-344 - Jussi Rintanen:
Complexity of Planning with Partial Observability. 345-354 - Ronen I. Brafman, Jörg Hoffmann:
Conformant Planning via Heuristic Forward Search: A New Approach. 355-364 - Daniel Bryce, Subbarao Kambhampati:
Heuristic Guidance Measures for Conformant Planning. 365-375
Planning and Scheduling Applications
- Michael H. Bowling, Brett Browning, Manuela M. Veloso:
Plays as Effective Multiagent Plans Enabling Opponent-Adaptive Play Selection. 376-383 - Christopher Kiekintveld, Michael P. Wellman, Satinder Singh, Joshua Estelle, Yevgeniy Vorobeychik, Vishal Soni, Matthew R. Rudary:
Distributed Feedback Control for Decision Making on Supply Chains. 384-392 - David E. Smith:
Choosing Objectives in Over-Subscription Planning. 393-401 - Douglas Aberdeen, Sylvie Thiébaux, Lin Zhang:
Decision-Theoretic Military Operations Planning. 402-412
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 2026-03-20 23:36 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:
