Main Track

  • Local Search for Flowshops with Setup Times and Blocking Constraints
    Vahid Riahi, M.A.Hakim Newton, Kaile Su and Abdul Sattar
  • Validation of Hierarchical Plans via Parsing of Attribute Grammars
    Roman Barták, Adrien Maillard and Rafael C. Cardoso
  • Adding Heuristics to Conflict-Based Search for Multi-Agent Pathfinding
    Ariel Felner, Jiaoyang Li, Eli Boyarski, Hang Ma, Liron Cohen, T. K. Satish Kumar and Sven Keonig
  • New Perspectives on Flexibility in Simple Temporal Planning
    Amy Huang, William Lloyd, Mohamed Omar and Jim Boerkoel
  • Temporal Planning While the Clock Ticks
    Michael Cashmore, Andrew Coles, Bence Cserna, Erez Karpas, Daniele Magazzeni and Wheeler Ruml
  • Value Driven Landmarks for Oversubscription Planning
    Daniel Muller and Erez Karpas
  • Strong Stubborn Sets for Efficient Goal Recognition Design
    Sarah Keren, Avigdor Gal and Erez Karpas
  • Simulated Penetration Testing as Contingent Planning
    Guy Shani, Dorin Shmaryahu and Joerg Hoffmann
  • Representing and Planning with Interacting Actions and Privacy
    Shashank Shekhar and Ronen Brafman
  • Algorithms and Conditional Lower bounds for Planning Problems
    Krishnendu Chatterjee, Wolfgang Dvořák, Monika Henzinger and Alexander Svozil
  • Sensor Synthesis for POMDPs with Reachability Objectives
    Krishnendu Chatterjee, Martin Chmelík and Ufuk Topcu
  • Planning for Partial Observability by SAT and Graph Constraints
    Binda Pandey and Jussi Rintanen
  • Generating Tractable and Flexible Partial Plans
    Max Waters, Bernhard Nebel, Lin Padgham and Sebastian Sardina
  • A Generic Method to Guide HTN Progression Search with Classical Heuristics
    Daniel Höller, Pascal Bercher, Gregor Behnke and Susanne Biundo
  • Scalability of Route Planning Techniques
    Johannes Blum and Sabine Storandt
  • A Proof System for Unsolvable Planning Tasks
    Salomé Eriksson, Gabriele Röger and Malte Helmert
  • MS-lite: A Lightweight, Complementary Merge-and-Shrink Method
    Gaojian Fan, Robert Holte and Martin Mueller
  • Compact Policies for Fully-Observable Non-Deterministic Planning as SAT
    Tomas Geffner and Hector Geffner
  • A TIL-Relaxed Heuristic for Planning with Time Windows
    Tony Allard, Patrik Haslum and Charles Gretton
  • The Provable Virtue of Laziness in Motion Planning
    Nika Haghtalab, Simon Mackenzie, Ariel Procaccia, Oren Salzman and Siddhartha Srinivasa
  • A Novel Iterative Approach to Top-k Planning
    Michael Katz, Shirin Sohrabi, Octavian Udrea and Dominik Winterer
  • Sampling Strategies for Conformant Planning
    Alban Grastien and Enrico Scala
  • An On-line Planner for POMDPs with Large Discrete Action Space: A Quantile-Based Approach
    Erli Wang, Hanna Kurniawati and Dirk Kroese
  • Symmetry-based Task Reduction for Relaxed Reachability Analysis
    Gabriele Röger, Silvan Sievers and Michael Katz
  • Batch Random Walk for GPU-Based Classical Planning
    Ryo Kuroiwa and Alex Fukunaga
  • A Multi-Agent Framework to solve energy-aware unrelated parallel machine scheduling problem with machine-dependent energy consumption and sequence-dependent setup-time
    Giancarlo Nicolò, Sergio Ferrer, Miguel A. Salido, Federico Barber and Adriana Giret
  • On Stubborn Sets and Planning with Resources
    Anna Wilhelm, Marcel Steinmetz and Joerg Hoffmann
  • Bootstrapping LPs in Value Iteration for Multi-Objective and Partially Observable MDPs
    Diederik M. Roijers, Erwin Walraven and Matthijs T. J. Spaan
  • Compiling Probabilistic Model Checking into Probabilistic Planning
    Holger Hermanns, Joerg Hoffmann, Michaela Klauck and Marcel Steinmetz
  • Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams
    David Speck, Florian Geißer and Robert Mattmüller
  • Two-Oracle Optimal Path Planning on Grid Maps
    Matteo Salvetti, Adi Botea, Alfonso Emilio Gerevini, Daniel Harabor and Alessandro Saetti
  • Online algorithms for POMDPs with continuous state, action, and observation spaces
    Zachary Sunberg and Mykel Kochenderfer
  • Planning with Temporal Uncertainty, Resources and Non-Linear Control Parameters
    Mikael Nilsson, Jonas Kvarnström and Patrick Doherty
  • EFP and PG-EFP: Epistemic Forward Search Planners in Multi-Agent Domains
    Tiep Le, Francesco Fabiano, Tran Cao Son and Enrico Pontelli
  • Finite LTL Synthesis as Planning
    Alberto Camacho, Jorge A. Baier, Christian Muise and Sheila A. McIlraith
  • Integrating Resource Management and Timeline-based Planning
    Alessandro Umbrico, Amedeo Cesta, Marta Cialdea Mayer and Andrea Orlandini

Robotics Track

  • Handling Model Uncertainty and Multiplicity in Explanations via Model Reconciliation
    Sarath Sreedharan, Tathagata Chakraborti and Subbarao Kambhampati
  • Effective Footstep Planning for Humanoids Using Homotopy-Class Guidance
    Vinitha Ranganeni, Oren Salzman and Maxim Likhachev
  • Clothoidal local path template for intention estimation by robotic assistive wheelchairs
    Kevin Denis, Johan Philips, Herman Bruyninckx and Eric Demeester
  • A Local Search Approach to Observation Planning with Multiple UAVs
    Arthur Bit-Monnot, Rafael Bailon-Ruiz and Simon Lacroix
  • ASP-based Time-Bounded Planning for Logistics Robots
    Björn Schäpers, Tim Niemueller, Gerhard Lakemeyer, Martin Gebser and Torsten Schaub
  • A Log-Approximation for Coverage Path Planning with the Energy Constraint
    Minghan Wei and Volkan Isler
  • A Loosely-Coupled Approach for Multi-Robot Coordination, Motion Planning and Control
    Federico Pecora, Henrik Andreasson, Masoumeh Mansouri and Vilian Petkov
  • Planning Robust Manual Tasks in Hierarchical Belief Spaces
    Michael W. Lanighan, Takeshi Takahashi and Rod Grupen
  • AD*-Cut: a Search-Tree Cutting Anytime Dynamic A* Algorithm
    Maciej Przybylski
  • RMPD -- A Recursive Mid-Point Displacement Algorithm for Path Planning
    Fangda Li, Ankit Manerikar and Avinash Kak
  • Minimizing movement to establish the connectivity of randomly deployed robots
    Kazim Selim Engin and Volkan Isler
  • Lifelong Path Planning with Kinematic Constraints for Multi-Agent Pickup and Delivery
    Hang Ma, Wolfgang Hoenig, T. K. Satish Kumar, Nora Ayanian and Sven Koenig
  • Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges
    Aditya Vamsikrishna Mandalika, Oren Salzman and Siddhartha Srinivasa
  • Monte-Carlo Planning for Agile Legged Locomotion
    Patrick Clary, Pedro Morais, Jonathan Hurst and Alan Fern
  • The Factored Shortest Path Problem and Its Applications in Robotics
    Zhi Wang, Liron Cohen, Sven Koenig and T. K. Satish Kumar

Planning and Learning Track

  • Learning strips action models with classical planning
    Diego Aineto, Sergio Jimenez and Eva Onaindia
  • An Approximate Bayesian Reinforcement Learning Approach Using Robust Control Policy and Tree Search
    Toru Hishinuma and Kei Senda
  • A General Approach for Configuring PDDL Problem Models
    Mauro Vallati and Ivan Serina
  • Training Deep Reactive Policies for Probabilistic Planning Problems
    Alan Fern, Murugeswari Issakkimuthu and Prasad Tadepalli
  • Learning Generalized Reactive Policies using Deep Neural Networks
    Edward Groshev, Aviv Tamar, Maxwell Goldstein, Siddharth Srivastava and Pieter Abbeel

Novel Applications Track

  • Route Planning with Breaks and Truck Driving Bans
    Marieke van der Tuin, Mathijs de Weerdt and Veit Batz
  • A Scheduling Tool for Bridging the Gap Between Aircraft Design and Aircraft Manufacturing
    Cédric Pralet, Stephanie Roussel, Thomas Polacsek, François Boussière, Claude Cuiller, Pierre-Eric Dereux, Stéphane Kersuzan and Marc Lelay
  • Aligning Partially-Ordered Process-Execution Traces and Models Using Automated Planning
    Massimiliano de Leoni, Giacomo Lanciano and Andrea Marrella
  • Embedding a Scheduler in Execution for a Planetary Rover
    Wayne Chi, Steve Chien, Jagriti Agrawal, Gregg Rabideau, Edward Benowitz, Daniel Gaines, Elysse Fosse, Stephen Kuhn and James Biehl
  • Reserved Optimisation: Handling Incident Priorities in Emergency Response Systems
    Muralidhar Konda, Supriyo Ghosh and Pradeep Varakantham
  • Footprint Placement for Mosaic Imaging by Sampling and Optimization
    Scott Mitchell, Christopher Valicka, Stephen Rowe and Simon Zou
  • CHAP-E: A Plan Execution Assistant for Pilots
    J. Benton, David Smith, John Kaneshige, Leslie Keely and Thomas Stucky
  • A hybrid genetic algorithm for semiconductor back-end production
    Jelle Adan, Alp Akcay, Ivo Adan, Joep Stokkermans and Rick van den Dobbelsteen

Operations Research Track

  • The Integrated Last-Mile Transportation Problem (ILMTP)
    Arvind Raghunathan, David Bergman, John Hooker, Thiago Serra and Shingo Kobori
  • Compiling Optimal Numeric Planning to Mixed Integer Linear Programming
    Chiara Piacentini, Margarita Castro, Andre Cire and J. Christopher Beck
  • Bounded Rank Optimization for Effective and Efficient Emergency Response
    Pallavi Manohar, Pradeep Varakantham and Hoong Chuin Lau
  • Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
    Kyle E. C. Booth, Minh Do, Chris Beck, Eleanor Rieffel, Davide Venturelli and Jeremy Frank

Journal Track

  • More for Free: A Dynamic Epistemic Framework for Conformant Planning over Transition Systems
    Yanjun Li, Quan Yu and Yanjing Wang
  • Fact-Alternating Mutex Groups for Classical Planning
    Daniel Fišer and Antonín Komenda
  • Extracting mutual exclusion invariants from lifted temporal planning domains
    Sara Bernardini, Fabio Fagnani and David Smith
  • Finding Optimal Feasible Global Plans for Multiple Teams of Heterogeneous Robots using Hybrid Reasoning: An Application to Cognitive Factories
    Zeynep G. Saribatur, Volkan Patoglu and Esra Erdem
  • Planning in hybrid relational MDPs
    Davide Nitti, Vaishak Belle, Luc De Raedt and Tinne De Laet
  • Planning of distributed data production for High Energy and Nuclear Physics
    Jérôme Lauret, Dzmitry Makatun and Hana Rudová
  • teaspoon: Solving the Curriculum-Based Course Timetabling Problems with Answer Set Programming
    Mutsunori Banbara, Katsumi Inoue, Benjamin Kaufmann, Tenda Okimoto, Torsten Schaub, Takehide Soh, Naoyuki Tamura and Philipp Wanko
  • A three-layer planning architecture for the autonomous control of rehabilitation therapies based on social robots
    José Carlos González, José Carlos Pulido and Fernando Fernandez
  • Robots in Retirement Homes: Person Search and Task Planning for a Group of Residents by a Team of Assistive Robots
    Kyle E. C. Booth, J. Christopher Beck, Sharaf C. Mohamed, Sanjif Rajaratnam and Goldie Nejat

News

April 2018 - Detailed schedule is available.
April 2018 - Registration has been opened and information about student support is available.
February 2018 - Accepted papers announced.
January 2018 - The Call for Papers of the Journal Presentation Track and the Call for System Demos are online.
December 2017 - The workshop program has been announced.
December 2017 - Accommodation details are now available.
December 2017 - The calls for nominations for the Best Dissertation Award and the Influential Paper Award are online.
November 2017 - Invited Speakers announced
October 2017 - Call for Tutorial Proposals and Workshop Proposals available
September 2017 - Call for Papers released
June 2017 - ICAPS 2018 announced

Important dates

Student support April 22, 2018
Early registration April 27, 2018
Summer School June 20 - 23, 2018
Doctoral consortium June 24, 2018
Workshops and tutorials June 25 - 26, 2018
Main conference June 27 - 29, 2018

Tweets

© 2016-2018 International Conference on Automated Planning and Scheduling - Photo license information: