IMU-Laser Scanner Localization: Observability Analysis
|
|
- Leo Jones
- 6 years ago
- Views:
Transcription
1 IMU-Laser Scanner Localization: Observability Analysis Faraz M. Mirzaei and Stergios I. Roumeliotis {faraz Dept. of Computer Science & Engineering University of Minnesota Minneapolis, MN Multiple Autonomous Robotic Systems Laboratory Technical Report Number January 2009 Repository Revision: 578 Last Update: :44:22Z Dept. of Computer Science & Engineering University of Minnesota EE/CS Building 200 Union St. S.E. Minneapolis, MN Tel: (612) Fax: (612) URL: faraz
2
3 IMU-Laser Scanner Localization: Observability Analysis Faraz M. Mirzaei and Stergios I. Roumeliotis {faraz Dept. of Computer Science & Engineering University of Minnesota Minneapolis, MN Multiple Autonomous Robotic Systems Laboratory, TR January Nonlinear Observability Consider the state-space representation of the following infinitely-smooth nonlinear system: { ẋ = f(x, u) y = h(x) (1) where x R n is the state vector, u = [u 1,..., u l ] T R l is the vector of control inputs, and y = [y 1,..., y m ] T R m is the measurement vector, with y k = h k (x), k = 1... m. If the process function, f, is input-linear [1], it can be separated into a summation of independent functions, each one corresponding to a different component of the control input vector. In this case, (1) can be written as: { ẋ = f0 (x) + f 1 (x)u f l (x)u l (2) y = h(x) where f 0 is the zero-input function of the process model. The zeroth-order Lie derivative of any (scalar) function is the function itself, i.e., L 0 h k (x) = h k (x). The first-order Lie derivative of function h k (x) with respect to f i is defined as: L 1 f i h k (x) = h k(x) f i1 (x) + + h k(x) f in (x) x 1 x n = h k (x) f i (x) (3) where f i (x) = [f i1 (x),..., f in (x)] T, represents the gradient operator, and denotes the vector inner product. Considering that L 1 f i h k (x) is a scalar function itself, the second-order Lie derivative of h k (x) with respect to f i is: L 2 f i h k (x) = L 1 f i ( L 1 fi h k (x) ) = L 1 f i h k (x) f i (x) (4) Higher-order Lie derivatives are computed similarly. Additionally, it is possible to define mixed Lie derivatives, i.e., with respect to different functions of the process model. For example, the second-order Lie derivative of h k with respect to f j and f i, given its first derivative with respect to f i, is: L 2 f jf i h k (x) = L 1 f j ( L 1 fi h k (x) ) = L 1 f i h k (x) f j (x) (5) Based on the preceding expressions for the Lie derivatives, the observability matrix is defined as the matrix with rows: O { L l f i f j h k (x) i, j = 0,..., l; k = 1,..., m; l N} (6) 2
4 The important role of this matrix in the observability analysis of a nonlinear system is captured by the following proposition [2]: Proposition 1 (Observability Rank Condition). If the observability matrix (cf. (6)) of the nonlinear system defined in (1) is full rank, then the system is locally weakly observable. Remark 1. Since the process and measurement functions (cf. (1)) are infinitely-smooth, the observability matrix O can have infinite number of rows. However, to prove that O is full rank, it suffices to show that a subset of its rows are linearly independent. In general, there exists no systematic method for selecting the suitable Lie derivatives and corresponding rows of O when examining the observability of a system. Instead, this selection is performed by sequentially considering the directions of the state space along which the gradient of each of the candidate Lie derivatives provides information. 2 Observability Analysis of IMU-Laser Scanner Localization In this section, we prove that the system describing the IMU-laser scanner localization is observable when three planes, whose normal vectors are linearly independent, are concurrently observed by the laser scanner. Under this condition, and since the IMU and the laser scanner are rigidly connected and their relative transformation is known, we can employ the pose estimation method described in [3] to estimate ( G p I, I q G ). For the purpose of observability analysis, we introduce two new inferred measurements 1 h 1 and that replace the laser scan measurements [3]: I q G = h 1(x) = ξ 1 ( I l 1, I l 2, I l 3 ) (7) G p I = (x) = ξ 2 ( I l 1, I l 2, I l 3 ). (8) The two functions ξ 1 and ξ 2 in (7) and (8) need not to be known explicitly; only their functional relation with the random variables, I q G and G p I, is required for the observability analysis. Our approach uses the Lie derivatives [2] of the above inferred measurements (7) and (8) for the system in [3], to show that the corresponding observability matrix is full rank. For this purpose, we first rearrange the nonlinear kinematic equations (see [3]) in a suitable form for computing the Lie derivatives: 2 I q G ḃg G v I = 6 4 ḃ 7 a 5 Gṗ I q Ξ(I G )b g G g C T ( I q G )b a G v I } {{ } f 0 where ω m and a m are considered the control inputs, and [ ] q4 I Ξ( q) = 3 + q q T q Ξ(I G ) } {{ } f 1 ω m+ with q = C T ( I q G ) a m, (9) } {{ } f 2 [ q. (10) q4] Note also that f 0 is a 16 1 vector, while f 1 and f 2 are matrices of dimensions In order to prove that the system is locally weakly observable, it suffices to show that the observability matrix, whose rows comprise the gradients of the Lie derivatives of the measurements h 1 and with respect to f 0, f 1, and f 2 [cf. (9)], is full rank. Since the measurement and kinematic equations describing the IMU-laser scanner localization are infinitely smooth, the observability matrix has an infinite number of rows. However, to prove it is full rank, it suffices to show that a subset of its rows are linearly independent. The following matrix contains one such subset of rows whose linear independence can be easily shown using block Gaussian elimination: L 0 h 1 I L 0 O = L 1 f 0 h 1 L 1 f 0 h = I 3 X Ξ(I q G ) I 3 L 2 f 0 X 2 C T ( I q G ) 1 The observability of the system can also be shown using only the inferred position measurement (8). For details refer to Section 2.1. TR RepRev578 3
5 where L i f 0 h j (x) denotes the i-th order Lie derivative of h j (x) with respect to f 0. The matrices X 1 and X 2 which have dimensions 4 4 and 3 4, respectively, do not need to be computed explicitly since they will be eliminated by the block element (1, 1) of the matrix, i.e., the identity matrix I 4. The resulting matrix after this step is: I I 3 O = Ξ(I q G ) I C T ( I q G ) The determinant of the rotation matrix C( q) is always one for any unit quaternion q, therefore it is always full rank. In the next step we show that Ξ( q) cannot be rank deficient 2. If Ξ( q) is rank deficient, all its square submatrices of dimension 3 3 will be rank deficient and their determinants will be zero. Matrix Ξ( q) has 4 such submatrices, indicated by removing one row of its rows. Using MATLAB notations, the determinant of these submatrices are: p 1 (q 1, q 2, q 3, q 4 ) = det (Ξ([1, 2, 3], :)) = q q 4 q q 2 3q 4 + q 2 2q 4 (11) p 1 (q 1, q 2, q 3, q 4 ) = det (Ξ([1, 2, 4], :)) = q 3 q 2 4 q 3 3 q 3 q 2 2 q 3 q 2 1 (12) p 1 (q 1, q 2, q 3, q 4 ) = det (Ξ([1, 3, 4], :)) = q 2 q q 2 q q q 2 q 2 1 (13) p 1 (q 1, q 2, q 3, q 4 ) = det (Ξ([2, 3, 4], :)) = q 2 3q 1 q 2 2q 1 q 1 q 2 4 q 3 1 (14) For Ξ( q) to be full rank, p i, i = 1,..., 4 should be simultaneously equal to zero. Additionally, the solution q = [q 1, q 2, q 3, q 4 ] T that satisfies p i ( q) = 0, i = 1,..., 4, must also satisfy the unique quaternion constraint, p 0 = q T q 1 = 0. However, a Groebner-basis analysis [4] of these five equations in Maple reveals that their only basis is 1, which means that the variety defined by them is empty [4]. In other words, there is no q that simultaneously satisfies p i ( q) = 0, i = 0,..., 4, thus Ξ( q) cannot be rank deficient for any q 3. Considering that Ξ( q) and C( q) are always full rank for any unit quaternion q, it is clear that all the rows of the matrix O are linearly independent. Hence, we conclude the observability analysis by the following lemma: Lemma 1. Given line measurements corresponding to three planes with linearly independent normal vectors, the system describing the IMU-laser scanner localization is locally weakly observable. 2.1 Alternative proof of observability It is possible to prove that the system defined in (9) is observable when only position measurements [cf. (8)] are available. In this case, as shown below, additional constraints on the motion of the IMU is needed to guarantee observability. We begin by using the following alternative observability matrix (among the infinite number of choices) that only exploits the measurement function (x): O = L 0 L 1 f 0 L 2 f 2 f 0 L 3 f 0f 2 f 0 L 2 f I 3 = I 3 A( I q G ) X 1 B( I q G ) , A( q) = X 2 C T ( I q G ) c 1( q) q c 2( q) q c 3( q) q, B( q) = A( q)ξ( q) where c l ( q), l = 1, 2, 3 are the columns of the rotation matrix C( q), i.e., C( q) = [c 1 ( q) c 2 ( q) c 3 ( q)]. With a Groebner-basis analysis of the determinant of square submatrices of A( q) (similar to the previous section), it can be easily shown that under the unit norm quaternion constraint, the matrix A( q) is full rank for any q. In a similar way it can be shown that B( q) = A( q)ξ( q) is also full rank for any q. Considering that A( q) and B( q) are full rank for any q, it is straight-forward to show that O is full rank by performing block Gaussian elimination similar to the previous section. However, it should be noticed that since in forming O we used Lie derivatives with respect to f 2, the acceleration a m should not be identically zero at least in two direction 4. Therefore, this alternative proof is more 2 An easier way for showing that Ξ( q) is full rank is to notice that under the unit quaternion constraint Ξ T ( q)ξ( q) = I 3 for any q. However, we follow this more complicated approach, since a similar approach is used in the next section to provide an alternative proof of observability 3 This is equivalent to proving that the multivariate resultant of the five equations p i ( q) = 0, i = 0,..., 4 is always nonzero, indicating that these equations do not have a common solution. 4 This is due to the fact that the determinants of submatrices of A( q) and B( q) involving only the derivatives of two columns of C( q) are sufficient to prove that A( q) and B( q) are full rank, respectively. TR RepRev578 4
6 restrictive than the proof in the previous section where measurements of both position and orientation were available, but no assumption on the motion profile was made. References [1] H. Nijmeijer and A. van der Schaft, Nonlinear Dynamical Control Systems. New York: Springer-Verlag, [2] R. Hermann and A. Krener, Nonlinear controlability and observability, IEEE Transactions on Automatic Control, vol. AC-22, no. 5, pp , Oct [3] J. A. Hesch, F. M. Mirzaei, G. L. Mariottini,, and S. I. Roumeliotis, A 3D pose tracker for the visually impaired, in Proc. of the IEEE/RSJ International Conference on Intelligent Robots and Systems (submitted), [4] D. Cox, J. Little, and D. O Shea, Using Algebraic Geometry. Springer, TR RepRev578 5
IMU-Camera Calibration: Observability Analysis
IMU-Camera Calibration: Observability Analysis Faraz M. Mirzaei and Stergios I. Roumeliotis {faraz stergios}@cs.umn.edu Dept. of Computer Science & Engineering University of Minnesota Minneapolis, MN 55455
More informationMultiple Autonomous Robotic Systems Laboratory Technical Report Number
Observability-constrained EKF Implementation of the IMU-RGBD Camera Navigation using Point and Plane Features Chao X. Guo and Stergios I. Roumeliotis Multiple Autonomous Robotic Systems Laboratory Technical
More informationOn the Observability and Self-Calibration of Visual-Inertial Navigation Systems
Center for Robotics and Embedded Systems University of Southern California Technical Report CRES-08-005 R B TIC EMBEDDED SYSTEMS LABORATORY On the Observability and Self-Calibration of Visual-Inertial
More informationEfficient Visual-Inertial Navigation using a Rolling-Shutter Camera with Inaccurate Timestamps
Efficient Visua-Inertia Navigation using a Roing-Shutter Camera with Inaccurate Timestamps Chao X. Guo, Dimitrios G. Kottas, Ryan C. DuToit Ahmed Ahmed, Ruipeng Li and Stergios I. Roumeiotis Mutipe Autonomous
More informationInter-robot Transformations in 3D
1 Inter-robot Transformations in 3D Nikolas Trawny, Student Member, IEEE, Xun S. Zhou, Student Member, IEEE, Ke Zhou, Student Member, IEEE, and Stergios I. Roumeliotis, Member, IEEE Abstract In this paper,
More informationSun Sensor Model. Center for Distributed Robotics Technical Report Number
Sun Sensor Model Nikolas Trawny and Stergios Roumeliotis Department of Computer Science & Engineering University of Minnesota Center for Distributed Robotics Technical Report Number -2005-00 January 2005
More information3. Vector spaces 3.1 Linear dependence and independence 3.2 Basis and dimension. 5. Extreme points and basic feasible solutions
A. LINEAR ALGEBRA. CONVEX SETS 1. Matrices and vectors 1.1 Matrix operations 1.2 The rank of a matrix 2. Systems of linear equations 2.1 Basic solutions 3. Vector spaces 3.1 Linear dependence and independence
More informationChapter 1 Vector Spaces
Chapter 1 Vector Spaces Per-Olof Persson persson@berkeley.edu Department of Mathematics University of California, Berkeley Math 110 Linear Algebra Vector Spaces Definition A vector space V over a field
More informationGlobally Optimal Pose Estimation from Line Correspondences
Globally Optimal Pose Estimation from Line orrespondences Faraz M Mirzaei and Stergios I Roumeliotis Abstract orrespondences between 2D lines in an image and 3D lines in the surrounding environment can
More informationMAT 242 CHAPTER 4: SUBSPACES OF R n
MAT 242 CHAPTER 4: SUBSPACES OF R n JOHN QUIGG 1. Subspaces Recall that R n is the set of n 1 matrices, also called vectors, and satisfies the following properties: x + y = y + x x + (y + z) = (x + y)
More information3D Relative Pose Estimation from Six Distances
3D Relative Pose Estimation from Six Distances Nikolas rawny, Xun S Zhou, and Stergios I Roumeliotis Department of Computer Science and Engineering, University of Minnesota, Minneapolis, MN 55455 E-mail:
More informationNavigation and Obstacle Avoidance via Backstepping for Mechanical Systems with Drift in the Closed Loop
Navigation and Obstacle Avoidance via Backstepping for Mechanical Systems with Drift in the Closed Loop Jan Maximilian Montenbruck, Mathias Bürger, Frank Allgöwer Abstract We study backstepping controllers
More informationMATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian.
MATH 304 Linear Algebra Lecture 10: Linear independence. Wronskian. Spanning set Let S be a subset of a vector space V. Definition. The span of the set S is the smallest subspace W V that contains S. If
More informationReview Questions REVIEW QUESTIONS 71
REVIEW QUESTIONS 71 MATLAB, is [42]. For a comprehensive treatment of error analysis and perturbation theory for linear systems and many other problems in linear algebra, see [126, 241]. An overview of
More informationActive Nonlinear Observers for Mobile Systems
Active Nonlinear Observers for Mobile Systems Simon Cedervall and Xiaoming Hu Optimization and Systems Theory Royal Institute of Technology SE 00 44 Stockholm, Sweden Abstract For nonlinear systems in
More informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Introduction to Nonlinear Controllability and Observability Hanz Richter Mechanical Engineering Department Cleveland State University Definition of
More informationThe Unicycle in Presence of a Single Disturbance: Observability Properties
The Unicycle in Presence of a Single Disturbance: Observability Properties Agostino Martinelli To cite this version: Agostino Martinelli. The Unicycle in Presence of a Single Disturbance: Observability
More informationLIE TRANSFORM CONSTRUCTION OF EXPONENTIAL NORMAL FORM OBSERVERS. Suba Thomas Harry G. Kwatny Bor-Chin Chang
LIE TRANSFORM CONSTRUCTION OF EXPONENTIAL NORMAL FORM OBSERVERS Suba Thomas Harry G Kwatny Bor-Chin Chang Department of Mechanical Engineering and Mechanics, Drexel University, Philadelphia, PA 1914, USA
More informationIMU-RGBD Camera Extrinsic Calibration: Observability Analysis and Consistency Improvement
IMU-RGBD Camera Extrinsic Calibration: Observability Analysis and Consistency Improvement Cao X Guo and Stergios I Roumeliotis Multiple Autonomous Robotic Systems Laboratory Tecnical Report Number -212-1
More informationA First-Estimates Jacobian EKF for Improving SLAM Consistency
A First-Estimates Jacobian EKF for Improving SLAM Consistency Guoquan P. Huang 1, Anastasios I. Mourikis 1,2, and Stergios I. Roumeliotis 1 1 Dept. of Computer Science and Engineering, University of Minnesota,
More informationMinimum-Phase Property of Nonlinear Systems in Terms of a Dissipation Inequality
Minimum-Phase Property of Nonlinear Systems in Terms of a Dissipation Inequality Christian Ebenbauer Institute for Systems Theory in Engineering, University of Stuttgart, 70550 Stuttgart, Germany ce@ist.uni-stuttgart.de
More informationLinear Algebra I Lecture 8
Linear Algebra I Lecture 8 Xi Chen 1 1 University of Alberta January 25, 2019 Outline 1 2 Gauss-Jordan Elimination Given a system of linear equations f 1 (x 1, x 2,..., x n ) = 0 f 2 (x 1, x 2,..., x n
More informationEE731 Lecture Notes: Matrix Computations for Signal Processing
EE731 Lecture Notes: Matrix Computations for Signal Processing James P. Reilly c Department of Electrical and Computer Engineering McMaster University September 22, 2005 0 Preface This collection of ten
More informationOn the convergence of normal forms for analytic control systems
Chapter 1 On the convergence of normal forms for analytic control systems Wei Kang Department of Mathematics, Naval Postgraduate School Monterey, CA 93943 wkang@nps.navy.mil Arthur J. Krener Department
More informationLecture 18: The Rank of a Matrix and Consistency of Linear Systems
Lecture 18: The Rank of a Matrix and Consistency of Linear Systems Winfried Just Department of Mathematics, Ohio University February 28, 218 Review: The linear span Definition Let { v 1, v 2,..., v n }
More informationStrengthened Sobolev inequalities for a random subspace of functions
Strengthened Sobolev inequalities for a random subspace of functions Rachel Ward University of Texas at Austin April 2013 2 Discrete Sobolev inequalities Proposition (Sobolev inequality for discrete images)
More informationALARGE number of applications require robots to move in
IEEE TRANSACTIONS ON ROBOTICS, VOL. 22, NO. 5, OCTOBER 2006 917 Optimal Sensor Scheduling for Resource-Constrained Localization of Mobile Robot Formations Anastasios I. Mourikis, Student Member, IEEE,
More informationAPPENDIX A. Background Mathematics. A.1 Linear Algebra. Vector algebra. Let x denote the n-dimensional column vector with components x 1 x 2.
APPENDIX A Background Mathematics A. Linear Algebra A.. Vector algebra Let x denote the n-dimensional column vector with components 0 x x 2 B C @. A x n Definition 6 (scalar product). The scalar product
More informationA CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE
Journal of Applied Analysis Vol. 6, No. 1 (2000), pp. 139 148 A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE A. W. A. TAHA Received
More informationImplications of the Constant Rank Constraint Qualification
Mathematical Programming manuscript No. (will be inserted by the editor) Implications of the Constant Rank Constraint Qualification Shu Lu Received: date / Accepted: date Abstract This paper investigates
More informationMATH 304 Linear Algebra Lecture 20: Review for Test 1.
MATH 304 Linear Algebra Lecture 20: Review for Test 1. Topics for Test 1 Part I: Elementary linear algebra (Leon 1.1 1.4, 2.1 2.2) Systems of linear equations: elementary operations, Gaussian elimination,
More informationc i r i i=1 r 1 = [1, 2] r 2 = [0, 1] r 3 = [3, 4].
Lecture Notes: Rank of a Matrix Yufei Tao Department of Computer Science and Engineering Chinese University of Hong Kong taoyf@cse.cuhk.edu.hk 1 Linear Independence Definition 1. Let r 1, r 2,..., r m
More informationMemoryless output feedback nullification and canonical forms, for time varying systems
Memoryless output feedback nullification and canonical forms, for time varying systems Gera Weiss May 19, 2005 Abstract We study the possibility of nullifying time-varying systems with memoryless output
More informationGRÖBNER BASES AND POLYNOMIAL EQUATIONS. 1. Introduction and preliminaries on Gróbner bases
GRÖBNER BASES AND POLYNOMIAL EQUATIONS J. K. VERMA 1. Introduction and preliminaries on Gróbner bases Let S = k[x 1, x 2,..., x n ] denote a polynomial ring over a field k where x 1, x 2,..., x n are indeterminates.
More informationLagrange multipliers. Portfolio optimization. The Lagrange multipliers method for finding constrained extrema of multivariable functions.
Chapter 9 Lagrange multipliers Portfolio optimization The Lagrange multipliers method for finding constrained extrema of multivariable functions 91 Lagrange multipliers Optimization problems often require
More informationLinear Algebra problems
Linear Algebra problems 1. Show that the set F = ({1, 0}, +,.) is a field where + and. are defined as 1+1=0, 0+0=0, 0+1=1+0=1, 0.0=0.1=1.0=0, 1.1=1.. Let X be a non-empty set and F be any field. Let X
More informationLinear Algebra Massoud Malek
CSUEB Linear Algebra Massoud Malek Inner Product and Normed Space In all that follows, the n n identity matrix is denoted by I n, the n n zero matrix by Z n, and the zero vector by θ n An inner product
More informationCONVERGENCE PROOF FOR RECURSIVE SOLUTION OF LINEAR-QUADRATIC NASH GAMES FOR QUASI-SINGULARLY PERTURBED SYSTEMS. S. Koskie, D. Skataric and B.
To appear in Dynamics of Continuous, Discrete and Impulsive Systems http:monotone.uwaterloo.ca/ journal CONVERGENCE PROOF FOR RECURSIVE SOLUTION OF LINEAR-QUADRATIC NASH GAMES FOR QUASI-SINGULARLY PERTURBED
More informationAnalysis and Improvement of the Consistency of Extended Kalman Filter based SLAM
28 IEEE International Conference on Robotics and Automation Pasadena, CA, USA, May 19-23, 28 Analysis and Improvement of the Consistency of Etended Kalman Filter based SLAM Guoquan P Huang, Anastasios
More informationReview of Linear Algebra
Review of Linear Algebra Throughout these notes, F denotes a field (often called the scalars in this context). 1 Definition of a vector space Definition 1.1. A F -vector space or simply a vector space
More informationLinear Algebra. Min Yan
Linear Algebra Min Yan January 2, 2018 2 Contents 1 Vector Space 7 1.1 Definition................................. 7 1.1.1 Axioms of Vector Space..................... 7 1.1.2 Consequence of Axiom......................
More informationMatrix Operations: Determinant
Matrix Operations: Determinant Determinants Determinants are only applicable for square matrices. Determinant of the square matrix A is denoted as: det(a) or A Recall that the absolute value of the determinant
More informationObservability-based Rules for Designing Consistent EKF SLAM Estimators
The International Journal of Robotics Research OnlineFirst, published on December 11, 2009 as doi:10.1177/0278364909353640 Guoquan P. Huang Department of Computer Science and Engineering, University of
More informationSensor Localization and Target Estimation in Visual Sensor Networks
Annual Schedule of my Research Sensor Localization and Target Estimation in Visual Sensor Networks Survey and Problem Settings Presented in the FL seminar on May th First Trial and Evaluation of Proposed
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 1 x 2. x n 8 (4) 3 4 2
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS SYSTEMS OF EQUATIONS AND MATRICES Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationAn algebraic perspective on integer sparse recovery
An algebraic perspective on integer sparse recovery Lenny Fukshansky Claremont McKenna College (joint work with Deanna Needell and Benny Sudakov) Combinatorics Seminar USC October 31, 2018 From Wikipedia:
More informationA 3D Pose Estimator for the Visually Impaired
A 3D Pose Estimator for the Visually mpaired Joel A. Hesch, Faraz M. Mirzaei, ian Luca Mariottini, and Stergios. Roumeliotis Dept. of Computer Science and Engineering, University of Minnesota Email: {joel
More informationOn Filter Consistency of Discrete-time Nonlinear Systems with Partial-state Measurements
On Filter Consistency of Discrete-time Nonlinear Systems with Partial-state Measurements Guoquan P Huang and Stergios I Roumeliotis Abstract Linearized filters, such as the extended Kalman filter EKF),
More informationMath 123, Week 5: Linear Independence, Basis, and Matrix Spaces. Section 1: Linear Independence
Math 123, Week 5: Linear Independence, Basis, and Matrix Spaces Section 1: Linear Independence Recall that every row on the left-hand side of the coefficient matrix of a linear system A x = b which could
More informationFUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES. 1. Compact Sets
FUNCTIONAL ANALYSIS LECTURE NOTES: COMPACT SETS AND FINITE-DIMENSIONAL SPACES CHRISTOPHER HEIL 1. Compact Sets Definition 1.1 (Compact and Totally Bounded Sets). Let X be a metric space, and let E X be
More informationUsing Hankel structured low-rank approximation for sparse signal recovery
Using Hankel structured low-rank approximation for sparse signal recovery Ivan Markovsky 1 and Pier Luigi Dragotti 2 Department ELEC Vrije Universiteit Brussel (VUB) Pleinlaan 2, Building K, B-1050 Brussels,
More informationRobotics 1 Inverse kinematics
Robotics 1 Inverse kinematics Prof. Alessandro De Luca Robotics 1 1 Inverse kinematics what are we looking for? direct kinematics is always unique; how about inverse kinematics for this 6R robot? Robotics
More information17 Solution of Nonlinear Systems
17 Solution of Nonlinear Systems We now discuss the solution of systems of nonlinear equations. An important ingredient will be the multivariate Taylor theorem. Theorem 17.1 Let D = {x 1, x 2,..., x m
More informationLinear Algebra Review. Vectors
Linear Algebra Review 9/4/7 Linear Algebra Review By Tim K. Marks UCSD Borrows heavily from: Jana Kosecka http://cs.gmu.edu/~kosecka/cs682.html Virginia de Sa (UCSD) Cogsci 8F Linear Algebra review Vectors
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Bastian Steder
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Bastian Steder Reference Book Thrun, Burgard, and Fox: Probabilistic Robotics Vectors Arrays of numbers Vectors represent
More informationChapter 2. Vector Spaces
Chapter 2 Vector Spaces Vector spaces and their ancillary structures provide the common language of linear algebra, and, as such, are an essential prerequisite for understanding contemporary applied mathematics.
More informationWe describe the generalization of Hazan s algorithm for symmetric programming
ON HAZAN S ALGORITHM FOR SYMMETRIC PROGRAMMING PROBLEMS L. FAYBUSOVICH Abstract. problems We describe the generalization of Hazan s algorithm for symmetric programming Key words. Symmetric programming,
More informationAbstract. + n) variables with a rank of ( n2 (n+1) )+n 2 ] equations in ( n2 (n+1)
SOLUTION OF SECOND ORDER LINEARIZATION R.Devanathan School of Electrical and Electronic Engineering (Block S) Nanyang Technological University Singapore 6998 E-mail:edevan@ntu.edu.sg Abstract For a nonlinear
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationMATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam. Topics
MATH 213 Linear Algebra and ODEs Spring 2015 Study Sheet for Midterm Exam This study sheet will not be allowed during the test Books and notes will not be allowed during the test Calculators and cell phones
More informationVector Space Concepts
Vector Space Concepts ECE 174 Introduction to Linear & Nonlinear Optimization Ken Kreutz-Delgado ECE Department, UC San Diego Ken Kreutz-Delgado (UC San Diego) ECE 174 Fall 2016 1 / 25 Vector Space Theory
More information1. Select the unique answer (choice) for each problem. Write only the answer.
MATH 5 Practice Problem Set Spring 7. Select the unique answer (choice) for each problem. Write only the answer. () Determine all the values of a for which the system has infinitely many solutions: x +
More informationLinear Algebra. Preliminary Lecture Notes
Linear Algebra Preliminary Lecture Notes Adolfo J. Rumbos c Draft date April 29, 23 2 Contents Motivation for the course 5 2 Euclidean n dimensional Space 7 2. Definition of n Dimensional Euclidean Space...........
More informationThe definition of a vector space (V, +, )
The definition of a vector space (V, +, ) 1. For any u and v in V, u + v is also in V. 2. For any u and v in V, u + v = v + u. 3. For any u, v, w in V, u + ( v + w) = ( u + v) + w. 4. There is an element
More informationSTABILITY OF PLANAR NONLINEAR SWITCHED SYSTEMS
LABORATOIRE INORMATIQUE, SINAUX ET SYSTÈMES DE SOPHIA ANTIPOLIS UMR 6070 STABILITY O PLANAR NONLINEAR SWITCHED SYSTEMS Ugo Boscain, régoire Charlot Projet TOpModel Rapport de recherche ISRN I3S/RR 2004-07
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Kai Arras, Maren Bennewitz Vectors Arrays of numbers Vectors represent a point in a n dimensional space
More informationDesigning Information Devices and Systems I Spring 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way
EECS 16A Designing Information Devices and Systems I Spring 018 Lecture Notes Note 1 1.1 Introduction to Linear Algebra the EECS Way In this note, we will teach the basics of linear algebra and relate
More informationLinear Algebra and Robot Modeling
Linear Algebra and Robot Modeling Nathan Ratliff Abstract Linear algebra is fundamental to robot modeling, control, and optimization. This document reviews some of the basic kinematic equations and uses
More informationOn Boolean functions which are bent and negabent
On Boolean functions which are bent and negabent Matthew G. Parker 1 and Alexander Pott 2 1 The Selmer Center, Department of Informatics, University of Bergen, N-5020 Bergen, Norway 2 Institute for Algebra
More informationQuaternion Cubic Spline
Quaternion Cubic Spline James McEnnan jmcennan@mailaps.org May 28, 23 1. INTRODUCTION A quaternion spline is an interpolation which matches quaternion values at specified times such that the quaternion
More informationANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3
ANALYTICAL MATHEMATICS FOR APPLICATIONS 2018 LECTURE NOTES 3 ISSUED 24 FEBRUARY 2018 1 Gaussian elimination Let A be an (m n)-matrix Consider the following row operations on A (1) Swap the positions any
More informationRepresentations and Linear Actions
Representations and Linear Actions Definition 0.1. Let G be an S-group. A representation of G is a morphism of S-groups φ G GL(n, S) for some n. We say φ is faithful if it is a monomorphism (in the category
More informationPolynomials, Ideals, and Gröbner Bases
Polynomials, Ideals, and Gröbner Bases Notes by Bernd Sturmfels for the lecture on April 10, 2018, in the IMPRS Ringvorlesung Introduction to Nonlinear Algebra We fix a field K. Some examples of fields
More informationMCE693/793: Analysis and Control of Nonlinear Systems
MCE693/793: Analysis and Control of Nonlinear Systems Input-Output and Input-State Linearization Zero Dynamics of Nonlinear Systems Hanz Richter Mechanical Engineering Department Cleveland State University
More informationDate: July 5, Contents
2 Lagrange Multipliers Date: July 5, 2001 Contents 2.1. Introduction to Lagrange Multipliers......... p. 2 2.2. Enhanced Fritz John Optimality Conditions...... p. 14 2.3. Informative Lagrange Multipliers...........
More informationConstrained Consensus and Optimization in Multi-Agent Networks
Constrained Consensus Optimization in Multi-Agent Networks The MIT Faculty has made this article openly available. Please share how this access benefits you. Your story matters. Citation As Published Publisher
More informationGroebner Bases and Applications
Groebner Bases and Applications Robert Hines December 16, 2014 1 Groebner Bases In this section we define Groebner Bases and discuss some of their basic properties, following the exposition in chapter
More informationVector Spaces. (1) Every vector space V has a zero vector 0 V
Vector Spaces 1. Vector Spaces A (real) vector space V is a set which has two operations: 1. An association of x, y V to an element x+y V. This operation is called vector addition. 2. The association of
More informationOn Riesz-Fischer sequences and lower frame bounds
On Riesz-Fischer sequences and lower frame bounds P. Casazza, O. Christensen, S. Li, A. Lindner Abstract We investigate the consequences of the lower frame condition and the lower Riesz basis condition
More informationarxiv: v1 [cs.sy] 2 Apr 2019
On the Existence of a Fixed Spectrum for a Multi-channel Linear System: A Matroid Theory Approach F Liu 1 and A S Morse 1 arxiv:190401499v1 [cssy] 2 Apr 2019 Abstract Conditions for the existence of a
More informationIntroduction to Mobile Robotics Compact Course on Linear Algebra. Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello
Introduction to Mobile Robotics Compact Course on Linear Algebra Wolfram Burgard, Cyrill Stachniss, Maren Bennewitz, Diego Tipaldi, Luciano Spinello Vectors Arrays of numbers Vectors represent a point
More informationReview (Probability & Linear Algebra)
Review (Probability & Linear Algebra) CE-725 : Statistical Pattern Recognition Sharif University of Technology Spring 2013 M. Soleymani Outline Axioms of probability theory Conditional probability, Joint
More informationAnalysis and Improvement of the Consistency of Extended Kalman Filter based SLAM
Analysis and Improvement of the Consistency of Extended Kalman Filter based SLAM Guoquan Huang, Anastasios I Mourikis and Stergios I Roumeliotis Multiple Autonomous Robotic Systems Labroratory Technical
More informationOn the Treatment of Relative-Pose Measurements for Mobile Robot Localization
On the Treatment of Relative-Pose Measurements for Mobile Robot Localization Anastasios I. Mourikis and Stergios I. Roumeliotis Dept. of Computer Science & Engineering, University of Minnesota, Minneapolis,
More informationFundamentals of Linear Algebra. Marcel B. Finan Arkansas Tech University c All Rights Reserved
Fundamentals of Linear Algebra Marcel B. Finan Arkansas Tech University c All Rights Reserved 2 PREFACE Linear algebra has evolved as a branch of mathematics with wide range of applications to the natural
More informationA Review of Matrix Analysis
Matrix Notation Part Matrix Operations Matrices are simply rectangular arrays of quantities Each quantity in the array is called an element of the matrix and an element can be either a numerical value
More informationChapter 3. Vector spaces
Chapter 3. Vector spaces Lecture notes for MA1111 P. Karageorgis pete@maths.tcd.ie 1/22 Linear combinations Suppose that v 1,v 2,...,v n and v are vectors in R m. Definition 3.1 Linear combination We say
More informationINVERSION IN INDIRECT OPTIMAL CONTROL
INVERSION IN INDIRECT OPTIMAL CONTROL François Chaplais, Nicolas Petit Centre Automatique et Systèmes, École Nationale Supérieure des Mines de Paris, 35, rue Saint-Honoré 7735 Fontainebleau Cedex, France,
More informationChapter 5. Linear Algebra. A linear (algebraic) equation in. unknowns, x 1, x 2,..., x n, is. an equation of the form
Chapter 5. Linear Algebra A linear (algebraic) equation in n unknowns, x 1, x 2,..., x n, is an equation of the form a 1 x 1 + a 2 x 2 + + a n x n = b where a 1, a 2,..., a n and b are real numbers. 1
More informationSYMBOL EXPLANATION EXAMPLE
MATH 4310 PRELIM I REVIEW Notation These are the symbols we have used in class, leading up to Prelim I, and which I will use on the exam SYMBOL EXPLANATION EXAMPLE {a, b, c, } The is the way to write the
More informationConverse Lyapunov theorem and Input-to-State Stability
Converse Lyapunov theorem and Input-to-State Stability April 6, 2014 1 Converse Lyapunov theorem In the previous lecture, we have discussed few examples of nonlinear control systems and stability concepts
More informationCalculating determinants for larger matrices
Day 26 Calculating determinants for larger matrices We now proceed to define det A for n n matrices A As before, we are looking for a function of A that satisfies the product formula det(ab) = det A det
More informationVector space and subspace
Vector space and subspace Math 112, week 8 Goals: Vector space, subspace, span. Null space, column space. Linearly independent, bases. Suggested Textbook Readings: Sections 4.1, 4.2, 4.3 Week 8: Vector
More informationDesigning Information Devices and Systems I Fall 2018 Lecture Notes Note Introduction to Linear Algebra the EECS Way
EECS 16A Designing Information Devices and Systems I Fall 018 Lecture Notes Note 1 1.1 Introduction to Linear Algebra the EECS Way In this note, we will teach the basics of linear algebra and relate it
More informationMobile Robotics 1. A Compact Course on Linear Algebra. Giorgio Grisetti
Mobile Robotics 1 A Compact Course on Linear Algebra Giorgio Grisetti SA-1 Vectors Arrays of numbers They represent a point in a n dimensional space 2 Vectors: Scalar Product Scalar-Vector Product Changes
More informationGeometric Modeling Summer Semester 2010 Mathematical Tools (1)
Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Recap: Linear Algebra Today... Topics: Mathematical Background Linear algebra Analysis & differential geometry Numerical techniques Geometric
More informationIMU-RGBD Camera Extrinsic Calibration: Observability Analysis and Consistency Improvement
IMU-RGBD Camera Extrinsic Calibration: Observability Analysis and Consistency Improvement Cao X. Guo and Stergios I. Roumeliotis Abstract In tis paper, we address te problem of extrinsically calibrating
More informationMathematics for Control Theory
Mathematics for Control Theory Geometric Concepts in Control Involutivity and Frobenius Theorem Exact Linearization Hanz Richter Mechanical Engineering Department Cleveland State University Reading materials
More informationReduction in number of dofs
Reduction in number of dofs Reduction in the number of dof to represent a structure reduces the size of matrices and, hence, computational cost. Because a subset of the original dof represent the whole
More informationRobotics 1 Inverse kinematics
Robotics 1 Inverse kinematics Prof. Alessandro De Luca Robotics 1 1 Inverse kinematics what are we looking for? direct kinematics is always unique; how about inverse kinematics for this 6R robot? Robotics
More information