#### Filter Results:

- Full text PDF available (42)

#### Publication Year

2006

2017

- This year (7)
- Last 5 years (40)
- Last 10 years (42)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

Incentivizing Efficiency in Societal-Scale Cyber-Physical Systems

- Roy Dong, Lillian J. Ratliff, Henrik Ohlsson, S. Shankar Sastry
- HiCoNS
- 2014

Provided an arbitrary nonintrusive load monitoring (NILM) algorithm, we seek bounds on the probability of distinguishing between scenarios, given an aggregate power consumption signal. We introduce a framework for studying a general NILM algorithm, and analyze the theory in the general case. Then, we specialize to the case where the error is Gaussian. In… (More)

This paper investigates the use of pricing mechanisms as a means to achieve a desired feedback control strategy among selfish agents in the context of HVAC resource allocation in buildings. We pose the problem of resource allocation as a linear-quadratic game with many dynamically coupled zone occupants(agents) and an uncoupled social planner. The social… (More)

AhstractEnergy disaggregation, also known as non intrusive load monitoring (NILM), is the task of separating aggregate energy data for a whole building into the energy data for individual appliances. Studies have shown that simply providing disaggregated data to the consumer improves energy consumption behavior. However, placing individual sensors on every… (More)

- Lillian J. Ratliff, Samuel Burden, S. Shankar Sastry
- IEEE Trans. Automat. Contr.
- 2016

We present a unified framework for characterizing local Nash equilibria in continuous games on either infinitedimensional or finite-dimensional non-convex strategy spaces. We provide intrinsic necessary and sufficient firstand second-order conditions ensuring strategies constitute local Nash equilibria. We term points satisfying the sufficient conditions… (More)

- Henrik Ohlsson, Lillian J. Ratliff, Roy Dong, S. Shankar Sastry
- ArXiv
- 2013

Blind system identification is known to be an ill-posed problem and without further assumptions, no unique solution is at hand. In this contribution, we are concerned with the task of identifying an ARX model from only output measurements. We phrase this as a constrained rank minimization problem and present a relaxed convex formulation to approximate its… (More)

- Henrik Ohlsson, Lillian J. Ratliff, Roy Dong, S. Shankar Sastry
- ArXiv
- 2013

Blind system identification is known to be a hard ill-posed problem and without further assumptions, no unique solution is at hand. In this contribution, we are concerned with the task of identifying an ARX model from only output measurements. Driven by the task of identifying systems that are turned on and off at unknown times, we seek a piecewise constant… (More)

- Pushkin Kachroo, Lillian J. Ratliff, S. Shankar Sastry
- IEEE Transactions on Intelligent Transportation…
- 2014

This paper presents the detailed analysis of a Godunov-approximation-based dynamics model for an isolated traffic ramp metering problem. The model for the system is based on a Godunov numerical scheme so that the lumped parameter approximation retains the weak solution shock and rarefaction wave properties exhibited by the distributed model. This paper… (More)

- Lillian J. Ratliff, Samuel Burden, S. Shankar Sastry
- 2013 51st Annual Allerton Conference on…
- 2013

We present derivative-based necessary and sufficient conditions ensuring player strategies constitute local Nash equilibria in non-cooperative continuous games. Our results can be interpreted as generalizations of analogous second-order conditions for local optimality from nonlinear programming and optimal control theory. Drawing on this analogy, we propose… (More)

- Roy Dong, Lillian J. Ratliff, Henrik Ohlsson, S. Shankar Sastry
- 2013 51st Annual Allerton Conference on…
- 2013

The energy disaggregation problem is recovering device level power consumption signals from the aggregate power consumption signal for a building. We show in this paper how the disaggregation problem can be reformulated as an adaptive filtering problem. This gives both a novel disaggregation algorithm and a better theoretical understanding for… (More)