Energy-intensive industries have to reduce fossil fuel consumption while scheduling production for cost efficiency. It poses the question that how to coordinate renewable energy generation, storage, heat recovery and energy cascade utilization in real time to deal with the low energy efficiency and continuous production problems existing in complex dynamic coupled process production. This question is further complicated while facing difficulties in collaborative modeling and online control by the underlying stochastic process without accurate statistic knowledge. To characterize the above issues, a nonconvex operation optimization problem is formulated for coupling production and energy joint scheduling. To obtain a simple online solution with provable performance, a method by combining Lyapunov optimization and actor-critic deep reinforcement learning is proposed. The former is used to decouple the original problem into small-size non-convex subproblems for each time slot and guarantee the long-term constraints. The latter aims at the nonconvex part by using model information of the former to obtain accurate evaluations of production actions for fast convergence and high robustness with low computational complexity. The simulation shows that the proposed method can achieve the online optimal benefit while ensuring production tasks and system stability with high scalability.
15 December 2023 in IEEE Transactions on Communications
Maximum distance separable (MDS) codes are commonly deployed in distributed storage systems as they provide the maximum failure tolerance for some given redundancy. The repair problem of MDS codes has drawn much attention and various constructions of MDS array codes with optimal repair bandwidth have been proposed in the last decade. However, few of the existing codes are constructed over the binary field. In this paper, we propose new constructions of binary MDS array codes with optimal repair (or access) bandwidth for single-node failure. Specifically, by stacking multiple Blaum-Roth code instances of which the parity-check matrices are judiciously designed, we obtain three families of binary MDS array codes with optimal repair bandwidth; using the permutation matrices as building blocks, we also construct two families of binary MDS array codes with optimal access bandwidth. Moreover, error-resilient capability while achieving the lower bound on repair (or access) bandwidth is obtained when the number of helper nodes d < n - 1. All the codes in this paper are constructed over a particular ring of binary polynomials. Consequently, computation operations involved in the encoding, decoding and node repair procedures for these codes are only XORs and cyclic shifts, avoiding complex multiplications and divisions over large finite fields.