COPLAS

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.

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
• Temporal CSPs
• SAT and ASP based techniques
• 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 2018.

Submissions

Papers must be prepared according to the instructions for ICAPS-17 (in AAAI format) 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. 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.

Selected papers will be published in international journals (to be confirmed).

Important Dates

Submission deadline for papers: March 17, 2017
Notification of acceptance/rejection: April 20, 2017
Camera-ready version due: May 10, 2017
Workshop Date: 19-20 June 2017

Schedule

Accepted Papers

• Eliseo Marzal, Mohannad Babli, Eva Onaindia and Laura Sebastia. Handling PDDL3.0 State Trajectory Constraints with Temporal Landmarks.
• Malcolm Mcneely, Julia Porteous, Joao Ferreira and Alan Lindsay. Towards a Constraints Approach to Generating Personalised Horror Film Variants.
• Jesús Ibáñez Ruiz, Laura Sebastia and Eva Onaindia. Evaluating the quality of tourist agendas customized to different travel styles.
• Giancarlo Nicolo, Miguel A. Salido, Sergio Ferrer, Adriana Giret and Federico Barber. A Multi-Agent Approach using dynamic constraints to solve energy-aware unrelated parallel machine scheduling problem with energy-dependent and sequence-dependent setup time.
• Daniel Morillo, Federico Barber and Miguel A. Salido. Mode List vs Activity List for the Multi-mode Resource Constrained Project Scheduling Problem.

Workshop Program Chairs

• Miguel A. Salido, Universitat Politècnica de Valencia, Spain
• Roman Barták, Charles University, Czech Republic

Tentative Program committee

• Federico Barber (Universidad Politecnica de Valencia, Spain)
• Roman Barták (Charles University, The Czech Republic)
• Amedeo Cesta (ISTC-CNR, Italy)
• Steve A. Chien (NASA Ames Research Center, USA)
• Minh Binh Do (NASA Ames Research Center, USA)
• Agostino Dovier (Universita Degli Studi di Udine, Italy)
• Jeremy Frank (NASA Ames Research Center, USA)
• Enrico Giunchiglia (Universita di Genova, Italy)
• Christophe Guettier, SAGEM, France
• Weidong Li (Coventry University, UK)
• Christophe Guettier, SAGEM, France
• Eva Onaindia, Universidad Politecnica de Valencia, Spain
• Nicola Policella (European Space Agency, Germany)
• Enrico Pontelli (New Mexico State University, USA)
• Massimo Paolucci (University of Genova, Italy)
• Hana Rudová (Masaryk University, The Czech Republic)
• Miguel A. Salido (Universidad Politecnica Valencia, Spain)
• Torsten Schaub (Technical University of Darmstadt, Germany)
• Stephen F. Smith (Carnegie Mellon University, USA)
• Dunbing Tang (Nanjing University of Aeronautics&Astronomics, China)
• Ramiro Varela (Universidad de Oviedo, Spain)
• Petr Vilím (ILOG, France)
• Neil Yorke-Smith (American University of Beirut/SRI International, USA)