Concept

Optimal control

Optimal control theory is a branch of mathematical optimization that deals with finding a control for a dynamical system over a period of time such that an objective function is optimized. It has numerous applications in science, engineering and operations research. For example, the dynamical system might be a spacecraft with controls corresponding to rocket thrusters, and the objective might be to reach the moon with minimum fuel expenditure. Or the dynamical system could be a nation's economy, with the objective to minimize unemployment; the controls in this case could be fiscal and monetary policy. A dynamical system may also be introduced to embed operations research problems within the framework of optimal control theory. Optimal control is an extension of the calculus of variations, and is a mathematical optimization method for deriving control policies. The method is largely due to the work of Lev Pontryagin and Richard Bellman in the 1950s, after contributions to calculus of variations by Edward J. McShane. Optimal control can be seen as a control strategy in control theory. Optimal control deals with the problem of finding a control law for a given system such that a certain optimality criterion is achieved. A control problem includes a cost functional that is a function of state and control variables. An optimal control is a set of differential equations describing the paths of the control variables that minimize the cost function. The optimal control can be derived using Pontryagin's maximum principle (a necessary condition also known as Pontryagin's minimum principle or simply Pontryagin's principle), or by solving the Hamilton–Jacobi–Bellman equation (a sufficient condition). We begin with a simple example. Consider a car traveling in a straight line on a hilly road. The question is, how should the driver press the accelerator pedal in order to minimize the total traveling time? In this example, the term control law refers specifically to the way in which the driver presses the accelerator and shifts the gears.

Official source

https://en.wikipedia.org/wiki/Optimal_control

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related courses (32)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

MATH-261: Discrete optimization

This course is an introduction to linear and discrete optimization. Warning: This is a mathematics course! While much of the course will be algorithmic in nature, you will still need to be able to prove theorems. ...

Related units (32)

IGM - Administration

Automatic Control Laboratory 3

Learning algorithms and systems Laboratory

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Official source

https://en.wikipedia.org/wiki/Optimal_control

About this result

Related courses (32)

MGT-418: Convex optimization

This course introduces the theory and application of modern convex optimization from an engineering perspective. ...

CS-101: Advanced information, computation, communication I

MATH-261: Discrete optimization

Related lectures (32)

Dynamic Programming: Optimal Control

Explores Dynamic Programming for optimal control, covering machine replacement, Markov chains, control policies, and linear quadratic problems.

Dynamic Programming: Optimal Control

Explores Dynamic Programming for optimal control, focusing on stability, stationary policy, and recursive solutions.

Optimal Control Theory: OCPs

Covers Optimal Control Theory, focusing on Optimal Control Problems (OCPs) and the calculus of variations.

Related publications (32)

Optimal market-aware scheduling and control of EV batteries in second-life usage

As the share of renewable energy in power systems increases, the resulting need for additional flexibility can be supported by second-life battery energy storage systems. However, their operation is complicated by the heterogeneity of the constituent battery packs. This paper addresses this challenge by proposing an optimization framework that uses battery packs’ losses as a proxy for battery degradation. The proposed two-stage framework (i) optimizes the participation of multiple second-life battery packs,

2027

Parallel Model Predictive Control for Deterministic Systems

In this note, we consider infinite horizon optimal control problems with deterministic systems. Since exact solutions to these problems are often intractable, we propose a parallel model predictive control (MPC) method that provides an approximate solution. Our method computes multiple lookahead minimization problems at each time, where each minimization may involve a different number of lookahead steps, and terminal cost and constraint. The policy computed via parallel MPC applies the first control of the

Institute of Electrical and Electronics Engineers (IEEE)2026

Constrained Meta Reinforcement Learning with Provable Test-Time Safety

Meta reinforcement learning (RL) allows agents to leverage experience across a distribution of tasks on which the agent can train at will, enabling faster learning of optimal policies on new test tasks. Despite its success in improving sample complexity on test tasks, many real-world applications, such as robotics and healthcare, impose safety constraints during testing. Constrained meta RL provides a promising framework for integrating safety into meta RL. An open question in constrained meta RL is how to

PMLR2026

Related people (32)

Mario Paolone

Mario Paolone received the M.Sc. (with honors) and the Ph.D. degree in electrical engineering from the University of Bologna, Italy, in 1998 and 2002, respectively. In 2005, he was appointed assistant professor in power systems at the University of Bologna where he was with the Power Systems laboratory until 2011. In 2010, he received the Associate Professor eligibility from the Politecnico di Milano, Italy. Since 2011 he joined the Swiss Federal Institute of Technology, Lausanne, Switzerland, where he is now Full Professor, Chair of the Distributed Electrical Systems laboratory and Head of the Swiss Competence Center for Energy Research (SCCER) FURIES (Future Swiss Electrical infrastructure). He was co-chairperson of the technical programme committees of the 9th edition of the International Conference of Power Systems Transients (IPST 2009) and of the 2016 Power Systems Computation Conference (PSCC 2016). He was chair of the technical programme committee of the 2018 Power Systems Computation Conference (PSCC 2018). In 2013, he was the recipient of the IEEE EMC Society Technical Achievement Award. He was co-author of several papers that received the following awards: best IEEE Transactions on EMC paper award for the year 2017, in 2014 best paper award at the 13th International Conference on Probabilistic Methods Applied to Power Systems, Durham, UK, in 2013 Basil Papadias best paper award at the 2013 IEEE PowerTech, Grenoble, France, in 2008 best paper award at the International Universities Power Engineering Conference (UPEC). He was the founder Editor-in-Chief of the Elsevier journal Sustainable Energy, Grids and Networks and was Associate Editor of the IEEE Transactions on Industrial Informatics. His research interests are in power systems with particular reference to real-time monitoring and operation, power system protections, power systems dynamics and power system transients. Mario Paolone is author or coauthor of over 300 scientific papers published in reviewed journals and international conferences.

Tyler Summers

Teaching & PhD Courses Dynamic programming and optimal control ENG-651 This course provides an introduction to stochastic optimal control and dynamic programming (DP), with a variety of engineeringapplications. The course focuses on the DP principle of optimality, and its utility in deriving and approximating solutions to an optimalcontrol problem.

Giovanni De Micheli

Expertise Design technologies for integrated systems on silicon, such as synthesis, hw/sw codesign and low-power design, as well as systems on heterogeneous platforms including electrical and biological components. Scientific Director of EcoCloud Center at EPFL Directing activities towards creating sustainable computation including AI.Designing energy-savvy data centers and edge devices. More information Please read http://si2.epfl.ch/~demichel/ Giovanni De Micheli is a research scientist in electronics and

Michaël Unser

Expertise Image Processing, Medical Imaging, Biological Imaging, Wavelets, Splines, Multiresolution Michael Unser is Full Professor with EPFL’s school of Engineering and the academic director of EPFL's Center for Imaging, Lausanne, Switzerland. His primary areas of investigation are signal processing, biomedical imaging and applied functional analysis. He is internationally recognized for his research contributions to sampling theory, wavelets, the use of splines for image processing, stochastic processes,

Sylvain Calinon

Expertise robot learning, human-robot collaboration, optimal control, model-based optimization I am a Senior Research Scientist at the Idiap Research Institute and a Lecturer at EPFL, with research interests covering robot learning, optimal control, geometrical approaches, and human-robot collaboration. My work focuses on human-centered robotics applications in which the robots can acquire new skills from only few demonstrations and interactions. It requires the development of models that can exploit the st

Philippe Müllhaupt

Expertise Nonlinear Control (Geometry and Algebra)Classical DynamicsRoboticsStatistics Mission Provide rigorous technical and scientific training in nonlinear control, classical mechanics, and statistical theory Current Work Research and teaching in the fields of control theory, statistics, dynamical systems, and general mechanics. Philippe Mullhaupt received his Diplôme d Education Ingï¿½nieur | Electricitï¿½ 1993 – 1993 EPFL DEA | Automatique et Traitement du Signal 199

Olivier Sauter

Teaching & PhD PhD Students Cassandre Ekta Contré, Antonia Frank, Peizheng Zhang, Jean-Pierre Thomas Svantner, Cristina Venturini, Cosmas Quirin Lorenz Heiss, Daniel Perales Rios, Viacheslav Bochkarev, Jan Jakub Frybes, Paul Véronique Guillaume Devianne Past EPFL PhD Students Clemente Angioni, Petri Nikkola, Alberto Bottino, Andrei Martynov, Emiliano Fable, Costanza Zucca, Federico Felici, Dávid Wágner, Doohyun Kim, Anna Teplukhina, Mengdi Kong, Francesco Carpanese, Simon Van Mulders, Stefano Marchioni, F

Aude Billard

Expertise RoboticsMachine LearningArtificial IntelligenceHuman-Robot InteractionMechatronicsDynamical Systems ControlComputational Neuroscience Aude Billard is full professor and head of the LASA laboratory at the School of Engineering at the Swiss Institute of Technology Lausanne (EPFL), and the Director of the Swiss Innovation Booster on Robotics. Dr. Billard acts as the President of the IEEE Robotics and Automation Society (RAS), after serving in several roles in the administrative and executive committe

Christophe Salzmann

Expertise Real-time Internet ServicesReal-time controlQuality of Service and Bandwidth adaptationLabVIEW Education PhD | Remote experimentation, Network 2005 – 2005 EPFL Directed by Denis Gillet MS. Degree | Computer Science 1999 – 1999 University of Florida Directed by Prof. H. Latchman Teaching & PhD Past EPFL PhD Students as codirector Damien Perritaz, Evgeny Bogdanov, Wissam Halimi Courses Control systems + TP ME

Stefano Coda

Teaching & PhD PhD Students Vincent Masson, Luigi Persico, Ewout Koen L. Devlaminck, Martino Bonisolli, Alessandro Balestri, Mackenzie Peter-Fulford Van Rossem, James Winston Irawati Tumbokon, Salomon Guinchard, Inès Vergara, Michele Bottino Past EPFL PhD Students Alessandro Marinoni, Silvano Gnesin, Cornelis Adrianus de Meijere, Josef Kamleitner, Zhouji Huang, Himank Anand, Pedro Andres Molina Cabrera, Dahye Choi, Federico Pesamosca, Aylwin Iantchenko, Jean Arthur Cazabonne

Related units (32)

IGM - Administration

Automatic Control Laboratory 3

Learning algorithms and systems Laboratory

Related startups (1)

Online Control

Active in control engineering, optimization and automation. Online Control specializes in innovative control engineering solutions for optimizing and automating processes in various industries.

Related concepts (14)

Bellman equation

A Bellman equation, named after Richard E. Bellman, is a necessary condition for optimality associated with the mathematical optimization method known as dynamic programming. It writes the "value" of a decision problem at a certain point in time in terms of the payoff from some initial choices and the "value" of the remaining decision problem that results from those initial choices. This breaks a dynamic optimization problem into a sequence of simpler subproblems, as Bellman's “principle of optimality" prescribes.

Costate equation

The costate equation is related to the state equation used in optimal control. It is also referred to as auxiliary, adjoint, influence, or multiplier equation. It is stated as a vector of first order differential equations where the right-hand side is the vector of partial derivatives of the negative of the Hamiltonian with respect to the state variables. The costate variables can be interpreted as Lagrange multipliers associated with the state equations.

Lagrange multiplier

In mathematical optimization, the method of Lagrange multipliers is a strategy for finding the local maxima and minima of a function subject to equation constraints (i.e., subject to the condition that one or more equations have to be satisfied exactly by the chosen values of the variables). It is named after the mathematician Joseph-Louis Lagrange. The basic idea is to convert a constrained problem into a form such that the derivative test of an unconstrained problem can still be applied.

Related MOOCs (3)

Launching New Ventures

Sharpen your “entrepreneurial mindset”. Launching New Ventures, a course about Entrepreneurship & Strategy for Technology-Driven Startups, is designed for professionals, entrepreneurs, and students who want to learn about how to successfully launch a new business. Through short, animated lectures, inspiring interviews with successful entrepreneurs from around the world, quizzes and suggested readings, students will gain a broad overview of entrepreneurship strategy with insights they can apply to their ven

Intro to Traffic Flow Modeling and Intelligent Transport Systems

Travelers in large cities experience significant congestion during their everyday trips. Expanding roads and infrastructure is not a long-lasting remedy to urban congestion. This course will focus on understanding traffic congestion and will explore ways to improve mobility through advanced traffic management schemes. As we all experience, congestion is a highly complex process without a single explanation. An interesting question is: “Can we describe these complex interactions with simple and elegant ways?

Optimization: principles and algorithms - Network and discrete optimization

Introduction to the mathematical concept of networks, and to two important optimization problems on networks: the transshipment problem and the shortest path problem. Short introduction to the modeling power of discrete optimization, with reference to classical problems. Introduction to the branch and bound algorithm, and the concept of cuts.

Related notebooks (4)

Investigating the Effect of Phase on Sound Perception

Hearing the phase of a sound[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will investigate the effect of phase on the perceptual quality of a sound. It is often said that the human ear is commercial-grade audio equipment takes place in the magnitude domain only. In [1]: %matplotlib inline import matplotlib import matplotlib.pyplot as plt import numpy as np import IPython from scipy.io import wavfile In [2]: plt.rcParams["figure.fig

Illustrating Band Structures in Solids: Free Electrons and Atomic Orbitals

In [1]: import numpy as np from numpy import linalg as LA import matplotlib.pyplot as plt

from future import print_function

from ipywidgets import interact, interactive, fixed, interact_manual import ipywidgets as widgets %matplotlib widget The emergence of band structures[1]¶ If you have questions about this notebook, e-mail Oleg Malanyuk (oleg.malanyuk@epfl.ch) This jupyter notebook is intended to provide a illustration of the band structures in solides, starting from the points of v

Voice Transformation Techniques Using Digital Signal Processing

A Gallery of Voice Transformers[1]¶

                                      [2]Paolo Prandoni, [3]LCAV, EPFL

In this notebook we will explore various ways to implement a system that changes the voice of a speaker. Typical applications for these techniques, strictly sorted by plausibility, include international spy missions and prank telephone calls, and devices such as the one displayed here can be easily bought on the web... or in a novelty shop. No description has been provided for t

Introduction to Reciprocal Lattices with Periodic Boundary Conditions.

Real vs. Reciprocal Space in 2D[1]¶ Introduction[2]¶ In this short notebook, we will introduce the lattice with periodic(Born- von Karman) boundary condition. Following the boundary condition, there is a transformation from real lattice to the reciprocal lattice. In the code below, we define a1 and a2 through cartesian vectors. Hence, the reciprocal vectors will be the original rotated by 90 degrees multiplied by 2pi and divided by the area of the unit cell (|a1xa2|) In [1]: i