Minimizing Running Costs in Consumption Systems

A standard approach to optimizing long-run running costs of discrete systems is based on minimizing the mean-payoff, i.e., the long-run average amount of resources ("energy") consumed per transition. However, this approach inherently assumes that the energy source has an unbounded capacity, which is not always realistic. For example, an autonomous robotic device has a battery of finite capacity that has to be recharged periodically, and the total amount of energy consumed between two successive charging cycles is bounded by the capacity. Hence, a controller minimizing the mean-payoff must obey this restriction. In this paper we study the controller synthesis problem for consumption systems with a finite battery capacity, where the task of the controller is to minimize the mean-payoff while preserving the functionality of the system encoded by a given linear-time property. We show that an optimal controller always exists, and it may either need only finite memory or require infinite memory (it is decidable in polynomial time which of the two cases holds). Further, we show how to compute an effective description of an optimal controller in polynomial time. Finally, we consider the limit values achievable by larger and larger battery capacity, show that these values are computable in polynomial time, and we also analyze the corresponding rate of convergence. To the best of our knowledge, these are the first results about optimizing the long-run running costs in systems with bounded energy stores.Comment: 32 pages, corrections of typos and minor omission

On the first Hochschild cohomology group of a cluster-tilted algebra

Given a cluster-tilted algebra B, we study its first Hochschild cohomology group HH^1(B) with coefficients in the B-B-bimodule B. If C is a tilted algebra such that B is the relation extension of C, then we show that if C is constrained, or else if B is tame, then HH^1(B) is isomorphic, as a k-vector space, to the direct sum of HH^1(C) with k^{n\_{B,C}}, where n\_{B,C} is an invariant linking the bound quivers of B and C. In the representation-finite case, HH^1(B) can be read off simply by looking at the quiver of B.Comment: 30 page