default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4. ECP 1997: Toulouse, France
- Sam Steel, Rachid Alami:
Recent Advances in AI Planning, 4th European Conference on Planning, ECP'97, Toulouse, France, September 24-26, 1997, Proceedings. Lecture Notes in Computer Science 1348, Springer 1997, ISBN 3-540-63912-8 - Patrick Albers, Malik Ghallab:
Context Dependent Effects in Temporal Planning. 1-12 - Naveen Ashish, Craig A. Knoblock
, Alon Y. Levy:
Information Gathering Plans With Sensing Actions. 13-25 - Ruth Aylett, Alexandra M. Coddington, David P. Barnes, Robert A. Ghanea-Hercock:
What Does a Planner Need to Know About Execution? 26-38 - Ruth Aylett, Gary J. Petley, Paul W. H. Chung, James K. Soutter, Andrew G. Rushton:
Planning and Chemical Plant Operating Procedure Synthesis: A Case Study. 39-51 - Marco Baioletti, Stefano Marcugini, Alfredo Milani:
Task Planning and Partial Order Planning: A Domain Transformation Approach. 52-63 - Michael Beetz, Drew V. McDermott:
Expressing Transformations of Structured Reactive Plans. 64-76 - Michael Beetz, Drew V. McDermott:
Fast Probabilistic Plan Debugging. 77-90 - Andrew Burgess, Sam Steel:
Quantification in Generative Refinement Planning. 91-103 - Marcos A. Castilho, Olivier Gasquet, Andreas Herzig:
Modal Tableaux for Reasoning About Actions and Plans. 104-116 - Amedeo Cesta, Cristiano Stella:
A Time and Resource Problem for Planning Architectures. 117-129 - Alessandro Cimatti, Fausto Giunchiglia, Enrico Giunchiglia, Paolo Traverso:
Planning via Model Checking: A Decision Procedure for AR. 130-142 - Célia da Costa Pereira, Frédérick Garçia, Jérôme Lang, Roger Martin-Clouaire:
Possibilistic Planning: Representation and Complexity. 143-155 - Giuseppe De Giacomo, Luca Iocchi, Daniele Nardi, Riccardo Rosati:
Planning with Sensing for a Mobile Robot. 156-168 - Yannis Dimopoulos, Bernhard Nebel, Jana Koehler:
Encoding Planning Problems in Nonmonotonic Logic Programs. 169-181 - Tara A. Estlin, Steve A. Chien, Xuemei Wang:
An Argument for a Hybrid HTN/Operator-Based Approach to Planning. 182-194 - Maria Fox:
Natural Hierarchical Planning Using Operator Decomposition. 195-207 - Ramón García-Martínez, Daniel Borrajo:
Planning, Learning, and Executing in Autonomous Systems. 208-220 - B. Cenk Gazen, Craig A. Knoblock:
Combining the Expressivity of UCPOP with the Efficiency of Graphplan. 221-233 - Robert Givan, Sonia M. Leach, Thomas L. Dean:
Bounded Parameter Markov Decision Processes. 234-246 - Richard T. Hepplewhite, Jeremy W. Baxter:
Planning and Search Techniques for Intelligent Behaviour of Battlefield Entities. 247-259 - Subbarao Kambhampati, Eric Parker, Eric Lambrecht:
Understanding and Extending Graphplan. 260-272 - Jana Koehler, Bernhard Nebel, Jörg Hoffmann, Yannis Dimopoulos:
Extending Planning Graphs to an ADL Subset. 273-285 - Fabio Massacci:
Breaking Security Protocols as an AI Planning Problem. 286-298 - Silvia Miksch, Yuval Shahar, Werner Horn, Christian Popow, Franz Paky, Peter D. Johnson:
Time-Oriented Skeletal Plans: Support to Design and Execution. 299-311 - Ion Muslea:
SINERGY: A Linear Planner Based on Genetic Programming. 312-324 - Hector Muñoz-Avila, Frank Weberskirch:
A Case Study on the Mergeability of Cases with a Partial-Order Planner. 325-337 - Bernhard Nebel, Yannis Dimopoulos, Jana Koehler:
Ignoring Irrelevant Facts and Operators in Plan Generation. 338-350 - Angelo Oddi, Amedeo Cesta:
A Tabu Search Strategy to Solve Scheduling Problems with Deadlines and Complex Metric Constraints. 351-363 - Nilufer Onder, Martha E. Pollack:
Contingency Selection in Plan Generation. 364-376 - Marcus Vinicius Santos, Marcio Rillo:
Approaching the Plans are Programs Paradigm Using Transaction Logic. 377-389 - Murray Shanahan:
Event Calculus Planning Revisited. 390-402 - J. E. Spragg, G. Fozzard, D. J. Tyler:
Constraint-Based Reactive Rescheduling in a Stochastic Environment. 403-413 - Reiko Tsuneto, Dana S. Nau, James A. Hendler:
Plan-Refinement Strategies and Search-Space Size. 414-426 - Xuemei Wang, Steve A. Chien:
Replanning Using Hierarchical Task Network and Operator-Based Planning. 427-439 - Richard Washington:
BI-POMDP: Bounded, Incremental, Partially-Observable Markov-Model Planning. 440-451
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-03-18 20:32 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:
