Decision Theory, Planning and Constraint Satisfaction

Decision-Theoretic Planning

Volume

Papers from the 1994 AAAI Spring Symposium

Contents

Among recent work at Strathclyde has been a set of projects in AI techniques for scheduling; a major portion of that is described in the 3 doctoral theses produced by Prosser, Burke, and Berry, and subsequent publications. Much of this has a distributed flavour, and includes a novel architectural paradigm for distributed problem-solving. This was amongst the earliest work to address solution repair (as well as construction) and did so with an elegant and economical approach. Part of that work, and other recent/on-going research, is concerned with focus during search and other aspects of search control. As a high-level technical (rather than applications) view of our work, I would say it is concerned with computational paradigms for (distributed/co-operative) search on basically combinatorial problems.