Munther A. Dahleh

Munther A. Dahleh

Auto-generated profile, based on publicly available information

Munther A. Dahleh

Massachusetts Institute of Technology

Research Focus & Metrics

Academic Career Length

35Years (1992-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2020 in Joule
Verified
Journal Article
Closed access
GRGuangchun Ruan
Guangchun Ruan
DWDongqi Wu
Dongqi Wu
XZXiangtian Zheng
Xiangtian Zheng
HZHaiwang Zhong
Haiwang Zhong
CKChongqing Kang
Chongqing Kang
LXLe Xie
Le Xie

23 July 2012 in IEEE Transactions on Automatic Control
Verified
Journal Article
Open access
GCGiacomo Como
Giacomo Como
KSKetan Savla
Ketan Savla
DADaron Acemoglu
Daron Acemoglu
MDMunther A. Dahleh
Munther A. Dahleh
EFEmilio Frazzoli
Emilio Frazzoli
Robustness of distributed routing policies is studied for dynamical networks, with respect to adversarial disturbances that reduce the link flow capacities. A dynamical network is modeled as a system of ordinary differential equations derived from mass conservation laws on a directed acyclic graph with a single origin-destination pair and a constant total outflow at the origin. Routing policies regulate the way the total outflow at each nondestination node gets split among its outgoing links as a function of the current particle density, while the outflow of a link is modeled to depend on the current particle density on that link through a flow function. The dynamical network is called partially transferring if the total inflow at the destination node is asymptotically bounded away from zero, and its weak resilience is measured as the minimum sum of the link-wise magnitude of disturbances that make it not partially transferring. The weak resilience of a dynamical network with arbitrary routing policy is shown to be upper bounded by the network's min-cut capacity and, hence, is independent of the initial flow conditions. Moreover, a class of distributed routing policies that rely exclusively on local information on the particle densities, and are locally responsive to that, is shown to yield such maximal weak resilience. These results imply that locality constraints on the information available to the routing policies do not cause loss of weak resilience. Fundamental properties of dynamical networks driven by locally responsive distributed routing policies are analyzed in detail, including global convergence to a unique limit flow. The derivation of these properties exploits the cooperative nature of these dynamical systems, together with an additional stability property implied by the assumption of monotonicity of the flow as a function of the density on each link.

3 December 2010 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
JNJerome Le Ny
Jerome Le Ny
EFEric M. Feron
Eric M. Feron
MDMunther A. Dahleh
Munther A. Dahleh
A set of N independent Gaussian linear time-in variant systems is observed by M sensors whose task is to provide a steady-state causal estimate minimizing the mean-square error on the system states, subject to additional measurement costs. The sensors can switch between systems instantaneously, and there are additional resource constraints, for example on the number of sensors that can observe a given system simultaneously. We first derive a tractable relaxation of the problem, which provides a bound on the achievable performance. This bound can be computed by solving a convex program involving linear matrix inequalities, and moreover this program can be decomposed into coupled smaller dimensional problems. In the scalar case with identical sensors, we give an analytical expression of an index policy proposed in a more general context by Whittle. In the general case, we develop open-loop periodic switching policies whose performance matches the bound arbitrarily closely.

24 November 2014 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Open access
KSKetan Savla
Ketan Savla
GCGiacomo Como
Giacomo Como
MDMunther A. Dahleh
Munther A. Dahleh
We propose a dynamical model for cascading failures in single-commodity network flows. In the proposed model, the network state consists of flows and activation status of the links. Network dynamics is determined by a, possibly state-dependent and adversarial, disturbance process that reduces flow capacity on the links, and routing policies at the nodes that have access to the network state, but are oblivious to the presence of disturbance. Under the proposed dynamics, a link becomes irreversibly inactive either due to overload condition on itself or on all of its immediate downstream links. The coupling between link activation and flow dynamics implies that links to become inactive successively are not necessarily adjacent to each other, and hence the pattern of cascading failure under our model is qualitatively different than standard cascade models. The magnitude of a disturbance process is defined as the sum of cumulative capacity reductions across time and links of the network, and the margin of resilience of the network is defined as the infimum over the magnitude of all disturbance processes under which the links at the origin node become inactive. We propose an algorithm to compute an upper bound on the margin of resilience for the setting where the routing policy only has access to information about the local state of the network. For the limiting case when the routing policies update their action as fast as network dynamics, we identify sufficient conditions on network parameters under which the upper bound is tight under an appropriate routing policy. Our analysis relies on making connections between network parameters and monotonicity in network state evolution under proposed dynamics.

21 October 2021 in IEEE Transactions on Smart Grid
Verified
Journal Article
Closed access
ISIan Schneider
Ian Schneider
MRMardavij Roozbehani
Mardavij Roozbehani
MDMunther Dahleh
Munther Dahleh
We study the optimal design of demand response and peak-time rebate programs in the electricity sector. Load-serving entities (LSEs) frequently use demand response or peak-time rebate programs to reduce consumption during peak hours. However, LSEs have imperfect information, so they typically estimate a customer’s counterfactual energy consumption—often referred to as ‘baseline’— and offer compensations for reductions below this threshold. Due to the inherent variability and uncertainty of demand, this approach may lead to generous incentives to customers who make no effort to reduce their demand, and underpayment to those who do. We show that the estimated baseline is not necessarily the optimal threshold for calculating rebates in demand response programs. The LSE needs to learn about customers’ demand patterns and also customers’ propensity for reductions over time. We bring in tools and methodologies from online learning to formulate and solve the LSE’s optimization problem in designing demand response program. By appropriately tuning the parameters, the LSE can use this framework to balance multiple objectives to determine the appropriate rebate threshold for customers. Using the data from a ToU pricing experiment in London, we show that compared to a conventional demand response program, our approach significantly improves the targeting of demand response payments.

1 December 2013 in Energy Conversion and Management
Verified
Journal Article
Open access
AFAli Faghih
Ali Faghih
MRMardavij Roozbehani
Mardavij Roozbehani
MDMunther A. Dahleh
Munther A. Dahleh
The primary concerns of this paper are twofold: understanding the value of storage in the presence of ramp constraints and exogenous energy prices, and understanding the implications of the associated optimal storage management policy for qualitative and quantitative characteristics of storage response to real-time prices. The optimal policy, along with the associated finite-horizon time-averaged value of storage, are analytically characterized in this paper. An analytical upper bound on the infinite-horizon time-averaged value of storage is also derived. This bound is valid for any achievable realization of prices when the support of the distribution is fixed, and highlights the dependence of the value of storage on ramp constraints and storage capacity. It is shown that while the value of storage is a non-decreasing function of price volatility, due to the finite ramp rate, the value of storage saturates quickly as the capacity increases, regardless of volatility. To study the implications of the optimal policy, computational experiments are presented that suggest optimal utilization of storage can, in expectation, induce a considerable amount of price elasticity near the average price. Then, a computational framework is presented for characterization of the behavior of storage as a function of price and the state of charge, which illustrates a steep buy/sell phase transition in the price-state plane.National Science Foundation (U.S.). Graduate Research FellowshipMIT Energy Initiative (Seed Grant)Charles Stark Draper Laborator