Breadcrumb
- Home
- Publications
- Proceedings
- 2010 Annual Meeting
- Computing and Systems Technology Division
- CAST Division Plenary
- (14a) Design of Massive Energy Storage Systems for IGCC Based Electric Power Generation
The effort begins with the design of a high level (supervisory) control system that is capable of market responsiveness. That is, design a controller that uses the electricity spot price as a disturbance input to the decision making process. However, in contrast to traditional controller designs, where the objective is to attenuate disturbances, the Market Responsive Controller should judiciously amplify the spot price disturbance. We have found that a Linear Quadratic Gaussian controller can be forced to have such behavior if the cross-term weights of the objective function are utilized. However, it is a non-trivial task to select weights such that profit is maximized (by producing electricity when the price is high and storing when low), while observing the equipment limitations of the storage and conversion units. Thus, a core result of the paper is the development of a profit maximizing scheme for the selection of LQG weights subject to process equipment limitations. The resulting optimization problem will be shown to be convex and thus will yield a globally optimal solution.
Now turn to the question of sizing the storage and conversion equipment. Intuition suggests the following: Larger storage capacity coupled with larger conversion throughput will enhance the ability of the previous control scheme to exploit price swings. However, at some point the capital cost associated with ever larger equipment will begin to outweigh the increase in operating profit, resulting in a sign change in the levelized profit. Thus, the main result of the paper is the development of a levelized profit maximization scheme for the sizing of storage and conversion equipment. The resulting optimization problem is shown possess a linear objective function and convex constraints along with a small number of scalar reverse-convex constraints. Based on this formulation it will be shown that the optimization problem will yield a globally optimal solution with the aid of a branch and bound algorithm.