Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Lecture

Zieger-Nichols Second Method: Balloon Altitude Control

In course

ME-321: Control systems + TP

Provides the students with basic notions and tools for the analysis and control of dynamic systems. Shows them how to design controllers and analyze the performance of controlled systems. ...

Description

This lecture covers the Zieger-Nichols Second Method for unstable systems, explaining the need for stabilizing the system with a proportional controller before tuning it. It also delves into an example of Balloon Altitude Control, discussing equations of motion and the challenges of dealing with an unstable system. The lecture further explores the concepts of gain, altitude reference, and PID controllers, providing insights into controller parameters and settings for both continuous-time and discrete-time domains.

Instructors (2)

Christophe Salzmann

Colin Neil Jones

Colin Jones is an Associate Professor in the Automatic Control Laboratory at the Ecole Polytechnique Federale de Lausanne (EPFL) in Switzerland. He was a Senior Researcher at the Automatic Control Lab at ETH Zurich until 2011 and obtained a PhD in 2005 from the University of Cambridge for his work on polyhedral computational methods for constrained control. Prior to that, he was at the University of British Columbia in Canada, where he took a BASc and MASc in Electrical Engineering and Mathematics. Colin has worked in a variety of industrial roles, ranging from commercial building control to the development of custom optimization tools focusing on retail human resource scheduling. His current research interests are in the theory and computation of predictive control and optimization, and their application to green energy generation, distribution and management.

Official source

Related concepts (9)

Frequency domain

In mathematics, physics, electronics, control systems engineering, and statistics, the frequency domain refers to the analysis of mathematical functions or signals with respect to frequency, rather than time. Put simply, a time-domain graph shows how a signal changes over time, whereas a frequency-domain graph shows how the signal is distributed within different frequency bands over a range of frequencies. A frequency-domain representation consists of both the magnitude and the phase of a set of sinusoids (or other basis waveforms) at the frequency components of the signal.

Time domain

Time domain refers to the analysis of mathematical functions, physical signals or time series of economic or environmental data, with respect to time. In the time domain, the signal or function's value is known for all real numbers, for the case of continuous time, or at various separate instants in the case of discrete time. An oscilloscope is a tool commonly used to visualize real-world signals in the time domain.

Discrete-time Fourier transform

In mathematics, the discrete-time Fourier transform (DTFT), also called the finite Fourier transform, is a form of Fourier analysis that is applicable to a sequence of values. The DTFT is often used to analyze samples of a continuous function. The term discrete-time refers to the fact that the transform operates on discrete data, often samples whose interval has units of time. From uniformly spaced samples it produces a function of frequency that is a periodic summation of the continuous Fourier transform of the original continuous function.

Discrete Fourier transform

In mathematics, the discrete Fourier transform (DFT) converts a finite sequence of equally-spaced samples of a function into a same-length sequence of equally-spaced samples of the discrete-time Fourier transform (DTFT), which is a complex-valued function of frequency. The interval at which the DTFT is sampled is the reciprocal of the duration of the input sequence. An inverse DFT (IDFT) is a Fourier series, using the DTFT samples as coefficients of complex sinusoids at the corresponding DTFT frequencies.

Discrete mathematics

Discrete mathematics is the study of mathematical structures that can be considered "discrete" (in a way analogous to discrete variables, having a bijection with the set of natural numbers) rather than "continuous" (analogously to continuous functions). Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous mathematics" such as real numbers, calculus or Euclidean geometry.

Related lectures (31)

Fourier Transform and Sampling

Covers the Fourier transform of sampled signals, reconstruction, and harmonic response.

Signals & Systems II: Vector Analogy and Discrete Signals

Explores the link between DTFT, Z-transforms, and Fourier transforms, vector analogy, and discrete signals.

Discrete Fourier series: Inherent periodicities and time shifts

Explores the Discrete Fourier Transform synthesis and analysis formulas, time shifts for finite-length signals, and the equivalence between DFS and DFT.

DFT definition: Fourier Basis and Basis Expansion

Covers the DFT definition, Fourier Basis, basis expansion, and signal representation.

Discrete Signals & Fourier Transform