Sanjay Lall

Sanjay Lall

Auto-generated profile, based on publicly available information

Sanjay Lall

Stanford University

Research Focus & Metrics

Academic Career Length

32Years (1995-Present)

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

Representative Publications

View All Publications
18 February 2002 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
SLSanjay Lall
Sanjay Lall
JMJerrold E. Marsden
Jerrold E. Marsden
SGSonja Glavaški
Sonja Glavaški

1 January 2003 in European Journal of Control
Verified
Journal Article
Closed access
PPPablo A. Parrilo
Pablo A. Parrilo
SLSanjay Lall
Sanjay Lall
We present an overview of the essential elements of semidefinite programming as a computational tool for the analysis of systems and control problems. We make particular emphasis on general duality properties as providing suboptimality or infeasibility certificates. Our focus is on the exciting developments which have occured in the last few years, including robust optimization, combinatorial optimization, and algebraic methods such as sum-of-squares. These developments are illustrated with examples of applications to control systems.

1 July 2007
Verified
Conference Paper
Closed access
RCRandy Cogill
Randy Cogill
SLSanjay Lall
Sanjay Lall
JHJoao Hespanha
Joao Hespanha
We consider a control system in which sensor data is transmitted from the plant to a receiver over a communication channel, and the receiver uses the data to estimate the state of the plant. Using a feedback policy to choose when to transmit data, the goal is to schedule transmissions to balance a trade-off between communication rate and estimation error. Computing an optimal policy for this problem is generally computationally intensive. Here we provide a simple algorithm for computing a suboptimal policy for scheduling state transmissions which incurs a cost within a factor of six of the optimal achievable cost.

16 August 2024 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
SLSanjay Lall
Sanjay Lall
CCCălin Caşcaval
Călin Caşcaval
MIMartin Izzard
Martin Izzard
TSTammo Spalink
Tammo Spalink
We introduce logical synchrony, a framework that allows distributed computing to be coordinated as tightly as in synchronous systems without the distribution of a global clock or any reference to universal time. We develop a model of events called a logical synchrony network, in which nodes correspond to processors and every node has an associated local clock which generates the events. We construct a measure of logical latency and develop its properties. A further model, called a multiclock network, is then analyzed and shown to be a refinement of the logical synchrony network. We present the bittide mechanism as an instantiation of multiclock networks, and discuss the clock control mechanism that ensures that buffers do not overflow or underflow. Finally we give conditions under which a logical synchrony network has an equivalent synchronous realization

15 March 2006
Verified
Book Chapter
Closed access
PDF file
RCRandy Cogill
Randy Cogill
MRMichael Rotkowitz
Michael Rotkowitz
BRBenjamin Roy
Benjamin Roy
SLSanjay Lall
Sanjay Lall

1 January 2006
Verified
Conference Paper
Closed access
MPMatthew Peet
Matthew Peet
APAntonis Papachristodoulou
Antonis Papachristodoulou
SLSanjay Lall
Sanjay Lall
We consider the problem of constructing Lyapunov functions for linear differential equations with delays. For such systems it is known that stability implies that there exists a quadratic Lyapunov function on the state space, although this is in general infinite dimensional. We give an explicit parametrization of a finite-dimensional subset of the cone of Lyapunov functions. Positivity of this class of functions is enforced using sum-of-squares polynomial matrices. This allows the computation to be formulated as a semidefinite program