COPLAS

Constraint Satisfaction Techniques for Planning and Scheduling

An ICAPS 2018 Workshop
Delft, The Netherlands
June 25, 2018

The workshop aims at providing a forum to discuss novel issues on planning, scheduling, and constraint satisfaction problems. Solutions to many real-world problems need to integrate plan synthesis capabilities with time and resource allocation, which can be efficiently managed by constraint satisfaction and OR techniques. Formulations of P&S problems as CSPs, resource and temporal global constraints, and inference techniques are of particular interest of COPLAS.

Proceedings

The proceedings are now available here

Program

Objectives and Topics

The areas of AI planning and scheduling have seen important advances thanks to the application of constraint satisfaction models and techniques. Especially solutions to many real-world problems need to integrate plan synthesis capabilities with resource allocation, which can be efficiently managed by using constraint satisfaction techniques. The workshop will aim at providing a forum for researchers in the field of Artificial Intelligence to discuss novel issues on planning, scheduling, constraint programming/constraint satisfaction problems (CSPs) and many other common areas that exist among them. On the whole, the workshop will mainly focus on managing complex problems where planning, scheduling and constraint satisfaction must be combined and/or interrelated, which entails an enormous potential for practical applications and future research. COPLAS is ranked as CORE B in ERA Conference Ranking and it is covered in selected Elsevier database products.

We invite submissions on any topic relevant to the workshop, particularly those that combine techniques from both perspectives, planning & scheduling, and constraint programming. This includes but is not limited to:

• Planning
  • Constraint management
  • Temporal planning
  • Multi-criteria planning
  • Planning with resources
  • Reformulations to CSP
• Scheduling
  • Innovative models
  • Robust solutions
  • Energy efficient scheduling
  • Manufacturing
  • Green scheduling
• Integration of planning and scheduling,
• Heuristic and Metaheuristic techniques,
• Hybrid CP and OR techniques for P&S,
• Real life applications

We are pleased to accept papers based on recent publications from other (non ICAPS) venues such as specialized conferences (CP, CP-AI-OR, AAMAS, ...), or general AI conferences (AAAI, IJCAI, ECAI, ...). This must be however clearly indicated in the submitted paper. Submission of papers that are under review in another forum is allowed and encouraged for wider dissemination as COPLAS will have informal proceedings only (but double check the submission conditions of the other conference). Original papers will be considered to be nominated for the “Fast-tracking of strong workshop papers” to be presented in the main track of ICAPS 2019. At least one author of each accepted paper must attend the workshop in order to present the paper. Authors must register for the ICAPS main conference in order to attend the workshop. There will be no separate workshop-only registration.

Submissions

Papers must be prepared according to the instructions for ICAPS-18 (in AAAI format) available at http://www.aaai.org/Publications/Author/author.php and must be no more than ten (10) pages long, including figures and bibliography. Submitted PDF papers should be anonymous for double-blind reviewing and should be sent via the EasyChair conference system (https://easychair.org/conferences/?conf=coplas18). Every submitted paper will be reviewed by at least two members of the Program Committee. Late submissions must be consulted with the workshop organizers prior the submission deadline. Accepted papers will be included in the workshop notes.

Important Dates

Submission deadline (extended): April, 3, 2018
Notification: April 25, 2018
Final version: May 25, 2018
Workshop: June 25, 2018

Workshop Program Chairs

• Miguel A. Salido, Universidad Politécnica de Valencia, Spain, msalido@dsic.upv.es
• Roman Barták, Charles University, Czech Republic, bartak@ktiml.mff.cuni.cz

Program committee 

• Federico Barber (Universidad Politecnica de Valencia, Spain)
• Roman Barták (Charles University, The Czech Republic)
• Amedeo Cesta (ISTC-CNR, Italy)
• Minh Binh Do (NASA Ames Research Center, USA)
• Serdar Kadioglu ( Fidelity Investments, USA)
• Eva Onaindia, Universidad Politecnica de Valencia, Spain
• Massimo Paolucci (University of Genova, Italy)
• Gilles Pesant (École Polytechnique de Montréal, Canada)
• Nicola Policella (European Space Agency, Germany)
• Enrico Pontelli (New Mexico State University, USA)
• Hana Rudová (Masaryk University, The Czech Republic)
• Miguel A. Salido (Universidad Politecnica Valencia, Spain)
• Pierre Schaus (Université catholique de Louvain, Belgian)
• Dunbing Tang (Nanjing University of Aeronautics&Astronomics, China)
• Ramiro Varela (Universidad de Oviedo, Spain)
• Petr Vilím (ILOG, France)
• Neil Yorke-Smith (Delft University of Technology, the Netherlands)

Accepted Papers

• X and more Parallelism Integrating LTL-Next into SAT-based Planning with Trajectory Constraints while Allowing for even more Parallelism
  Gregor Behnke and Susanne Biundo
• Forward-Search Temporal Planning with Simultaneous Events
  Daniel Furelos-Blanco, Anders Jonsson, Héctor Palacios and Sergio Jiménez
• Compact Tree Encodings for Planning as QBF
  Olivier Gasquet, Dominique Longin, Frédéric Maris, Pierre Régnier, Mael Valais
• Characterizing and Computing All Delete-Relaxed Dead-ends
  Christian Muise
• Integrating Meeting and Individual Events Scheduling
  Anastasios Alexiadis, Ioannis Refanidis and Ilias Sakellariou
• Planning and Scheduling in Additive Manufacturing
  Filip Dvorak, Maxwell Micali and Mathias Mathieu
• A Large-scale Multiobjective Satellite Data Transmission Scheduling Technology Based on SVM+NSGA-II
  Jiawei Zhang , Cheng Chen , YingGuo Chen and Lining Xing
• A Constraint-based Mission Planning Approach for Recongurable Multi-Robot Systems
  Thomas M. Roehr
• Dynamic rescheduling in energy-aware unrelated parallel machine problems
  Sergio Ferrer, Giancarlo Nicolò, Miguel A. Salido, Adriana Giret and Federico Barber