Multiple Input, Multiple Output II: Model Predictive Control By Peter Woolf University of Michigan Michigan Chemical Process Dynamics.

Slides:



Advertisements
Similar presentations
ARCHITECTURES FOR ARTIFICIAL INTELLIGENCE SYSTEMS
Advertisements

Control Architectures: Feed Forward, Feedback, Ratio, and Cascade
Slides from: Doug Gray, David Poole
Adopt Algorithm for Distributed Constraint Optimization
Modeling Basics: 4. Numerical ODE Solving In Excel 5. Solving ODEs in Mathematica By Peter Woolf University of Michigan Michigan Chemical Process Dynamics.
Adversarial Search We have experience in search where we assume that we are the only intelligent being and we have explicit control over the “world”. Lets.
©Silberschatz, Korth and Sudarshan12.1Database System Concepts Chapter 12: Indexing and Hashing Basic Concepts Ordered Indices B+-Tree Index Files B-Tree.
Applied Neuro-Dynamic Programming in the Game of Chess James Gideon.
Application of Artificial intelligence to Chess Playing Capstone Design Project 2004 Jason Cook Bitboards  Bitboards are 64 bit unsigned integers, with.
Artificial Intelligence in Game Design Heuristics and Other Ideas in Board Games.
Machine Learning CPSC 315 – Programming Studio Spring 2009 Project 2, Lecture 5.
Web Caching Schemes1 A Survey of Web Caching Schemes for the Internet Jia Wang.
Telescoping Languages: A Compiler Strategy for Implementation of High-Level Domain-Specific Programming Systems Ken Kennedy Rice University.
Bayesian Networks II: Dynamic Networks and Markov Chains By Peter Woolf University of Michigan Michigan Chemical Process Dynamics and.
Comparing Distributions I: DIMAC and Fishers Exact By Peter Woolf University of Michigan Michigan Chemical Process Dynamics and Controls.
Comparing Distributions II: Bayes Rule and Acceptance Sampling By Peter Woolf University of Michigan Michigan Chemical Process Dynamics.
Dynamical Systems Analysis III: Phase Portraits By Peter Woolf University of Michigan Michigan Chemical Process Dynamics and Controls.
Comparing Distributions III: Chi squared test, ANOVA By Peter Woolf University of Michigan Michigan Chemical Process Dynamics and Controls.
Neural Networks. R & G Chapter Feed-Forward Neural Networks otherwise known as The Multi-layer Perceptron or The Back-Propagation Neural Network.
NJIT More GRASP Patterns Chapter 22 Applying UML and Patterns Craig Larman Prepared By: Krishnendu Banerjee.
Dynamical Systems Analysis I: Fixed Points & Linearization By Peter Woolf University of Michigan Michigan Chemical Process Dynamics.
Drake DRAKE UNIVERSITY Fin 288 Valuing Options Using Binomial Trees.
Dynamical Systems Analysis II: Evaluating Stability, Eigenvalues By Peter Woolf University of Michigan Michigan Chemical Process Dynamics.
Tirgul 5 Comparators AVL trees. Comparators You already know interface Comparable which is used to compare objects. By implementing the interface, one.
Dynamical Systems Analysis IV: Root Locus Plots & Routh Stability
Tirgul 5 This tirgul is about AVL trees. You will implement this in prog-ex2, so pay attention... BTW - prog-ex2 is on the web. Start working on it!
Multiple Input, Multiple Output I: Numerical Decoupling By Peter Woolf University of Michigan Michigan Chemical Process Dynamics and.
Chemical Process Controls: PID control, part II Tuning
Reduced Instruction Set Computers (RISC) Computer Organization and Architecture.
Training Return on Investment (ROI) Pitfalls & Problems
CSC 412: AI Adversarial Search
Operations Research Models
PSU CS 370 – Introduction to Artificial Intelligence Game MinMax Alpha-Beta.
Deep Learning and Neural Nets Spring 2015
Roman Keeney AGEC  In many situations, economic equations are not linear  We are usually relying on the fact that a linear equation.
Modeling.
Stochastic Algorithms Some of the fastest known algorithms for certain tasks rely on chance Stochastic/Randomized Algorithms Two common variations – Monte.
Artificial Intelligence in Game Design Lecture 22: Heuristics and Other Ideas in Board Games.
Using Neural Networks in Database Mining Tino Jimenez CS157B MW 9-10:15 February 19, 2009.
Example 15.1 Daily Scheduling of Postal Employees Workforce Scheduling Models.
Prepared by : Walaa Maqdasawi Razan Jararah Supervised by: Dr. Aladdin Masri.
Game-playing AIs Part 1 CIS 391 Fall CSE Intro to AI 2 Games: Outline of Unit Part I (this set of slides)  Motivation  Game Trees  Evaluation.
Artificial Intelligence in Game Design N-Grams and Decision Tree Learning.
 Review the principles of cost-volume-profit relationships  Discuss Excel what-if analysis tools 2.
1 CSC 9010 Spring Paula Matuszek CSC 9010 ANN Lab Paula Matuszek Spring, 2011.
Tony Jebara, Columbia University Advanced Machine Learning & Perception Instructor: Tony Jebara.
Structure and Synthesis of Robot Motion Topics in Control Subramanian Ramamoorthy School of Informatics 19 February, 2009.
Simulation is the process of studying the behavior of a real system by using a model that replicates the system under different scenarios. A simulation.
Chess By Kyle Fischer. What is chess? Chess is a game that you try to get the other person’s king in a checkmate.
Types of Algorithms. 2 Algorithm classification Algorithms that use a similar problem-solving approach can be grouped together We’ll talk about a classification.
Neural Networks Demystified by Louise Francis Francis Analytics and Actuarial Data Mining, Inc.
CHESS 2: Castling and Forking…and a Stalemate A Levoy Power Point.
1 BA 555 Practical Business Analysis Linear Programming (LP) Sensitivity Analysis Simulation Agenda.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
§5 Backtracking Algorithms A sure-fire way to find the answer to a problem is to make a list of all candidate answers, examine each, and following the.
Adversarial Search Chapter 6 Section 1 – 4. Games vs. search problems "Unpredictable" opponent  specifying a move for every possible opponent reply Time.
IB Business & Management
1 Introduction Optimization: Produce best quality of life with the available resources Engineering design optimization: Find the best system that satisfies.
IJCNN, July 27, 2004 Extending SpikeProp Benjamin Schrauwen Jan Van Campenhout Ghent University Belgium.
Nonlinear balanced model residualization via neural networks Juergen Hahn.
Branch Prediction Perspectives Using Machine Learning Veerle Desmet Ghent University.
Wireless sensor and actor networks: research challenges Ian. F. Akyildiz, Ismail H. Kasimoglu
A Presentation on Adaptive Neuro-Fuzzy Inference System using Particle Swarm Optimization and it’s Application By Sumanta Kundu (En.R.No.
The Game Development Process: Artificial Intelligence.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Neural Network Architecture Session 2
Presentation at NI Day April 2010 Lillestrøm, Norway
Supervised Time Series Pattern Discovery through Local Importance
Optimizing Minmax Alpha-Beta Pruning Real Time Decisions
CS51A David Kauchak Spring 2019
Presentation transcript:

Multiple Input, Multiple Output II: Model Predictive Control By Peter Woolf University of Michigan Michigan Chemical Process Dynamics and Controls Open Textbook version 1.0 Creative commons

P&IDModel Goal: Control both LC1 and TC1 using Q and v1. v1 strongly influences LC1, but also influences TC1 Q strongly influences TC1, but depends on LC1 (volume) Possible solutions: (1) Decouple system and connect LC1 to v1 and TC1 to Q --> 2 PID controllers Problem: controllers may fight as their objectives are not compatible. (2) Develop a more sophisticated MIMO controller

MPC Philosophy: Past: Use past data to create an accurate model Future: Use the model to predict the impact of future control events Present: do the control action that is expected to yield the best long term outcome Image from

Chess Example for MPC White: operator Black: system Operator’s move Images and example from

Path 1: System takes operator’s queen w/ rook Path 2: System takes operator’s queen w/ bishop

Images and example from Path 1: System takes operator’s queen w/ rook Operator moves knight System moves rook to protect pawn Operator moves knight and checkmate

Images and example from Path 2:System takes operator’s queen w/ bishop Operator moves bishop System moves bishop to attack operator Operator moves bishop and checkmate

Images and example from Operator wins in both cases by sacrificing queen Path 2 Path 1

Images and example from Tree view: each column represents a move Observations: Sometimes a short term sacrifice yields a long term benefit (sacrifice queen to win the game) Avoid “win the battle, loose the war”

A more complex example There are many paths, but some are shorter than others.

A controls example Goal: set yield to 2.5 g/L & minimize energy use V1(open), v2(closed), v3(closed), v4(open) Yield=1.5 g, energy=250 W Path 1: Increase yield and decrease energy V1(open), v2(closed), v3(open), v4(open) Yield=1.5 g, energy=300 W Path 2: maintain yield and increase energy V1(open), v2(closed), v3(open), v4(closed) Yield=2.5 g, energy=50 W Low energy, high productivity steady state V1(open), v2(open), v3(open), v4(open) Yield=2.3 g, energy=250 W V1(open), v2(open), v3(closed), v4(open) Yield=2.5 g, energy=230 W higher energy, lower productivity steady state

Simple controllers will optimize based on “the next move” alone, thus will not go through less desirable states to get a larger return. Can we learn from chess how to control our system better? Need: (1)Rules and constraints of the game (2)Objective (3)Ability to “look ahead” to see the next best action Model Predictive Control

MPC procedure

How do we search possible future actions? Search by optimization of some objective function Min[ Sum[ (predicted-desired)^2] ] Can add constraints such as: (1)Heaters and valves with finite, positive range (2)Actuators with finite states (open/closed or high/medium/low) (3)Cost, energy, or expense limits Much of this can be done with Excel’s Solver function.. see class20.example.xls

Notes for Excel Solver and Integer Optimization Key: Set up problem such that binary or integer values have a continuous interpretation =IF($A$1=1,10,0) No -- solver will try values of 1.1 in an intermediate calculation and not find an appropriate value =IF($A$1>=1,10,0) =$A$1*10 Yes -- solver will try values of 1.1 to establish a gradient, and then constrain to binary or integer at the end

Alternate Models for MPC Neural Networks: Flexible empirical model to fit time varying data to a model Advantages: Model learned directly from data Disadvantages: Only accurate in the domain in which the network was trained. Figure from

Downsides of MPC As implemented, the controller will anticipate set point changes, which may not be desirable A grossly inaccurate model will yield poor control decisions (although the method is surprisingly robust) Predictions can be computationally demanding so requires fast computers and fast code to do in real time

Advantages of MPC Incorporates in knowledge of the system in making decisions Realistic implementation of known constraints Anticipates longer term consequences of controller actions Simplifies or in some cases eliminates controller design, instead replacing it with system modeling

Take Home Messages In some cases, simpler control architectures lead to short term gains and long term losses MPC is an increasingly popular and powerful method for control of complex chemical processes MPC models can be ODEs, neural networks, or other kinds of models