Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Control Theory

214 missions · 87 completed

Missions

Open127Completed87All214
🏆Completed
Operations ResearchStochastic Systems·Captain: mikedeng1

Distributed Scheduling Based on Due Dates and Buffer Priorities 1: First Buffer First Serve Is Stable on Every Nonacyclic Flow Line Whose Bursty Arrival Rate Is Below CapacityResearch Paper

Semiconductor wafer fabs are the standard example of a reentrant manufacturing line: a wafer visits the same lithography or etching station many times along a route of hundreds of steps, so each station holds parts at many different stages of completion and must decide, every time a machine frees up, which of them to serve next. Kumar (Re-entrant lines,…

7 thms2 active usersReviewed
🏆Completed
Dynamical SystemsOperations Research·Captain: mikedeng1

Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems 4: A Run-Truncating Priority-Queue Supervisor Keeps Every Buffer Bounded When ρₘ < 1Research Paper

A flexible manufacturing system routes several part types through a set of machines; a machine that switches from one kind of part to another must spend a set-up time first. Each machine has to decide, in real time and from local information only, which of its waiting buffers to work on and for how long. Long runs waste little time on set-ups but starve…

8 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 2: The Coupled Backward-Forward System Has a Unique Adapted Solution When k Times the H∞ Norm of D Is Below OneResearch Paper

A backward-forward stochastic differential equation couples two equations that run in opposite time directions: a forward equation for a state UUU, started from a given input, and a backward equation for a quantity VVV, pinned at a terminal time by a random variable YYY. Each equation's coefficients depend on both unknowns, so the solution at time ttt depends on…

8 thms2 active usersReviewed
Dynamical SystemsOperations ResearchOptimization·Captain: mikedeng1

Homogeneous Approximation, Recursive Observer Design, and Output Feedback: Global Asymptotic Stabilization of a Chain of Integrators by a Homogeneous-in-the-Bi-Limit Output FeedbackResearch Paper

Many nonlinear control systems behave like a chain of integrators, x˙1=x2,…,x˙n=u\dot x_1=x_2,\dots,\dot x_n=ux˙1​=x2​,…,x˙n​=u, with additional terms that are small either near the origin or far from it. Designs based on weighted homogeneity handle such systems by making the closed loop invariant under a dilation, which gives robustness to perturbations that are dominated by the…

13 thms2 active usersReviewed
🏆Completed
Dynamical SystemsOperations Research·Captain: mikedeng1

Dynamic Instabilities and Stabilization Methods in Distributed Real-Time Scheduling of Manufacturing Systems 1: Clearing Policies Are Unstable on a Re-Entrant Two-Machine Line, Even Without Set-UpsResearch Paper

A flexible manufacturing system is a set of machines through which parts of several types travel along fixed routes; each machine serves several buffers and must pay a set-up time whenever it switches from one buffer to another. Real-time scheduling decides, as the system evolves, which buffer each machine works on. Perkins and Kumar (IEEE Trans. Automat.…

10 thms2 active usersReviewed
ProbabilityStochastic Systems·Captain: mikedeng1

Backward-Forward Stochastic Differential Equations 1: A Backward Equation Driven by a Bounded-Variation Integrator Has a Unique Adapted Solution in L¹(μ) Under Integrability AloneResearch Paper

Backward stochastic differential equations (BSDEs) prescribe a process by its terminal value rather than its initial value: the unknown VVV must be adapted to the information flow, yet must reach a given random variable YYY at the horizon TTT. They arise in mathematical finance (pricing and hedging, where YYY is a contingent claim), in stochastic control (adjoint…

10 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Optimality of Affine Policies in Multistage Robust Optimization: In One-Dimensional Constrained Min-Max Control, Disturbance-Affine Policies with Affine Stage Costs Attain the Optimal ValueResearch Paper

Multistage robust optimization chooses decisions over time while an adversary picks the uncertain data from a known set; every later decision may react to what has been observed. The exact problem is a nested min-max over functions of the past, and is intractable in general. The standard workaround, proposed by Ben-Tal, Goryashko, Guslitzer and Nemirovski (M…

11 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: mikedeng1

Optimal Dynamic Pricing of Inventories with Stochastic Demand over Finite Horizons 2: The Optimal Revenue Is Strictly Concave in Stock and Time; the Optimal Price Falls with Stock, Rises with TimeResearch Paper

A retailer holding a fixed stock of a perishable or seasonal good (fashion items, airline seats, hotel rooms, concert tickets) must sell it before a deadline, after which unsold units are worthless. Demand is random and depends on the posted price, and the firm may change its price at any time. Dynamic pricing asks how the price should depend on the…

10 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Scheduling a Multi Class Queue with Many Exponential Servers: Asymptotic Optimality in Heavy Traffic: The HJB-Based Preemptive Policy Is Asymptotically Optimal Among Work-Conserving PoliciesResearch Paper

Large call centers route several types of customers to a common pool of agents. When the pool is large and highly utilized, the relevant asymptotic regime is the quality-and-efficiency-driven (QED) or Halfin–Whitt regime (Halfin & Whitt 1981). The number of servers nnn grows while the offered load stays within O(n)O(\sqrt n)O(n​) of nnn. Waiting is then neither…

18 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingProbability·Captain: mikedeng1

Discrete-Time Controlled Markov Processes with Average Cost Criterion: A Survey 6: A Canonical Policy Is Strong Average Optimal and Its Average Cost Is the Optimal OneResearch Paper

A controlled Markov process (CMP), or Markov decision process, models a system that moves randomly between states while a controller chooses actions that influence both the cost incurred and the next state. When the planning horizon is long and no discounting is natural (queueing control, inventory, communication networks, maintenance), the criterion of…

12 thms2 active usersReviewed
🏆Completed
Algorithmic Game TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Nonzero-Sum Stochastic Differential Games with Impulse Controls: A Verification Theorem with Applications 2: An Explicit Family of Nash Equilibria for the Linear Impulse GameResearch Paper

Impulse control models an agent who acts on a random system through discrete interventions, each with a fixed cost: inventory replenishment, cash management, exchange-rate interventions by a central bank. With two agents whose objectives conflict, the problem becomes a nonzero-sum stochastic differential game with impulse controls. Before the work of Aïd,…

11 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization·Captain: mikedeng1

Stochastic Optimal Control: The Discrete-Time Case I: Finite-Horizon Abstract Dynamic Programming — the DP Algorithm Yields the N-Stage Optimal CostTextbook

Dynamic programming (DP) solves sequential decision problems by backward recursion: compute the optimal cost of the last stage, then of the last two stages, and so on. For problems with finitely many states and controls and real-valued costs, the recursion obviously gives the optimal cost. Applications are rarely like that. Control spaces are continuous,…

12 thms2 active usersReviewed
Calculus of VariationsOptimization·Captain: mikedeng1

On the Variational Principle III: Every Terminal-Cost Control Problem Has ε-Optimal Measurable Controls Satisfying the Pontryagin Maximum Principle up to εResearch Paper

The Pontryagin maximum principle is the basic first-order necessary condition of optimal control: along an optimal control, the control value at almost every time extremizes a Hamiltonian built from the dynamics and an adjoint vector. The classical statement presupposes that an optimal control exists. For many problems none does: the set of trajectories is…

11 thms2 active usersReviewed
Operations ResearchProbabilityStochastic Systems·Captain: mikedeng1

Dynamic Scheduling of a System with Two Parallel Servers in Heavy Traffic with Resource Pooling: The Threshold Policy Is Asymptotically OptimalResearch Paper

Many service systems route several classes of work to servers with overlapping skills: call centers with cross-trained agents, manufacturing cells with flexible machines, computing clusters with heterogeneous processors. Choosing which server works on which class at each moment is a dynamic scheduling problem. Exact optimal policies are out of reach except…

14 thms2 active usersReviewed
Mechanism DesignOperations ResearchStochastic Systems·Captain: mikedeng1

Optimal Electricity Demand Response Contracting with Responsiveness Incentives 1: The Producer's Second-Best Value in Closed FormResearch Paper

Demand response asks electricity consumers to lower or smooth their consumption when generation is expensive, in exchange for payments. Field trials such as Low Carbon London showed two effects of such incentives: consumers reduce their average consumption, and the variability of their response depends on how much effort they put into it. A producer who…

7 thms2 active usersReviewed
Algorithmic Game TheoryOperations ResearchStochastic Systems·Captain: mikedeng1

Nonzero-Sum Stochastic Differential Games with Impulse Controls: A Verification Theorem with Applications 1: Regular Solutions of the Quasi-Variational Inequalities Give Nash Equilibrium PayoffsResearch Paper

Many economic and engineering systems are steered by agents who act at discrete instants rather than continuously: a central bank intervenes on an exchange rate, two energy producers adjust a shared stock, a firm rebalances inventory. Each action has a fixed cost, so continuous control is not realistic. The mathematical model is impulse control: the state…

11 thms2 active usersReviewed
🏆Completed
Dynamic ProgrammingOperations ResearchOptimization+1·Captain: mikedeng1

Bellman's Dynamic Programming VI: Optimal Policies for the Continuous Gold-Mining ProcessTextbook

Chapter II of Richard Bellman's Dynamic Programming (Princeton University Press, 1957) solves a discrete gold-mining process: a single machine can be used in one of two mines, each use extracts a fixed fraction of the gold remaining in that mine, and each use carries a fixed risk of destroying the machine. Maximizing the expected total gold leads to an index…

11 thms2 active usersReviewed
AnalysisPartial Differential Equations·Captain: mikedeng1

Stability and Instability Results of the Wave Equation with a Delay Term in the Boundary or Internal Feedbacks IV: Arbitrarily Small Destabilizing Delays for Internal DampingResearch Paper

Feedback laws in engineering are applied with a lag: sensors, actuators and communication channels introduce a time delay τ\tauτ between the measurement of a state and the control that reacts to it. For finite-dimensional systems small delays are usually harmless. For distributed systems such as the wave equation they need not be: Datko, Lagnese and Polis…

11 thms2 active usersReviewed
AnalysisPartial Differential Equations·Captain: mikedeng1

Stability and Instability Results of the Wave Equation with a Delay Term in the Boundary or Internal Feedbacks III: Destabilizing Delays for Boundary FeedbackResearch Paper

Boundary feedback stabilization of the wave equation asks whether a damping term placed on part of the boundary drives the energy of every solution to zero. Without delay the answer is classical: the feedback ∂u/∂ν=−μ1ut\partial u/\partial\nu = -\mu_1 u_t∂u/∂ν=−μ1​ut​ on a part ΓN\Gamma_NΓN​ of the boundary gives exponential energy decay under geometric conditions (Chen, Lagnese,…

8 thms2 active usersReviewed
Dynamical SystemsLinear algebra·Captain: mikedeng1

Stabilization for a Perturbed Chain of Integrators in Prescribed Time I: Prescribed-Time Estimates for the Linear Time-Varying FeedbackResearch Paper

Many control tasks have to settle at a given deadline, not merely eventually. Examples are missile guidance, where the interception time is fixed in advance, and rendezvous or consensus manoeuvres that must finish by a scheduled instant. Prescribed-time stabilization asks for a feedback that brings the state of a system to the origin at a time T>0T>0T>0 chosen by…

10 thms2 active usersReviewed
🏆Completed
Operations ResearchTheoretical Computer Science·Captain: mikedeng1

Supervisory Control of a Class of Discrete Event Processes II: Every Reduced, Trim Supervisor Is the Quotient of a Supervisor Built on a Recognizer for Its Closed-Loop LanguageResearch Paper

Supervisory control theory, introduced by Ramadge and Wonham (SIAM J. Control Optim. 25(1), 1987), models a manufacturing cell, a communication protocol or a resource-sharing system as an automaton whose transitions are events, some of which an external controller may disable. A controller, the supervisor, is itself an automaton that watches the event…

15 thms2 active usersReviewed
🏆Completed
Convex OptimizationOperations ResearchOptimization·Captain: mikedeng1

Robust Solutions to Uncertain Semidefinite Programs II: An SDP Inner Approximation of the Robust Feasible Set under Structured PerturbationsResearch Paper

A semidefinite program (SDP) minimizes a linear objective cTxc^TxcTx subject to a linear matrix inequality F(x)=F0+∑i=1mxiFi⪰0F(x) = F_0 + \sum_{i=1}^m x_i F_i \succeq 0F(x)=F0​+∑i=1m​xi​Fi​⪰0. In engineering applications the coefficient matrices are rarely known exactly: they come from measurements, from a model of a physical plant, or from a finite-precision implementation. El Ghaoui, Oustry and Lebret…

5 thms2 active usersReviewed
Operations ResearchOptimization·Captain: mikedeng1

Optimizing Static Linear Feedback: Gradient Method II: The Gradient Flow Stays in the Sublevel Set and Converges Exponentially under State FeedbackResearch Paper

The linear-quadratic regulator (LQR) is the basic problem of optimal control: steer a linear system x˙=Ax+Bu\dot x = Ax + Bux˙=Ax+Bu so as to minimize an integrated quadratic cost of state and input. When the full state is measured, the optimal law is a static linear feedback u=−Kxu = -Kxu=−Kx obtained from an algebraic Riccati equation. When only an output y=Cxy = Cxy=Cx is measured, the…

13 thms2 active usersReviewed
🏆Completed
Operations ResearchOptimization·Captain: naimengye

Stochastic Networks VII: Internet Congestion Control and the Primal AlgorithmTextbook

When a file is transferred over the Internet, no part of the network decides how fast it should go. The machines inside the network forward packets; when a resource is heavily loaded it drops or marks one; the destination reports that to the source; and the source slows down, then gradually speeds up again until the next signal. This end-to-end cycle of…

8 thms2 active usersReviewed
🏆Completed
Functional Analysis·Captain: olivier

Fading Memory and Approximation of Nonlinear Operators (Boyd & Chua, 1985)Research Paper

A recurrent network, a nonlinear filter, a physical transducer: all are operators carrying an input signal to an output signal. Approximating such an operator — not a function on Rn\mathbb{R}^nRn, but a map between signal spaces — is the question behind every claim that a recurrent architecture is "universal".

6 thms2 active usersReviewed
PreviousPage 7 of 9Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me