![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
ICAPS 2012: Atibaia, São Paulo, Brazil
- Lee McCluskey, Brian Charles Williams, José Reinaldo Silva, Blai Bonet:
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, ICAPS 2012, Atibaia, São Paulo, Brazil, June 25-19, 2012. AAAI 2012, ISBN 978-1-57735-562-5 - Sponsors.
- Preface.
- Organizing Committee.
- Program Committee.
- Special Track on Continuous Planning.
Full Papers
- J. Benton, Amanda Jane Coles, Andrew Coles:
Temporal Planning with Preferences and Time-Dependent Continuous Costs. - André A. Ciré, Willem Jan van Hoeve:
MDD Propagation for Disjunctive Scheduling. - Martin C. Cooper, Frederic Maris, Pierre Régnier:
Tractable Monotone Temporal Planning. - Brendan J. Englot, Franz S. Hover:
Sampling-Based Coverage Path Planning for Inspection of Complex Structures. - Maria Fox, Derek Long, Daniele Magazzeni:
Plan-Based Policy-Learning for Autonomous Feature Tracking. - Antonio Garrido, Lluvia Morales, Ivan Serina:
Using AI Planning to Enhance E-Learning Processes. - Avitan Gefen, Ronen I. Brafman:
Pruning Methods for Optimal Delete-Free Planning. - Peter Gregory, Derek Long, Maria Fox, J. Christopher Beck:
Planning Modulo Theories: Extending the Planning Paradigm. - Patrik Haslum:
Incremental Lower Bounds for Additive Cost Planning Problems. - Breelyn Melissa Kane, Reid G. Simmons:
Risk-Variant Policy Switching to Exceed Reward Thresholds. - Erez Karpas, Carmel Domshlak:
Optimal Search with Inadmissible Heuristics. - Michael Katz, Jörg Hoffmann, Malte Helmert:
How to Relax a Bisimulation? - Elena Kelareva, Sebastian Brand, Philip Kilby, Sylvie Thiébaux, Mark Wallace:
CP and MIP Methods for Ship Scheduling with Time-Varying Draft. - Thomas Keller, Patrick Eyerich:
PROST: Probabilistic Planning Based on UCT. - Emil Ragip Keyder, Jörg Hoffmann, Patrik Haslum:
Semi-Relaxed Plan Heuristics. - Scott Kiesel, Ethan Burns, Christopher Makoto Wilt, Wheeler Ruml:
Integrating Vehicle Routing and Motion Planning. - Andrey Kolobov, Peng Dai, Mausam, Daniel S. Weld:
Reverse Iterative Deepening for Finite-Horizon MDPs with Large Branching Factors. - Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. - Johannes Löhr, Patrick Eyerich, Thomas Keller, Bernhard Nebel:
A Planning Based Framework for Controlling Hybrid Systems. - Christian J. Muise, Sheila A. McIlraith, J. Christopher Beck:
Improved Non-Deterministic Planning by Exploiting State Relevance. - Hootan Nakhost, Jörg Hoffmann, Martin Müller:
Resource-Constrained Planning: A Monte Carlo Random Walk Approach. - Hoang-Khoi Nguyen, Dang-Vien Tran, Tran Cao Son, Enrico Pontelli:
On Computing Conformant Plans Using Classical Planners: A Generate-And-Complete Approach. - Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith:
Iterative Improvement Algorithms for the Blocking Job Shop. - Chonhyon Park, Jia Pan, Dinesh Manocha:
ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments. - Simon Parkinson, Andrew Longstaff, Andrew Crampton, Peter Gregory:
The Application of Automated Planning to Machine Tool Calibration. - Bastian Seegebarth, Felix Müller, Bernd Schattenberg, Susanne Biundo:
Making Hybrid Plans More Clear to Human Users - A Formal Approach for Generating Sound Explanations. - Sabine Storandt:
Route Planning for Bicycles - Exact Constrained Shortest Paths Made Practical via Contraction Hierarchy. - Xiaoxun Sun, Tansel Uras, Sven Koenig, William Yeoh:
Incremental ARA*: An Incremental Anytime Search Algorithm for Moving-Target Search. - Florent Teichteil-Königsbuch:
Fast Incremental Policy Compilation from Plans in Hybrid Probabilistic Domains. - Daria Terekhov, Tony T. Tran, Douglas G. Down, J. Christopher Beck:
Long-Run Stability in Dynamic Scheduling. - Jordan Tyler Thayer, Roni Stern, Ariel Felner, Wheeler Ruml:
Faster Bounded-Cost Search Using Inadmissible Estimates. - Kevin Tierney, Amanda Jane Coles, Andrew Coles, Christian Kroer, Adam M. Britt, Rune Møller Jensen:
Automated Planning for Liner Shipping Fleet Repositioning. - Felipe W. Trevizan, Manuela M. Veloso:
Short-Sighted Stochastic Shortest Path Problems. - Martin Wehrle, Malte Helmert:
About Partial Order Reduction in Planning and Computer Aided Verification. - Ari Weinstein, Michael L. Littman:
Bandit-Based Planning and Learning in Continuous-Action Markov Decision Processes. - Fan Xie, Hootan Nakhost, Martin Müller:
Planning Via Random Walk-Driven Local Search. - Xiao-Feng Xie, Stephen F. Smith, Gregory J. Barlow:
Schedule-Driven Coordination for Real-Time Traffic Network Control.
Short Papers
- Ethan Burns, J. Benton, Wheeler Ruml, Sung Wook Yoon, Minh Binh Do:
Anticipatory On-Line Planning. - Lukás Chrpa, Thomas Leo McCluskey, Hugh Osborne:
Optimizing Plans through Analysis of Action Dependencies and Independencies. - Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search. - Daniel Felix Ferber:
On Modeling the Tactical Planning of Oil Pipeline Networks. - Patrik Haslum, John K. Slaney, Sylvie Thiébaux:
Minimal Landmarks for Optimal Delete-Free Planning. - Christian J. Muise, Sheila A. McIlraith, J. Christopher Beck:
Optimally Relaxing Partial-Order Plans with MaxSAT. - Florian Pommerening, Malte Helmert:
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. - Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert:
Learning Portfolios of Automatically Tuned Planners.
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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.