Posters may be attached to the poster boards in the Foyer (1st floor) where also lunch is served. These poster boards are 1m wide and 2m high, and thus will fit A0 in portrait mode. Please put up your poster in the morning and remove it before the end of the day your poster has been allocated to. Try to stick around your poster during this lunch break.

There is a print shop in the Architecture faculty on campus (Mo-Fr), which you may use for printing posters. Additionally, there is a print shop next to the train station (7 days/week).


  • Several system demonstrations
  • On Computational Complexity of Automorphism Groups in Classical Planning
  • Boosting Efficiency for Computing the Pareto Frontier on Tree Structured Networks
  • Accounting for Partial Observability in Stochastic Goal Recognition Design: Messing with the Marauder’s Map
  • Best-Case and Worst-Case Behavior of Greedy Best-First Search
  • Applying software design practices to PDDL development for continuous hierarchical robot task planning in smart environments
  • Explicability as Minimizing Distance from Expected Behavior; A Unified Framework for Planning in Adversarial and Cooperative Environments
  • Compiling Optimal Numeric Planning to Mixed Integer Linear Programming
  • The Integrated Last-Mile Transportation Problem (ILMTP)
  • Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
  • A log-approximation for coverage path planning with the energy constraint
  • Planning of distributed data production for High Energy and Nuclear Physics
  • IBM ILOG CP Optimizer for Scheduling
  • An A*-Based Algorithm to Derive Relaxed Decision Diagrams for a Prize-Collecting Sequencing Problem


  • Task Monitoring and Rescheduling for Opportunity and Failure Management
  • Recoverable Team Formation: Building Teams Resilient to Change
  • CPCES: Conformant Planning with Counter-Example Sampling
  • Intruder Alert! Optimization Models for Solving the Mobile Robot Graph-Clear Problem; Modelling and Solving the Senior Transportation Problem
  • Fleet Scheduling in Underground Mines using Constraint Programming
  • Find the chromatic number by counting k-colorings with a randomized heuristic
  • Poster by Alberto Pozanco
  • Finite LTL Synthesis as Planning
  • A Depth-Balanced Approach to Decompositional Planning Problems where Hierarchical Depth is Requested
  • Human-in-the-Loop Domain-Model Acquisition for Planning
  • Towards Effective Deep Learning for CSPs
  • Safe Reinforcement Learning in Factored MDPs
  • Combinatorial Methods for Discrete-Weight Neural Networks
  • Star-Topology Decoupling in the SPIN Model Checker
  • On Learning from Human Expert Knowledge for Automated Scheduling
  • Modelling Real-World Strict Seniority Bidding Problems in Airline Crew Rostering
  • poster by Max Waters
  • Optimal motion planning for automated driving
  • Two-Oracle Optimal Path Planning on Grid Maps
  • Dynamic rescheduling in energy-aware unrelated parallel machine problems
  • Timeline-based Planning; Expressiveness and Complexity
  • Greedy Randomized Search for Scalable Compilation of Quantum Circuits


  • ASP-based Time-Bounded Planning for Logistics Robots
  • Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams
  • A Proof System for Unsolvable Planning Tasks
  • Algorithms for Sparse k-Monotone Regression
  • An Efficient Relaxed Projection Method for Constrained Non-negative Matrix Factorization with Application to the Phase-Mapping Problem in Materials Science
  • Representing and Planning with Interacting Actions and Privacy
  • Scalability of Route Planning Techniques
  • Bootstrapping LPs in Value Iteration for Multi-Objective and Partially Observable MDPs
  • Online algorithms for POMDPs with continuous state, action, and observation spaces
  • Poster by Tathagata Chakraborti
  • Handling Model Uncertainty and Multiplicity in Explanations via Model Reconciliation
  • A Loosely-coupled Approach for Multi-robot Coordination, Motion Planning and Control
  • Minimizing Movement to Establish the Connectivity of Randomly Deployed Robots
  • RMPD - A Recursive Mid-Point Displacement Algorithm for Path Planning
  • Poster by Aditya Vamsikrishna Mandalika
  • Extracting Mutual Exclusion Invariants from Lifted Temporal Planning Domains
  • New Perspectives on Flexibility in Simple Temporal Planning
  • Integrating Resource Management and Timeline-based Planning
  • Compiling Probabilistic Model Checking into Probabilistic Planning
  • Training Deep Reactive Policies for Probabilistic Planning Problems
  • Monte-Carlo Planning for Agile Legged Locomotion
  • Using CP to Prove Local Search is Effective
  • Strong Stubborn Sets for Efficient Goal Recognition Design


June 2018 - Tutorial materials are being made available.
June 2018 - Can't attend ICAPS? Check out our live stream instead!
June 2018 - Additional details about the Doctoral Consortium, Robotics Lab Tours and a City Tour are now available.
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, and 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
© 2018 International Conference on Automated Planning and Scheduling