University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 30: Lecture Quiz, Project Details,

Slides:



Advertisements
Similar presentations
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 5: State Deviations and Fundamentals.
Advertisements

Colorado Center for Astrodynamics Research The University of Colorado ASEN 5070 OD Accuracy Assessment OD Overlap Example Effects of eliminating parameters.
Use of Kalman filters in time and frequency analysis John Davis 1st May 2011.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 28: Orthogonal Transformations.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 24: Numeric Considerations and.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 20: Project Discussion and the.
University of Colorado Boulder ASEN 5070 Statistical Orbit determination I Fall 2012 Professor George H. Born Professor Jeffrey S. Parker Lecture 8: Stat.
Kalman’s Beautiful Filter (an introduction) George Kantor presented to Sensor Based Planning Lab Carnegie Mellon University December 8, 2000.
Final Exam Review. Format of Final 20 questions –similar to quiz questions, possibly w/ some subquestions) Will have to answer all questions. 80%-90%:
Ordinary least squares regression (OLS)
Course AE4-T40 Lecture 5: Control Apllication
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 7: Linearization and the State.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 41: Initial Orbit Determination.
Adaptive Signal Processing
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 37: SNC Example and Solution Characterization.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 38: Information Filter.
Principles of the Global Positioning System Lecture 13 Prof. Thomas Herring Room A;
Colorado Center for Astrodynamics Research The University of Colorado STATISTICAL ORBIT DETERMINATION Project Report Unscented kalman Filter Information.
University of Colorado Boulder ASEN 5070 Statistical Orbit Determination I Fall 2012 Professor Jeffrey S. Parker Professor George H. Born Lecture 25: Error.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Satellite Tracking Example of SNC and DMC ASEN.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 34: Probability Ellipsoids.
LECTURE 19 THURSDAY, 14 April STA 291 Spring
University of Colorado Boulder ASEN 5070 Statistical Orbit determination I Fall 2012 Professor George H. Born Professor Jeffrey S. Parker Lecture 6: Launches.
Kalman Filter (Thu) Joon Shik Kim Computational Models of Intelligence.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 18: Minimum Variance Estimator.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 14: Probability Wrap-Up and Statistical.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 26: Singular Value Decomposition.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION ASEN 5070 LECTURE 11 9/16,18/09.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 21: A Bayesian Approach to the.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION The Minimum Variance Estimate ASEN 5070 LECTURE.
University of Colorado Boulder ASEN 5070 Statistical Orbit determination I Fall 2012 Professor George H. Born Professor Jeffrey S. Parker Lecture 11: Batch.
Dept. E.E./ESAT-STADIUS, KU Leuven
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 14: Probability and Statistics.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 6: Linearization of OD Problem.
University of Colorado Boulder ASEN 5070 Statistical Orbit Determination I Fall 2012 Professor Jeffrey S. Parker Professor George H. Born Lecture 23: Process.
By: Aaron Dyreson Supervising Professor: Dr. Ioannis Schizas
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION EKF and Observability ASEN 5070 LECTURE 23 10/21/09.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 40: Elements of Attitude Estimation.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 8: State Transition Matrix, Part.
University of Colorado Boulder ASEN 6008 Interplanetary Mission Design Statistical Orbit Determination A brief overview 1.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 17: Minimum Variance Estimator.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 32: Gauss-Markov Processes and.
University of Colorado Boulder ASEN 5070 Statistical Orbit determination I Fall 2012 Professor George H. Born Professor Jeffrey S. Parker Lecture 9: Least.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 29: Observability and Introduction.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Kalman Filter with Process Noise Gauss- Markov.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 22: Further Discussions of the.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 10: Weighted LS and A Priori.
University of Colorado Boulder ASEN 5070 Statistical Orbit determination I Fall 2012 Professor George H. Born Professor Jeffrey S. Parker Lecture 10: Batch.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 41: Information Filter.
ECE 530 – Analysis Techniques for Large-Scale Electrical Systems Prof. Hao Zhu Dept. of Electrical and Computer Engineering University of Illinois at Urbana-Champaign.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 26: Cholesky and Singular Value.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 15: Statistical Least Squares.
DSP-CIS Part-III : Optimal & Adaptive Filters Chapter-9 : Kalman Filters Marc Moonen Dept. E.E./ESAT-STADIUS, KU Leuven
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2015 Professor Brandon A. Jones Lecture 19: Examples with the Batch Processor.
Colorado Center for Astrodynamics Research The University of Colorado 1 STATISTICAL ORBIT DETERMINATION Statistical Interpretation of Least Squares ASEN.
University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 39: Measurement Modeling and Combining.
University of Colorado Boulder ASEN 5070 Statistical Orbit Determination I Fall 2012 Professor Jeffrey S. Parker Professor George H. Born Lecture 18: CKF,
ASEN 5070: Statistical Orbit Determination I Fall 2014
STATISTICAL ORBIT DETERMINATION Kalman (sequential) filter
STATISTICAL ORBIT DETERMINATION Coordinate Systems and Time Kalman Filtering ASEN 5070 LECTURE 21 10/16/09.
ASEN 5070: Statistical Orbit Determination I Fall 2014
ASEN 5070: Statistical Orbit Determination I Fall 2015
ASEN 5070: Statistical Orbit Determination I Fall 2015
ASEN 5070: Statistical Orbit Determination I Fall 2015
ASEN 5070: Statistical Orbit Determination I Fall 2014
ASEN 5070: Statistical Orbit Determination I Fall 2015
ASEN 5070: Statistical Orbit Determination I Fall 2015
PSG College of Technology
6.5 Taylor Series Linearization
Principles of the Global Positioning System Lecture 13
Presentation transcript:

University of Colorado Boulder ASEN 5070: Statistical Orbit Determination I Fall 2014 Professor Brandon A. Jones Lecture 30: Lecture Quiz, Project Details, Concept Quiz

University of Colorado Boulder  Exam 2 Friday ◦ Open book, open notes. Like last time, bring a calculator.  Seminar Friday: 2

University of Colorado Boulder  Office Hours this week ◦ Wednesday 4-5pm (different time) ◦ Thursday 11-12noon (usual time)  Guest Lecture Wednesday Nov. 12 ◦ Jason Leonard – Will discuss the processing of real data for NASA spacecraft (Juno and/or Artemis) 3

University of Colorado Boulder 4 Lecture Quiz

University of Colorado Boulder  Correct: 57.14%  As the elements of the Kalman gain matrix decrease towards zero, the filter (select all that apply): ◦ The filter begins to weigh measurements greater than the a priori state in the measurement update. ◦ The filter begins ignoring measurements in favor of the propagated (i.e., a priori) state deviation vector ◦ The measurement update of the state-error covariance matrix (P) begins to yield only slight changes in P ◦ The filter state and covariance matrix experience no changes due to the time or measurement updates. 5

University of Colorado Boulder 6

University of Colorado Boulder  Correct: 57.14%  As the elements of the Kalman gain matrix decrease towards zero, the filter (select all that apply): ◦ The filter begins to weigh measurements greater than the a priori state in the measurement update. ◦ The filter begins ignoring measurements in favor of the propagated (i.e., a priori) state deviation vector ◦ The measurement update of the state-error covariance matrix (P) begins to yield only slight changes in P ◦ The filter state and covariance matrix experience no changes due to the time or measurement updates. 7 0% 90% 81% 33%

University of Colorado Boulder  Correct: 61.9%  Which of the following can cause the EKF to diverge? (For the sake of this problem, assume we are starting with the EKF and will not use a CKF for early observations) ◦ The reference trajectory is a poor approximation of the truth. ◦ Good measurements (trace(R) is small) with a bad a priori state (trace(P) is large) ◦ Bad measurements (trace(R) is large) with a good a priori (trace(P) is small) ◦ Good measurements (trace(R) is small) with a good a priori (trace(P) is small). 8 95% 76% 10%

University of Colorado Boulder  Correct: 76%  We need to estimate a state with an a priori covariance matrix of (using pseudo-MATLAB notation): Pbar = [ 1e16, 0; 0, 1e-1 ] Our computer has 14 significant digits. Can I use the CKF? ◦ No – the condition number of P is too big. ◦ Yes – the condition number of P is small enough ◦ Yes – the condition number does not matter ◦ It depends on the observation-error covariance matrix 9 76% 5% 0% 19%

University of Colorado Boulder  Correct: 81%  We need to estimate a state with an a priori covariance matrix of (using pseudo-MATLAB notation): Pbar = [ 1e16, 0; 0, 1e-1 ] Our computer has 14 significant digits. Can I use the Potter algorithm? ◦ No – the condition number of the matrix square-root of P is not small enough ◦ Yes – the condition number of the matrix square-root of P is small enough ◦ No – we need a triangular form of the updated covariance matrix square root (W) to continue using the Potter algorithm ◦ Yes, but we could also use the CKF if we prefer without any loss of accuracy % 5% 10% 5%

University of Colorado Boulder  Correct: 10%  When solving the linear system: Where N is the normal matrix and M is the information matrix, we can use the Cholesky decomposition of M (M=R^T*R) to solve for xhat. To do this, we set To solve for xhat, we first use a backward substitution to solve for z and then a forward substitution find xhat. We then use the R matrix to solve for S such that P=SS T. ◦ True ◦ False 11

University of Colorado Boulder  Forward Subs:  Backward Subs: 12

University of Colorado Boulder 13 Concept Quiz

University of Colorado Boulder 14 Final Questions?