arXiv subjects

Manish Kumar Singh

Publications and source records attributed to Manish Kumar Singh.

22 records · Page 2Linked to original sources

arXiv2020

Moving horizon-based optimal scheduling of EV charging: A power system-cognizant approach

The rapid escalation in plug-in electric vehicles (PEVs) and their uncoordinated charging patterns pose several challenges in distribution system operation. Some of the undesirable effects include overloading of transformers, rapid voltage fluctuations, and over/under voltages. While this compromises the consumer power quality, it also puts on extra stress on the local voltage control devices. These challenges demand for a well-coordinated and power network-aware charging approach for PEVs in a community. This paper formulates a real-time electric vehicle charging scheduling problem as an mixed-integer linear program (MILP). The problem is to be solved by an aggregator, that provides charging service in a residential community. The proposed formulation maximizes the profit of the aggregator, enhancing the utilization of available infrastructure. With a prior knowledge of load demand and hourly electricity prices, the algorithm uses a moving time horizon optimization approach, allowing the number of vehicles arriving unknown. In this realistic setting, the proposed framework ensures that power system constraints are satisfied and guarantees desired PEV charging level within stipulated time. Numerical tests on a IEEE 13-node feeder system demonstrate the computational and performance superiority of the proposed MILP technique.

eess.SY↗

arXiv2020

Natural Gas Flow Solvers using Convex Relaxation

The vast infrastructure development, gas flow dynamics, and complex interdependence of gas with electric power networks call for advanced computational tools. Solving the equations relating gas injections to pressures and pipeline flows lies at the heart of natural gas network (NGN) operation, yet existing solvers require careful initialization and uniqueness has been an open question. In this context, this work considers the nonlinear steady-state version of the gas flow (GF) problem. It first establishes that the solution to the GF problem is unique under arbitrary NGN topologies, compressor types, and sets of specifications. For GF setups where pressure is specified on a single (reference) node and compressors do no appear in cycles, the GF task is posed as an convex minimization. To handle more general setups, a GF solver relying on a mixed-integer quadratically-constrained quadratic program (MI-QCQP) is also devised. This solver can be used for any GF setup at any NGN. It introduces binary variables to capture flow directions; relaxes the pressure drop equations to quadratic inequality constraints; and uses a carefully selected objective to promote the exactness of this relaxation. The relaxation is provably exact in NGNs with non-overlapping cycles and a single fixed-pressure node. The solver handles efficiently the involved bilinear terms through McCormick linearization. Numerical tests validate our claims, demonstrate that the MI-QCQP solver scales well, and that the relaxation is exact even when the sufficient conditions are violated, such as in NGNs with overlapping cycles and multiple fixed-pressure nodes.

math.OC↗

arXiv2018

Optimal Distribution System Restoration with Microgrids and Distributed Generators

Increasing emphasis on reliability and resiliency call for advanced distribution system restoration (DSR). The integration of grid sensors, remote controls, and distributed generators (DG) brings about exciting opportunities in DSR. In this context, this work considers the task of single-step restoration of a single phase power distribution system. Different from existing works, the devised restoration scheme achieves optimal formation of islands without heuristically pre-identifying reference buses. It further facilitates multiple DGs running within the same island, and establishes a coordination hierarchy in terms of their PV/PQ operation modes. Generators without black-start capability are guaranteed to remain connected to a black-start DG or a substation. The proposed scheme models remotely-controlled voltage regulators exactly, and integrates them in the restoration process. Numerical tests on a modified IEEE 37-bus feeder demonstrate that the proposed mixed-integer linear program (MILP) takes less than four seconds to handle random outages of 1-5 lines. The scalability of this novel MILP formulation can be attributed to the unique use of cycles and paths on the grid infrastructure graph; the McCormick linearization technique; and an approximate power flow model.

math.OC↗

arXiv2018

Quillen--Suslin Theory; Revisited over Graded Rings

In this paper we deduce a graded version of Quillen--Suslin's Local-Global Principle for the traditional classical groups, viz. general linear, symplectic and orthogonal groups and establish its equivalence of the normality property of the respective elementary subgroups. This generalizes previous result of Basu--Rao--Khanna. Then, as an application, we establish an analogue Local-Global Principle for the commutator subgroups of the special linear and symplectic groups. Finally, by using Swan-Weibel's homotopy trick, we establish graded analogue of the Local-Global Principle for the transvection subgroups of the full automorphism groups of the linear, symplectic and orthogonal modules. This generalizes the previous result of Bak--Basu--Rao.

math.KT↗