![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 51 matches
- 2012
- J. Benton, Amanda Jane Coles, Andrew Coles:
Temporal Planning with Preferences and Time-Dependent Continuous Costs. ICAPS 2012 - Ethan Burns, J. Benton, Wheeler Ruml, Sung Wook Yoon, Minh Binh Do:
Anticipatory On-Line Planning. ICAPS 2012 - Lukás Chrpa, Thomas Leo McCluskey, Hugh Osborne:
Optimizing Plans through Analysis of Action Dependencies and Independencies. ICAPS 2012 - André A. Ciré, Willem Jan van Hoeve:
MDD Propagation for Disjunctive Scheduling. ICAPS 2012 - Martin C. Cooper, Frederic Maris, Pierre Régnier:
Tractable Monotone Temporal Planning. ICAPS 2012 - Carmel Domshlak, Michael Katz, Alexander Shleyfman:
Enhanced Symmetry Breaking in Cost-Optimal Planning as Forward Search. ICAPS 2012 - Brendan J. Englot, Franz S. Hover:
Sampling-Based Coverage Path Planning for Inspection of Complex Structures. ICAPS 2012 - Daniel Felix Ferber:
On Modeling the Tactical Planning of Oil Pipeline Networks. ICAPS 2012 - Maria Fox, Derek Long, Daniele Magazzeni:
Plan-Based Policy-Learning for Autonomous Feature Tracking. ICAPS 2012 - Antonio Garrido, Lluvia Morales, Ivan Serina:
Using AI Planning to Enhance E-Learning Processes. ICAPS 2012 - Avitan Gefen, Ronen I. Brafman:
Pruning Methods for Optimal Delete-Free Planning. ICAPS 2012 - Peter Gregory, Derek Long, Maria Fox, J. Christopher Beck:
Planning Modulo Theories: Extending the Planning Paradigm. ICAPS 2012 - Patrik Haslum:
Incremental Lower Bounds for Additive Cost Planning Problems. ICAPS 2012 - Patrik Haslum, John K. Slaney, Sylvie Thiébaux:
Minimal Landmarks for Optimal Delete-Free Planning. ICAPS 2012 - Breelyn Melissa Kane, Reid G. Simmons:
Risk-Variant Policy Switching to Exceed Reward Thresholds. ICAPS 2012 - Erez Karpas, Carmel Domshlak:
Optimal Search with Inadmissible Heuristics. ICAPS 2012 - Michael Katz, Jörg Hoffmann, Malte Helmert:
How to Relax a Bisimulation? ICAPS 2012 - Elena Kelareva, Sebastian Brand, Philip Kilby, Sylvie Thiébaux, Mark Wallace:
CP and MIP Methods for Ship Scheduling with Time-Varying Draft. ICAPS 2012 - Thomas Keller, Patrick Eyerich:
PROST: Probabilistic Planning Based on UCT. ICAPS 2012 - Emil Ragip Keyder, Jörg Hoffmann, Patrik Haslum:
Semi-Relaxed Plan Heuristics. ICAPS 2012 - Scott Kiesel, Ethan Burns, Christopher Makoto Wilt, Wheeler Ruml:
Integrating Vehicle Routing and Motion Planning. ICAPS 2012 - Andrey Kolobov, Peng Dai, Mausam, Daniel S. Weld:
Reverse Iterative Deepening for Finite-Horizon MDPs with Large Branching Factors. ICAPS 2012 - Levi Lelis, Roni Stern, Ariel Felner, Sandra Zilles, Robert C. Holte:
Predicting Optimal Solution Cost with Bidirectional Stratified Sampling. ICAPS 2012 - Johannes Löhr, Patrick Eyerich, Thomas Keller, Bernhard Nebel:
A Planning Based Framework for Controlling Hybrid Systems. ICAPS 2012 - Christian J. Muise, Sheila A. McIlraith, J. Christopher Beck:
Improved Non-Deterministic Planning by Exploiting State Relevance. ICAPS 2012 - Christian J. Muise, Sheila A. McIlraith, J. Christopher Beck:
Optimally Relaxing Partial-Order Plans with MaxSAT. ICAPS 2012 - Hootan Nakhost, Jörg Hoffmann, Martin Müller:
Resource-Constrained Planning: A Monte Carlo Random Walk Approach. ICAPS 2012 - Hoang-Khoi Nguyen, Dang-Vien Tran, Tran Cao Son, Enrico Pontelli:
On Computing Conformant Plans Using Classical Planners: A Generate-And-Complete Approach. ICAPS 2012 - Angelo Oddi, Riccardo Rasconi, Amedeo Cesta, Stephen F. Smith:
Iterative Improvement Algorithms for the Blocking Job Shop. ICAPS 2012 - Chonhyon Park, Jia Pan, Dinesh Manocha:
ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments. ICAPS 2012
skipping 21 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-02-17 18:32 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint