Station Keeping with Range Only Sensing {Adaptive Control} A. S. Morse Yale University Gif – sur - Yvette May 24, 2012 TexPoint fonts used in EMF. Read.

Slides:



Advertisements
Similar presentations
SWITCHING ADAPTIVE CONTROL Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at Urbana-Champaign.
Advertisements

5.1 Real Vector Spaces.
1 of 16 NORM - CONTROLLABILITY, or How a Nonlinear System Responds to Large Inputs Daniel Liberzon Univ. of Illinois at Urbana-Champaign, U.S.A. NOLCOS.
Properties of State Variables
T HE POWER OF C ONVEX R ELAXATION : N EAR - OPTIMAL MATRIX COMPLETION E MMANUEL J. C ANDES AND T ERENCE T AO M ARCH, 2009 Presenter: Shujie Hou February,
Venkataramanan Balakrishnan Purdue University Applications of Convex Optimization in Systems and Control.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Newton’s Method Application to LMS Recursive Least Squares Exponentially-Weighted.
Lecture #13 Stability under slow switching & state-dependent switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched.
1 In this lecture, a model based observer and a controller will be designed to a single-link robot.
Chapter 5 Orthogonality
OPTIMAL CONTROL SYSTEMS
Approximation Algorithms
Some Fundamentals of Stability Theory
Development of Empirical Models From Process Data
EE 685 presentation Optimization Flow Control, I: Basic Algorithm and Convergence By Steven Low and David Lapsley Asynchronous Distributed Algorithm Proof.
Overall Objectives of Model Predictive Control
Kalman Filtering Pieter Abbeel UC Berkeley EECS Many slides adapted from Thrun, Burgard and Fox, Probabilistic Robotics TexPoint fonts used in EMF. Read.
F.B. Yeh & H.N. Huang, Dept. of Mathematics, Tunghai Univ Nov.8 Fang-Bo Yeh and Huang-Nan Huang Department of Mathematic Tunghai University The 2.
Definition and Properties of the Cost Function
Virtual Shells for Avoiding Collisions A. S. Morse Yale University Gif – sur - Yvette May 24, 2012 TexPoint fonts used in EMF. Read the TexPoint manual.
Introduction to Flocking {Stochastic Matrices} A. S. Morse Yale University Gif – sur - Yvette May 21, 2012 TexPoint fonts used in EMF. Read the TexPoint.
ME451 Kinematics and Dynamics of Machine Systems Review of Matrix Algebra – 2.2 Review of Elements of Calculus – 2.5 Vel. and Acc. of a point fixed in.
ME451 Kinematics and Dynamics of Machine Systems Review of Matrix Algebra – 2.2 September 13, 2011 Dan Negrut University of Wisconsin-Madison © Dan Negrut,
Chapter 2 The Fundamentals: Algorithms, the Integers, and Matrices
C&O 355 Mathematical Programming Fall 2010 Lecture 17 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
C&O 355 Lecture 2 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
A Shaft Sensorless Control for PMSM Using Direct Neural Network Adaptive Observer Authors: Guo Qingding Luo Ruifu Wang Limei IEEE IECON 22 nd International.
Target Tracking with Binary Proximity Sensors: Fundamental Limits, Minimal Descriptions, and Algorithms N. Shrivastava, R. Mudumbai, U. Madhow, and S.
THE STABILITY BOX IN INTERVAL DATA FOR MINIMIZING THE SUM OF WEIGHTED COMPLETION TIMES Yuri N. Sotskov Natalja G. Egorova United Institute of Informatics.
Cs: compressed sensing
TUTORIAL on LOGIC-BASED CONTROL Part I: SWITCHED CONTROL SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: Deterministic vs. Random Maximum A Posteriori Maximum Likelihood Minimum.
ME451 Kinematics and Dynamics of Machine Systems Review of Linear Algebra 2.1 through 2.4 Tu, Sept. 07 © Dan Negrut, 2009 ME451, UW-Madison TexPoint fonts.
Lecture #16 Nonlinear Supervisory Control João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Progress in identification of damping: Energy-based method with incomplete and noisy data Marco Prandina University of Liverpool.
Lecture #11 Stability of switched system: Arbitrary switching João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
 6.2 Pivoting Strategies 1/17 Chapter 6 Direct Methods for Solving Linear Systems -- Pivoting Strategies Example: Solve the linear system using 4-digit.
Constrained adaptive sensing Mark A. Davenport Georgia Institute of Technology School of Electrical and Computer Engineering TexPoint fonts used in EMF.
Reinforcement Learning Control with Robust Stability Chuck Anderson, Matt Kretchmar, Department of Computer Science, Peter Young, Department of Electrical.
A. S. Morse Yale University University of Minnesota June 2, 2014 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A.
Chapter 20 1 Overall Objectives of Model Predictive Control 1.Prevent violations of input and output constraints. 2.Drive some output variables to their.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Lecture #14 Computational methods to construct multiple Lyapunov functions & Applications João P. Hespanha University of California at Santa Barbara Hybrid.
CPSC 536N Sparse Approximations Winter 2013 Lecture 1 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAA.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
(COEN507) LECTURE III SLIDES By M. Abdullahi
Lecture #7 Stability and convergence of ODEs João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems NO CLASSES.
C&O 355 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A.
Learning Theory Reza Shadmehr Distribution of the ML estimates of model parameters Signal dependent noise models.
Massive Support Vector Regression (via Row and Column Chunking) David R. Musicant and O.L. Mangasarian NIPS 99 Workshop on Learning With Support Vectors.
UCLA March 2, 2006 IPAM Workshop on Swarming by Nature and by Design thanks to the organizers: A. Bertozzi D. Grunbaum P. S. Krishnaprasad I. Schwartz.
Approximation Algorithms based on linear programming.
1 Objective To provide background material in support of topics in Digital Image Processing that are based on matrices and/or vectors. Review Matrices.
11-1 Lyapunov Based Redesign Motivation But the real system is is unknown but not necessarily small. We assume it has a known bound. Consider.
Lecture 3: System Representation
Theory of Computational Complexity M1 Takao Inoshita Iwama & Ito Lab Graduate School of Informatics, Kyoto University.
Lecture #15 Supervisory Control João P. Hespanha University of California at Santa Barbara Hybrid Control and Switched Systems.
Primbs, MS&E345 1 Measure Theory in a Lecture. Primbs, MS&E345 2 Perspective  -Algebras Measurable Functions Measure and Integration Radon-Nikodym Theorem.
Advanced Control Systems (ACS)
On the Size of Pairing-based Non-interactive Arguments
St. Petersberg July 5, 2001.
Mathematical Descriptions of Systems
Overall Objectives of Model Predictive Control
Autonomous Cyber-Physical Systems: Dynamical Systems
§1-3 Solution of a Dynamical Equation
Stability Analysis of Linear Systems
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
Undirected Formations
On Topological Entropy and Stability of Switched Linear Systems
Continuous Random Variables: Basics
Presentation transcript:

Station Keeping with Range Only Sensing {Adaptive Control} A. S. Morse Yale University Gif – sur - Yvette May 24, 2012 TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A AA A A AAAA A Supelec EECI Graduate School in Control

1. A Simple Example: SWITCHING BETWEEN TWO MODELS 2. An Application: STATION KEEPING Roadmap

In the early days {say before the 1980s} the main type of switching controls studied in control theory were relay {eg. bang bang} controls. Although some relay controls used hysteresis {which is a simple form of memory logic}, for the most part “logic-based” control algorithms had not been studied. In the early 1980s at a meeting on Belle Isle in France it was conjectured that it is impossible to “stabilize” the uncertain linear system with a smooth controller without knowledge of the sign of the “high-frequency gain” b Shortly thereafter Roger Nussbaum {a math analyst at Rutgers with no background in control} proved the conjecture false by actually constructing a smooth nonlinear {but not rational} stabilizing control. This work motivated a number of people, notably Bengt Martensson at Lund, to rethink adaptive control and in particular to ask just how much information is needed about a linear system in order to control it. A Little Background

Bengt jolted conventional wisdom in adaptive control by constructively demonstrating that all one needs to know about a SISO linear system in order to “stabilize” it, is an upper bound on its dimension! Martensson accomplished this by using a logic-based switching control which keeps stepping through a countable family of linear controllers until the integral inequality is satisfied for some integer i where t i is the ith time a controller switch takes place. If there is a next switch after t i, it occurs at the smallest value of t ¸ t i at which the above inequality fails to hold. Meanwhile, in the late 1980s, during a short course at DLVFR {German Test and Research Institute for Aviation and Space Flight} in Oberpfaffenhofen Graham Goodwin lectured about a new and clever type of switching control. Bengt’s work motivated a great deal of research on switching control.

Pick a positive constant h: hysteresis switching..... Hysteresis Switching Given a finite set of scalar valued monotone non-decreasing signals ¹ 1, ¹ 2,....., ¹ m with the property that at least one signal in the set has a finite limit, develop a real-time algorithm for finding a member of the set with a finite limit. Problem: There is a finite time T at which switching stops and is has a finite limit as t ! 1. initialize ¾ ¾ = ¾ * ny ¹ ¾ * + h < ¹ ¾

Lets look at a very simple example But before we start we are going to need the Bellman-Gronwall Lemma

Lemma: If some numbers t b t a, some constant c > 0 and some nonnegative, piecewise-continuous function ® : [t a, t b ] ! IR, w: [t a, t b ] ! IR is a continuous function satisfying then Bellman-Gronwall Lemma

Now on to the very simple example.....

noise with finite L 1 norm un-modeled dynamic operator with small L 2 norm nominal model Model 1: p = 1 b = 1 Model 2: p = 2 b = -1 Hey, I thought you said simple!

multi-estimator: output estimation errors: hysteresis switching logic monitor: initialize y n ny dwell time switching logic multi-controller: Pick a positive number ¿ D If p = 1 and ± and n are zero then With ¾ frozen, have detectable through e 1 noise with finite L 1 norm un-modeled dynamic operator with small L 2 norm nominal model verify this!

multi-estimator: output estimation errors: injected system ± - - Assume p = 1 Pick ¿ D to stabilize this system multi-controller:

injected system ± - - output estimation errors: For any T>0 there is a piecewise constant signal à : [0, 1 ) ! {0, 1} such that where h S = set of all dwell time switching signals with dwell time ¿ D verify!

injected system ± - - For any T>0 there is a piecewise constant signal à : [0, 1 ) ! {0, 1} such that where For 0 · t · T OK Minimize g w/r ¿ D Verify that if a = b + c then a 2 · 2b 2 + 2c 2 via the Bellman –Gronwall Lemma:

monitor: initialize y n ny For any T>0 there is a piecewise constant signal à : [0, 1 ) ! {0, 1} such that where Let t * be the last time · T at which ¾ (t * ) = 2. dwell time switching logic

¿D¿D ¿D¿D ¿D¿D ¿D¿D ¿D¿D ¾ = 2 ¾ = 1 T T t*t* t*t* t*t* T tata à = 0 à = 1 à = 0 Let t * be the last time · T at which ¾ (t * ) = 2.

For any T>0 there is a piecewise constant signal à : [0, 1 ) ! {0, 1} such that where Let t * be the last time · T at which ¾ (t * ) = 2. OK I p is the union of the time intervals on which ¾ = p

¿ D = 0.1 ¿ D = 0.5 Response to Sinusoidal Noise

Remarks Described a problem specific hybrid system and outlined a simple way to analyze it. The preceding illustrates that in some situations, the block diagram which describes a system can be completely different than the block diagram needed to analyze the system.

A Simple Example: SWITCHING BETWEEN TWO MODELS An Application: STATION KEEPING

3 agents moving in formation at constant velocity V agent 0 Objective is for agent 0 is to join the formation at the position using only range sensing. FORMATION CONTROL

using range – only sensing

sensing error

alignment error Station keeping problem: Devise a strategy for moving agent 0 from x 0 to x * 1. which depends only on the r i (t) and d i 2. whose performance degrades gracefully with increasing sensing and alignment errors. Remarks: The data r 1 (0), r 2 (0), r 3 (0), d 1, d 2, d 3 does not uniquely determine x * (0) No open loop solution exists, even if x * (t) = constant!

Error Model alignment error sensing error verify!

G = constant Leaders not co-linear G = nonsingular If e = 0, ¹ = 0, and ² =0 then x 0 = x * control verify!

Points 1, 2, 3 are not co-linear sensor errors sensor & alignment errors

Points 1, 2, 3 are not co-linear error system u e switched adaptive control

error system u e u e switched adaptive control controllable observable verify!

SUPERVISOR u e switched adaptive control Multi-Controller Multi-Estimator u e Monitor Dwell Time Switching Logic

u e Multi-Controller Multi-Estimator Monitor Dwell Time Switching Logic 2 £ 2 matrices

u e Multi-Controller Monitor Dwell Time Switching Logic A - bf = stable 2 £ 2 matrices

u e Multi-Controller Monitor Dwell Time Switching Logic A + kc = stable 2 £ 2 matrices

u e Monitor Dwell Time Switching Logic A + kc = stable compact set of 2 £ 2 nonsingular matrices

u e Monitor Dwell Time Switching Logic Monitor W compact set of 2 £ 2 nonsingular matrices

u e Dwell Time Switching Logic W compact set of 2 £ 2 nonsingular matrices Pth output estimation error exponentially weighted 2 –norm: Dwell Time Switching Logic {quadratic in entries of P}

M(Q,P * ) < M(Q,G) Æ n y y y n n  =  D  =  D -  C Sample Q = W and minimize M(Q,P)  =  D -  C  = 0 P * is the value of P which minimizes M(Q,P) over G Initialize G Æ dwell time computation time G = P * Æ

ANALYTICAL PROPERTIES

u e Dwell Time Switching Logic W If no sensor or alignment errors, then e and the position error x 0 – x * tend to zero exponentially fast. 0 ANALYTICAL PROPERTIES

Simulations Straight Trajectory Curved Trajectory

UPENN GRASP LAB TESTS Straight Trajectory Curved Trajectory

While M(Q, P) is quadratic in the entries of P, P is typically non-convex because of the constraint that it elements must be nonsingular. Sample Q = W and minimize M(Q,P) ……. with respect to P 2 P non-convex optimization problem Each n £ n nonsingular matrix B can be written as B n £ n = U n £ n (I + L n £ n )S n £ n Reparameterize: This fact can be used to embed the preceding in a set of 8 convex semi-definite programming problems; see papers. strictly lower triangular from a finite set Convexity Issues symmetric positive definite

Remarks We’ve outlined a provably correct solution to the range-only station keeping problem and demonstrated its feasibility via simulation and experimentation. While the solution is limited to agent descriptions which are simple kinematics point models, use of the concept of a “virtual shell” enables one to apply the solution to more general dynamic models. Experience has shown that the trial and error design of the multi-estimator, multi-controller, and monitor gains can be extremely tedious, since at present there are no tools or performance guideline for carry out any of these design processes. This is a fundamental shortcoming of all existing adaptive control design methodologies. We’ve talked a little bit about the basics of parameter adaptive control and about dwell time switching.