default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDICAPS 2018: Delft, The Netherlands
- Mathijs de Weerdt, Sven Koenig, Gabriele Röger, Matthijs T. J. Spaan:
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, ICAPS 2018, Delft, The Netherlands, June 24-29, 2018. AAAI Press 2018, ISBN 978-1-57735-797-1
Main Technical Track
- Tony Allard, Charles Gretton, Patrik Haslum:
A TIL-Relaxed Heuristic for Planning with Time Windows. 2-10 - Roman Barták, Adrien Maillard, Rafael Cauê Cardoso:
Validation of Hierarchical Plans via Parsing of Attribute Grammars. 11-19 - Johannes Blum, Sabine Storandt:
Scalability of Route Planning Techniques. 20-28 - Alberto Camacho, Jorge A. Baier, Christian J. Muise, Sheila A. McIlraith:
Finite LTL Synthesis as Planning. 29-38 - Michael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni, Wheeler Ruml:
Temporal Planning while the Clock Ticks. 39-46 - Krishnendu Chatterjee, Martin Chmelik, Ufuk Topcu:
Sensor Synthesis for POMDPs with Reachability Objectives. 47-55 - Krishnendu Chatterjee, Wolfgang Dvorák, Monika Henzinger, Alexander Svozil:
Algorithms and Conditional Lower Bounds for Planning Problems. 56-64 - Salomé Eriksson, Gabriele Röger, Malte Helmert:
A Proof System for Unsolvable Planning Tasks. 65-73 - Gaojian Fan, Robert Holte, Martin Müller:
MS-Lite: A Lightweight, Complementary Merge-and-Shrink Method. 74-82 - Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar, Sven Koenig:
Adding Heuristics to Conflict-Based Search for Multi-Agent Path Finding. 83-87 - Tomas Geffner, Hector Geffner:
Compact Policies for Fully Observable Non-Deterministic Planning as SAT. 88-96 - Alban Grastien, Enrico Scala:
Sampling Strategies for Conformant Planning. 97-105 - Nika Haghtalab, Simon Mackenzie, Ariel D. Procaccia, Oren Salzman, Siddhartha S. Srinivasa:
The Provable Virtue of Laziness in Motion Planning. 106-113 - Daniel Höller, Pascal Bercher, Gregor Behnke, Susanne Biundo:
A Generic Method to Guide HTN Progression Search with Classical Heuristics. 114-122 - Amy Huang, Liam Lloyd, Mohamed Omar, James C. Boerkoel:
New Perspectives on Flexibility in Simple Temporal Planning. 123-131 - Michael Katz, Shirin Sohrabi, Octavian Udrea, Dominik Winterer:
A Novel Iterative Approach to Top-k Planning. 132-140 - Sarah Keren, Avigdor Gal, Erez Karpas:
Strong Stubborn Sets for Efficient Goal Recognition Design. 141-149 - Michaela Klauck
, Marcel Steinmetz, Jörg Hoffmann, Holger Hermanns:
Compiling Probabilistic Model Checking into Probabilistic Planning. 150-154 - Ryo Kuroiwa, Alex Fukunaga:
Batch Random Walk for GPU-Based Classical Planning. 155-160 - Tiep Le, Francesco Fabiano, Tran Cao Son, Enrico Pontelli:
EFP and PG-EFP: Epistemic Forward Search Planners in Multi-Agent Domains. 161-170 - Daniel Muller, Erez Karpas:
Value Driven Landmarks for Oversubscription Planning. 171-179 - Mikael Nilsson, Jonas Kvarnström, Patrick Doherty:
Planning with Temporal Uncertainty, Resources and Non-Linear Control Parameters. 180-189 - Binda Pandey, Jussi Rintanen:
Planning for Partial Observability by SAT and Graph Constraints. 190-198 - Vahid Riahi, M. A. Hakim Newton, Kaile Su, Abdul Sattar:
Local Search for Flowshops with Setup Times and Blocking Constraints. 199-207 - Gabriele Röger, Silvan Sievers, Michael Katz:
Symmetry-Based Task Reduction for Relaxed Reachability Analysis. 208-217 - Diederik M. Roijers, Erwin Walraven, Matthijs T. J. Spaan:
Bootstrapping LPs in Value Iteration for Multi-Objective and Partially Observable MDPs. 218-226 - Matteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor, Alessandro Saetti:
Two-Oracle Optimal Path Planning on Grid Maps. 227-231 - Shashank Shekhar, Ronen I. Brafman:
Representing and Planning with Interacting Actions and Privacy. 232-240 - Dorin Shmaryahu, Guy Shani, Jörg Hoffmann, Marcel Steinmetz:
Simulated Penetration Testing as Contingent Planning. 241-249 - David Speck, Florian Geißer, Robert Mattmüller:
Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams. 250-258 - Zachary N. Sunberg, Mykel J. Kochenderfer:
Online Algorithms for POMDPs with Continuous State, Action, and Observation Spaces. 259-263 - Alessandro Umbrico, Amedeo Cesta, Marta Cialdea Mayer, Andrea Orlandini:
Integrating Resource Management and Timeline-Based Planning. 264-272 - Erli Wang, Hanna Kurniawati, Dirk P. Kroese:
An On-Line Planner for POMDPs with Large Discrete Action Space: A Quantile-Based Approach. 273-277 - Max Waters, Bernhard Nebel, Lin Padgham, Sebastian Sardiña:
Plan Relaxation via Action Debinding and Deordering. 278-287 - Anna Wilhelm, Marcel Steinmetz, Jörg Hoffmann:
On Stubborn Sets and Planning with Resources. 288-297
Novel Applications Track
- Jelle Adan, Ivo J. B. F. Adan, Alp Akcay, Rick Van den Dobbelsteen, Joep Stokkermans:
A Hybrid Genetic Algorithm for Parallel Machine Scheduling at Semiconductor Back-End Production. 298-302 - J. Benton, David E. Smith, John Kaneshige, Leslie Keely, Thomas Stucky:
CHAP-E: A Plan Execution Assistant for Pilots. 303-311 - Wayne Chi, Steve A. Chien, Jagriti Agrawal, Gregg R. Rabideau, Edward Benowitz, Daniel M. Gaines, Elyse Fosse, Stephen Kuhn, James Biehl:
Embedding a Scheduler in Execution for a Planetary Rover. 312-320 - Massimiliano de Leoni, Giacomo Lanciano, Andrea Marrella:
Aligning Partially-Ordered Process-Execution Traces and Models Using Automated Planning. 321-329 - Muralidhar Konda, Supriyo Ghosh, Pradeep Varakantham:
Reserved Optimisation: Handling Incident Priorities in Emergency Response Systems. 330-338 - Scott A. Mitchell, Christopher G. Valicka, Stephen Rowe, Simon X. Zou:
Footprint Placement for Mosaic Imaging by Sampling and Optimization. 339-346 - Cédric Pralet, Stéphanie Roussel, Thomas Polacsek, François Bouissière, Claude Cuiller, Pierre-Eric Dereux, Stéphane Kersuzan, Marc Lelay:
A Scheduling Tool for Bridging the Gap Between Aircraft Design and Aircraft Manufacturing. 347-355 - Marieke S. van der Tuin, Mathijs de Weerdt, G. Veit Batz:
Route Planning with Breaks and Truck Driving Bans Using Time-Dependent Contraction Hierarchies. 356-365
Operations Research Track
- Kyle E. C. Booth, Minh Do, J. Christopher Beck, Eleanor Gilbert Rieffel, Davide Venturelli, Jeremy Frank:
Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation. 366-374 - Pallavi Manohar, Pradeep Varakantham, Hoong Chuin Lau:
Bounded Rank Optimization for Effective and Efficient Emergency Response. 375-382 - Chiara Piacentini, Margarita P. Castro, André Augusto Ciré, J. Christopher Beck:
Compiling Optimal Numeric Planning to Mixed Integer Linear Programming. 383-387 - Arvind U. Raghunathan, David Bergman, John N. Hooker, Thiago Serra, Shingo Kobori:
The Integrated Last-Mile Transportation Problem (ILMTP). 388-398
Planning and Learning Track
- Diego Aineto, Sergio Jiménez, Eva Onaindia:
Learning STRIPS Action Models with Classical Planning. 399-407 - Edward Groshev, Maxwell Goldstein, Aviv Tamar, Siddharth Srivastava, Pieter Abbeel:
Learning Generalized Reactive Policies Using Deep Neural Networks. 408-416 - Toru Hishinuma, Kei Senda:
An Approximate Bayesian Reinforcement Learning Approach Using Robust Control Policy and Tree Search. 417-421 - Murugeswari Issakkimuthu, Alan Fern, Prasad Tadepalli:
Training Deep Reactive Policies for Probabilistic Planning Problems. 422-430 - Mauro Vallati, Ivan Serina:
A General Approach for Configuring PDDL Problem Models. 431-436
Robotics Track
- Arthur Bit-Monnot, Rafael Bailon-Ruiz, Simon Lacroix:
A Local Search Approach to Observation Planning with Multiple UAVs. 437-445 - Patrick Clary, Pedro Morais, Alan Fern, Jonathan W. Hurst:
Monte-Carlo Planning for Agile Legged Locomotion. 446-450 - Kazim Selim Engin, Volkan Isler:
Minimizing Movement to Establish the Connectivity of Randomly Deployed Robots. 451-458 - Michael William Lanighan, Takeshi Takahashi, Roderic A. Grupen:
Planning Robust Manual Tasks in Hierarchical Belief Spaces. 459-467 - Fangda Li, Ankit V. Manerikar, Avinash C. Kak:
RMPD - A Recursive Mid-Point Displacement Algorithm for Path Planning. 468-475 - Aditya Mandalika, Oren Salzman, Siddhartha S. Srinivasa:
Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges. 476-484 - Federico Pecora, Henrik Andreasson, Masoumeh Mansouri, Vilian Petkov:
A Loosely-Coupled Approach for Multi-Robot Coordination, Motion Planning and Control. 485-493 - Maciej Przybylski:
AD*-Cut: A Search-Tree Cutting Anytime Dynamic A* Algorithm. 494-499 - Vinitha Ranganeni, Oren Salzman, Maxim Likhachev:
Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance. 500-508 - Björn Schäpers, Tim Niemueller, Gerhard Lakemeyer, Martin Gebser, Torsten Schaub:
ASP-Based Time-Bounded Planning for Logistics Robots. 509-517 - Sarath Sreedharan, Tathagata Chakraborti, Subbarao Kambhampati:
Handling Model Uncertainty and Multiplicity in Explanations via Model Reconciliation. 518-526 - Zhi Wang, Liron Cohen, Sven Koenig, T. K. Satish Kumar:
The Factored Shortest Path Problem and Its Applications in Robotics. 527-531 - Minghan Wei, Volkan Isler:
A Log-Approximation for Coverage Path Planning with the Energy Constraint. 532-
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-02 23:34 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:
