Hostname: page-component-7c8c6479df-995ml Total loading time: 0 Render date: 2024-03-27T18:34:06.092Z Has data issue: false hasContentIssue false

Preface to special issue on planning and scheduling

Published online by Cambridge University Press:  01 September 2010

Roman Barták*
Affiliation:
Faculty of Mathematics and Physics, Charles University in Prague, Malostranské nám. 2/25, 118 00 Praha 1, Czech Republic; e-mail: bartak@ktiml.mff.cuni.cz
Amedeo Cesta*
Affiliation:
Consiglio Nazionale delle Ricerche, Instituto di Scienze e Tecnologie della Cognizione, Via S. Martino della Battaglia 44, I-00185 Rome, Italy; e-mail: amedeo.cesta@istc.cnr.it
Lee McCluskey*
Affiliation:
School of Computing and Engineering, University of Huddersfield, Queensgate, Huddersfield, West Yorkshire, HD1 3DH, UK; e-mail: t.l.mccluskey@hud.ac.uk
Miguel A. Salido*
Affiliation:
Instituto de Automática e Informática Industrial, Universidad Politécnica de Valencia, Camino de vera s/n 46020, Valencia, Spain; e-mail: msalido@dsic.upv.es

Abstract

Planning, scheduling and constraint satisfaction are important areas in artificial intelligence (AI) with broad practical applicability. Many real-world problems can be formulated as AI planning and scheduling (P&S) problems, where resources must be allocated to optimize overall performance objectives. Frequently, solving these problems requires an adequate mixture of planning, scheduling and resource allocation to competing goal activities over time in the presence of complex state-dependent constraints. Constraint satisfaction plays an important role in solving such real-life problems, and integrated techniques that manage P&S with constraint satisfaction are particularly useful. Knowledge engineering supports the solution of such problems by providing adequate modelling techniques and knowledge extraction techniques for improving the performance of planners and schedulers. Briefly speaking, knowledge engineering tools serve as a bridge between the real world and P&S systems.

Type
Other
Copyright
Copyright © Cambridge University Press 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)