Skip to main contentEngineering Courses, Mentoring & Jobs | EveryEng
Behavioural Theory of Systems with a View Toward Data Driven Control banner
Preview this course

Behavioural Theory of Systems with a View Toward Data Driven Control

Behavioural Theory of Systems with a View Toward Data Driven Control banner
Preview this course
Self-paced Advanced

Behavioural Theory of Systems with a View Toward Data Driven Control

3(115)
128 views
FREE
784 min
Anytime
English
128 views
Engineering Academy
Engineering AcademyLearn Without Limits: Free Engineering Courses
  • Lifetime access
  • Certificate of completion
  • Anytime Learning
  • Learn from Industry Expert

Why enroll

This course helps you learn how to design control systems directly from data, without building complex mathematical models. It gives a clear and practical understanding of modern, data-driven control methods used in real-world systems. The concepts are simple, powerful, and highly useful for both industry and research.

Is this course for you?

You should take this if

  • You work in Automotive
  • You're a Electrical Engineering professional
  • You have 3+ years of hands-on experience in this field
  • You want to build skills in Engineering & Design, Project Management

You should skip if

  • You're new to this field with no prior experience
  • You need a different specialisation outside Electrical Engineering
  • You need live interaction with an instructor

Course details

This course introduces a modern way of designing control systems using data instead of mathematical models. Traditionally, control design requires building an accurate model of the system using equations derived from physics or experiments. In many real-world systems, this is difficult, time-consuming, or even impossible. Data-driven control overcomes this challenge by directly using measured input–output data.The course begins with the behavioural approach to systems theory, where the focus is on how a system behaves rather than on its internal equations. Students will learn how a system can be described through the set of all possible trajectories it can generate, and why this viewpoint is powerful for data-based methods.Next, the course explains how behavioural theory naturally leads to data-driven control techniques. Students will see how controllers can be designed and system properties can be analyzed using only data collected from experiments, without identifying an explicit model.A key concept covered in detail is persistency of excitation, which explains what kind of data is needed to reliably represent system behavior. The course builds intuition on why rich and informative data is essential for successful control design.By the end of the course, students will understand the fundamental ideas, tools, and limitations of data-driven control, and will be able to appreciate how these methods are applied to modern engineering systems where modeling is difficult or uncertain.

Source: NPTEL IIT Bombay [Youtube Channel]

Course suitable for

Key topics covered

  • Course Introduction

    • Behavioural Theory of Systems with a View Toward Data Driven Control

  • Introduction

  • Dynamical systems in the behavioural setting

  • Ordinary differential and difference equations : Kernel

  • Equivalent kernel representations

  • Unimodular transformations, equivalent behaviours – sufficient condition

  • Polynomial matrices: Aryabhatta–Bezout identity, upper triangular form

  • Example – solution of system of differential equations using back substitution

  • Solving scalar ordinary differential equations, equivalent behaviours

  • Solving multivariable system of differential equations

  • Equivalent behaviours: necessary condition for autonomous systems proof

  • Equivalent Behaviours: non-autonomous systems proof, input-output partitioning

  • Annihilator submodule and associated behaviour

  • Elimination Theory introduction, Fundamental principle of algebraic analysis

  • Proof of Fundamental principle of algebraic analysis

  • Proof revisited: Fundamental principle of Algebraic analysis

  • Elimination Theory proof with example

  • Elimination examples

  • Controllability definition in the behavioural framework

  • Equivalent conditions for controllability proof

  • More equivalent conditions for controllability

  • Moving from controllability to observability

  • Observability Continued

  • Behavioural Pole Placement

  • Identification Basics

Course content

The course is readily available, allowing learners to start and complete it at their own pace.

25 lectures13 hr 4 min
  1. Course Introduction - Behavioural Theory of Systems with a View Toward Data Driven Control
    3 min
  2. Introduction
    31 min
  3. Dynamical systems in the behavioural setting
    33 min
  4. Ordinary differential and difference equations : Kernel
    33 min
  5. Equivalent kernel representations
    32 min
  6. Unimodular transformations, equivalent behaviours - sufficient condition
    31 min
  7. Polynomial matrices: Aryabhatta-Bezout identity, upper triangular form
    34 min
  8. Example- solution of system of differential equations using back substitution
    31 min
  9. Solving scalar ordinary differential equations, equivalent behaviours
    33 min
  10. Solving multivariable system of differential equations
    31 min
  11. Equivalent behaviours: necessary condition for autonomous systems proof
    36 min
  12. Equivalent Behaviours: non-autonomous systems proof, input-output partitioning
    34 min
  13. Annihilator submodule and associated behaviour
    30 min
  14. Elimination Theory introduction, Fundamental principle of algebraic analysis
    33 min
  15. Proof of Fundamental principle of algebraic analysis
    33 min
  16. Proof revisited: Fundamental principle of Algebraic analysis
    30 min
  17. Elimination Theory proof with example
    35 min
  18. Elimination examples
    31 min
  19. Controllability definition in the behavioural framework
    36 min
  20. Equivalent conditions for controllability proof
    33 min
  21. More equivalent conditions for controllability
    32 min
  22. Moving from controllability to observability
    32 min
  23. Observability Continued
    33 min
  24. Behavioural Pole Placement
    29 min
  25. Identification Basics
    35 min

Opportunities that await you!

Skills & tools you'll gain

Engineering & DesignProject ManagementResearch & Developmnet

Career opportunities

Why people choose EveryEng

Industry-aligned courses, expert training, hands-on learning, recognized certifications, and job opportunities-all in a flexible and supportive environment.

What learners say about this course

Boora Mahesh
Boora Mahesh civil engineer
Mar 14, 2026

drtudfjygfygughihj

Hemanth TK
Hemanth TK
Feb 27, 2026

Fhjfkgc

Bhavani S
Bhavani S Student
Feb 22, 2026

Nice

Engineering Academy
Engineering Academy Engineer
Feb 7, 2026

Nice Explanation

FREE

Access anytime

Questions and Answers

A: Get this wrong and you end up training the controller on its own mistakes, which can cook actuators or fail SAT. Freezing adaptation while you apply a persistently exciting input lets you compare measured behavior to the trained model without contaminating it, and checking residuals against training bounds tells you whether the learned dynamics still apply to the as-built system.

A: Pick the wrong mapping and the controller either reacts too slowly or goes unstable, blowing a durability test window. Using the exact discretization z = e^{sT} preserves the identified dynamics at the chosen sample time, which keeps the learned predictor aligned with the real plant.

A: Miss this and you get a gradual performance loss that shows up as a 40,000 km warranty claim rather than a clean fault. Output saturation clips magnitude, but it doesn't stop a biased estimator from commanding the wrong steady action within limits, so the physical system still drifts into damage.

A: Overestimate the load and you kill a viable design, underestimate it and you miss real-time deadlines during DV. A quick cubic estimate shows the math cost is tiny relative to the ECU capacity, so timing risk sits elsewhere like memory access or solver overhead.