On designing CO$T: a new approach and programming environment for distributed problem solving based on evolutionary computation and anytime algorithms

In This work we present a unified view of AI inspired by ideas from evolutionary computation as design of bounded rational agents. The approach specifies optimal programs rather than optimal actions, and is based on process algebras and anytime algorithms. The search method described in This work is so general than many other search algorithms, including evolutionary search methods, become its special case. We present a practical design of the programming language and environment targeting real-time complex domains. As AI systems move into more complex domains, all problems become real-time, because the agent never have long enough time to solve the decision problem exactly.