Networked Control Systems: Laplacian Operators and Microgrids

About
Privacy
Disclaimer

Graph Chatbot

Related lectures (29)

Page 2 of 3

Filters Fundamentals: Chebyshev Approximation

Explores the fundamentals of Chebyshev approximation in filters, covering polynomials, pole locations, order determination, and design procedures.

Graph Theory Fundamentals

Explores fundamental graph theory concepts, Erdős' results, Chromatic Lemma, and Union Bound theorem in graph theory.

Fixed Points in Graph Theory

Focuses on fixed points in graph theory and their implications in algorithms and analysis.

Graph Theory Fundamentals

Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.

Consensus Algorithms: Weight Assignment and Applications

Explores the design of graph weights for consensus and applications in sensor networks.

Networked Control Systems: Laplacian Flow and Heat Equation

Explores Laplacian flow, heat equation analogies, and microgrid networked controllers.

Filters Fundamentals: Chebyshev Polynomials and Filter Design

Covers Chebyshev polynomials, all-pole filter design, RLC filters, and active-RC and OTA-C filter implementations.

Shortest Path Algorithms: BFS and Dijkstra

Explores Breadth-First Search and Dijkstra's algorithm for finding shortest paths in graphs.

Networked Control Systems: Microgrid Controllers and Cybersecurity

Covers microgrid controllers, cybersecurity, consensus-based control, and cybersecurity vulnerabilities in networked control systems.

Networked Control Systems: Opportunities

Explores coordination in networked control systems, graph theory, and consensus algorithms.