Proceedings of the AIPS-02 Workshop on Planning via Model-Checking
Abstract:
Model checking is currently one of the hottest topics in computer science. It consists in comparing a model of a system against a logical requirement to discover inconsistencies. Traditionally, this idea has been used to verify the correctness of hardware circuits and network protocols. More recently, the same idea has been applied to planning with remarkable success, and has led to powerful planning systems such as MBP, MIPS, TALPLANNER, TLPLAN, and UMOP. The 10 papers accepted for presentation at this workshop are representative of both the volume and diversity of the expansion of research on planning via model-checking. Their topics include extending the basic planning via model checking framework to handling partial observability, concurrency and resources, increasingly complex goals, as well as adversarial and multi-agent domains. It will be evident from this volume that planning via model checking largely intersects with other model-theoretic approaches to planning such as decision-theoretic planning, Markov decision processes, or controller synthesis, and relates to some recent frameworks for scheduling, model-based prediction, diagnosis, repair, and reconfiguration. Another important theme is symbolic heuristic search, using representations inherited from the verification community, such as binary or algebraic decision diagrams. It was the goal of this workshop to bring together these many strands of research, with a view to identifying not only their diversity but also the substantial unity of the emerging field. We would like to thank the members of the program committee who worked hard in reviewing the papers on a very tight schedule. We are grateful to the AIPS workshop and local arrangement chairs, for their help with the organisation. Finally we are happy to acknowledge the contribution made by our sponsor PLANET, the European
