• Aucun résultat trouvé

Preface

N/A
N/A
Protected

Academic year: 2022

Partager "Preface"

Copied!
3
0
0

Texte intégral

(1)

Preface

The PlanSIG workshop is (usually) a yearly forum where academics, industrialists, and research students can meet and discuss current issues in an informal setting. We es- pecially aim to bring together researchers attacking different aspects of planning and scheduling problems, and to introduce new researchers to the community. In recent years the SIG has attracted an international gathering, and we continue to welcome contribu- tions from around the world.

Topics of interest of PlanSIG include (but are not limited to):

• Algorithms: Novel planning and scheduling algorithms.

• Applications: Empirical studies of existing planning/scheduling systems; domain- specific techniques; heuristic techniques; user interfaces for planning and schedul- ing; evaluation metrics for plans and/or schedules; verification and validation of plans and/or schedules. Application examples of real world problems are partic- ularly welcomed.

• Architectures: Real-time support for planning/scheduling/control; mixed-initiative planning and user interfaces; integration of planning and scheduling; continuous planning systems; integration of planning/scheduling and Fault Detection Isola- tion and Recovery (FDIR); planning and scheduling in autonomous systems.

• Artificial Intelligence and Operations Research: Comparative studies and innova- tive applications combining AI and OR techniques applied to scheduling and/or planning.

• Constraint-based Planning/Scheduling and Control Techniques: Constraint or preference propagation techniques, variable/value ordering heuristics, intelligent backtracking/RMS-based techniques, iterative repair heuristics, etc.

• Coordination Issues in Decentralised/Distributed planning/scheduling: Coordina- tion issues in both homogeneous and heterogeneous systems, system architecture issues, integration of strategic and tactical decision making; collaborative plan- ning/scheduling.

• Environmental and Task Models: Analyses of the dynamics of environments, tasks, and domains with regard to different models of planning and execution;

verification and validation of domain models.

• Formal Models: Reasoning about knowledge, action, and time; representations and ontologies for planning and scheduling; search methods and analysis of algo- rithms; formal characterisation of existing planners and schedulers.

• Intelligent Agency: Resource-bounded reasoning; distributed problem solving;

integrating reaction and deliberation.

• Iterative Improvement Techniques for Combinatorial Optimisation: Genetic algo- rithms, simulated annealing, tabu search, neural nets, etc. applied to scheduling and/or planning.

• Knowledge engineering for planning: Domain construction tools and techniques, knowledge elicitation, ontology development.

• Learning: Learning in the context of planning and execution; learning new plans and operators; learning in the context of scheduling and schedule maintenance.

• Memory Based Approaches: Case-based planning/scheduling; plan and operator learning and reuse; incremental planning.

(2)

• Planning/scheduling under uncertainty: Coping with uncertain, ill-specified or changing domains, environments and problems; application of uncertainty rea- soning techniques to planning/scheduling, including MDPs, POMDPs, Belief Networks, stochastic programming, and stochastic satisfiability.

• Plan Recognition: Techniques for identifying plans, actions, and goals, and par- ticularly the connection between such techniques and traditional planning ap- proaches and representations.

• Reactive Systems: Environmentally driven devices/behaviours; reactive control;

behaviours in the context of minimal representations; schedule maintenance.

• Robotics: Motion and path planning; planning and control; planning and percep- tion, integration of planning and perceptual systems.

The workshop received twelve submissions which have all been accepted. Ten of those have been included in this volume.

January 2017 Luk´aˇs Chrpa

Simon Parkinson Mauro Vallati (Chairs)

(3)

Organization

Chairs

Luk´aˇs Chrpa University of Huddersfield, UK Simon Parkinson University of Huddersfield, UK Mauro Vallati University of Huddersfield, UK

Program Committee

Roman Bartak Charles University, Czech Republic Santiago Franco Auckland University, New Zealand Alan Lindsay University of Strathclyde, UK Daniele Magazzeni King’s College London, UK Marco Maratea University of Genova, Italy Thomas L. McCluskey University of Huddersfield, UK Ron Petrick Heriot-Watt University, UK Julie Porteous Teesside University, UK

Enrico Scala Australian National University, UK Ivan Serina University of Brescia, Italy Tiago S. Vaquero MIT and Caltech, USA

Références

Documents relatifs

- do the experiment in itself with 15 users (an average of 30 minutes per user was necessary) [MD tool produces a dated trace of all probes];. - analyze the collected data

In the first step, the system will propose the user to select VR devices System will “write” into the XML document the VR devices modules to load according selected devices

User Interfaces composition, Semantic models, Automated task planning, Context of use. INTRODUCTION.. Pushed forward by new information technologies, Weiser’s vision of

In this context, the in-service inspection planning process, which consists of a series of sub- processes, for instance, preparation of inspection programs, carrying out

Word Embedding techniques learn in a totally unsuper- vised way a low-dimensional vector space representation of words by analyzing their usage in (very) large corpora of

User Interfaces composition, Semantic models, Automated task planning, Context of use. INTRODUCTION.. Pushed forward by new information technologies, Weiser’s vision of

The neighborhood evaluation function has two parts evaluating: the search cost of an LA-graph in the neighborhood (i.e., the number of search steps required to reach a solution

the computation time, the pressure fields were computed by adaptative volume sampling with a ∆S size of λ/5.. 3 shows the profile of the pressure field along the x axis (y=0, z=0,