Control theoretic splines [[electronic resource] ] : optimal control, statistics, and path planning / / Magnus Egerstedt and Clyde Martin |
Autore | Egerstedt Magnus |
Edizione | [Course Book] |
Pubbl/distr/stampa | Princeton, : Princeton University Press, c2010 |
Descrizione fisica | 1 online resource (227 p.) |
Disciplina | 511/.42 |
Altri autori (Persone) | MartinClyde |
Collana | Princeton series in applied mathematics |
Soggetto topico |
Interpolation
Smoothing (Numerical analysis) Smoothing (Statistics) Curve fitting Splines Spline theory |
Soggetto non controllato |
Accuracy and precision
Affine space Affine variety Algorithm Approximation Arbitrarily large B-spline Banach space Bernstein polynomial Bifurcation theory Big O notation Birkhoff interpolation Boundary value problem Bézier curve Chaos theory Computation Computational problem Condition number Constrained optimization Continuous function (set theory) Continuous function Control function (econometrics) Control theory Controllability Convex optimization Convolution Cubic Hermite spline Data set Derivative Differentiable function Differential equation Dimension (vector space) Directional derivative Discrete mathematics Dynamic programming Equation Estimation Filtering problem (stochastic processes) Gaussian quadrature Gradient descent Gramian matrix Growth curve (statistics) Hermite interpolation Hermite polynomials Hilbert projection theorem Hilbert space Initial condition Initial value problem Integral equation Iterative method Karush–Kuhn–Tucker conditions Kernel method Lagrange polynomial Law of large numbers Least squares Linear algebra Linear combination Linear filter Linear map Mathematical optimization Mathematics Maxima and minima Monotonic function Nonlinear programming Nonlinear system Normal distribution Numerical analysis Numerical stability Optimal control Optimization problem Ordinary differential equation Orthogonal polynomials Parameter Piecewise Pointwise Polynomial interpolation Polynomial Probability distribution Quadratic programming Random variable Rate of convergence Ratio test Riccati equation Simpson's rule Simultaneous equations Smoothing spline Smoothing Smoothness Special case Spline (mathematics) Spline interpolation Statistic Stochastic calculus Stochastic Telemetry Theorem Trapezoidal rule Waypoint Weight function Without loss of generality |
ISBN |
1-282-45796-9
1-282-93606-9 9786612936067 9786612457968 1-4008-3387-6 |
Classificazione | SK 880 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Contents -- Preface -- Chapter One. Introduction -- Chapter Two. Control Systems and Minimum Norm Problems -- Chapter Three. Eight Fundamental Problems -- Chapter Four. Smoothing Splines and Generalizations -- Chapter Five. Approximations and Limiting Concepts -- Chapter Six. Smoothing Splines with Continuous Data -- Chapter Seven. Monotone Smoothing Splines -- Chapter Eight. Smoothing Splines as Integral Filters -- Chapter Nine. Optimal Transfer between Affine Varieties -- Chapter Ten. Path Planning and Telemetry -- Chapter Eleven. Node Selection -- Bibliography -- Index |
Record Nr. | UNINA-9910780863803321 |
Egerstedt Magnus
![]() |
||
Princeton, : Princeton University Press, c2010 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Degree of Approximation by Polynomials in the Complex Domain. (AM-9), Volume 9 / / Walter Edwin Sewell |
Autore | Sewell Walter Edwin |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (252 pages) |
Disciplina | 512.22 |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Approximation theory
Polynomials |
Soggetto non controllato |
0B
Addition Antiderivative Approximation Arbitrarily large Arc (geometry) Arc length Big O notation Bijection Bounded set (topological vector space) Branch point Circumference Coefficient Complex analysis Complex number Conformal map Connected space Constant of integration Continuous function Covering space Derivative Difference "ient Differentiable function Dimension Elementary proof Equation Even and odd functions Existence theorem Existential quantification Exterior (topology) Floor and ceiling functions Fourier series Function of a real variable Geometry Green's function Harmonic function Harmonic polynomial Infimum and supremum Infinitesimal Integer Isolated point Isolated singularity Iterative method Jordan curve theorem Least squares Lebesgue integration Lemniscate Limit (mathematics) Line integral Line segment Lipschitz continuity Logarithm Mathematician Modulus of continuity Natural number Notation Open problem Orthogonal polynomials Partial derivative Periodic function Point at infinity Polynomial Rational function Real variable Rectangle Requirement Riemann sum Root of unity Second derivative Set theory Sign (mathematics) Simply connected space Special case Suggestion Summation Surface integral Taylor series Theorem Theory Trigonometric functions Trigonometry Uniform convergence Unit circle Upper and lower bounds Variable (mathematics) Weight function |
ISBN | 1-4008-8221-4 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- Preface -- Contents -- Chapter I. Preliminaries -- Part I. Problem α -- Chapter II. Polynomial Inequalities -- Chapter III. Tchebycheff Approximation -- Chapter IV. Approximation Measured by a Line Integral -- Part II. Problem β -- Chapter V. Preliminaries -- Chapter VI. Tchebycheff Approximation -- Chapter VII. Approximation Measured by a Line Integral -- Chapter VIII. Special Configurations -- Bibliography |
Record Nr. | UNINA-9910154748503321 |
Sewell Walter Edwin
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
Autore | Mesbahi Mehran |
Edizione | [STU student edition] |
Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
Descrizione fisica | 1 online resource (424 pages) |
Disciplina | 006.3 |
Collana | Princeton series in applied mathematics |
Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
Record Nr. | UNINA-9910785659103321 |
Mesbahi Mehran
![]() |
||
Princeton : , : Princeton University Press, , [2010] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Graph theoretic methods in multiagent networks / / Mehran Mesbahi and Magnus Egerstedt |
Autore | Mesbahi Mehran |
Edizione | [STU student edition] |
Pubbl/distr/stampa | Princeton : , : Princeton University Press, , [2010] |
Descrizione fisica | 1 online resource (424 pages) |
Disciplina | 006.3 |
Collana | Princeton series in applied mathematics |
Soggetto topico |
Network analysis (Planning) - Graphic methods
Multiagent systems - Mathematical models |
Soggetto non controllato |
Addition
Adjacency matrix Algebraic graph theory Algorithm Automorphism Bipartite graph Cardinality Cartesian product Circulant graph Combinatorics Complete graph Computation Connectivity (graph theory) Controllability Convex combination Corollary Cycle graph (algebra) Cycle space Degree (graph theory) Degree matrix Diagonal matrix Diameter Differentiable function Dimension Directed graph Division by zero Dynamical system Eigenvalues and eigenvectors Equilibrium point Estimation Estimator Existential quantification Extremal graph theory Graph (discrete mathematics) Graph theory Identity matrix Incidence matrix Information exchange Initial condition Interconnection Iteration Kalman filter Kronecker product LTI system theory LaSalle's invariance principle Laplacian matrix Least squares Line graph Linear map Lipschitz continuity Lyapunov function Lyapunov stability Markov chain Mathematical optimization Matrix exponential Measurement Multi-agent system Nash equilibrium Natural number Network topology Nonnegative matrix Notation Observability Optimal control Optimization problem Pairwise Parameter Path graph Permutation matrix Permutation Positive semidefinite Positive-definite matrix Probability Quantity Random graph Random variable Rate of convergence Requirement Result Robotics Scientific notation Sensor Sign (mathematics) Simplicial complex Special case Spectral graph theory Stochastic matrix Strongly connected component Subset Summation Supergraph Symmetric matrix Systems theory Theorem Theory Unit interval Upper and lower bounds Variable (mathematics) Vector space Without loss of generality |
ISBN |
9781400835355 (electronic book)
1-282-97910-8 9786612979101 1-4008-3535-6 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Front matter -- Contents -- Preface -- Notation -- PART 1. FOUNDATIONS -- Chapter 1. Introduction -- Chapter 2. Graph Theory -- Chapter 3. The Agreement Protocol: Part I-The Static Case -- Chapter 4. The Agreement Protocol: Part II-Lyapunov and LaSalle -- Chapter 5. Probabilistic Analysis of Networks and Protocols -- PART 2. MULTIAGENT NETWORKS -- Chapter 6. Formation Control -- Chapter 7. Mobile Robots -- Chapter 8. Distributed Estimation -- Chapter 9. Social Networks, Epidemics, and Games -- PART 3. NETWORKS AS SYSTEMS -- Chapter 10. Agreement with Inputs and Outputs -- Chapter 11. Synthesis of Networks -- Chapter 12. Dynamic Graph Processes -- Chapter 13. Higher-order Networks -- Appendix A. -- Bibliography -- Index |
Record Nr. | UNINA-9910816716403321 |
Mesbahi Mehran
![]() |
||
Princeton : , : Princeton University Press, , [2010] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|
Stationary Processes and Prediction Theory. (AM-44), Volume 44 / / Harry Furstenberg |
Autore | Furstenberg Harry |
Pubbl/distr/stampa | Princeton, NJ : , : Princeton University Press, , [2016] |
Descrizione fisica | 1 online resource (300 pages) |
Disciplina | 519 |
Collana | Annals of Mathematics Studies |
Soggetto topico |
Stochastic processes
Mathematical statistics |
Soggetto non controllato |
Abelian group
Adjoint equation Almost periodic function Almost surely Automorphism C*-algebra Cartesian product Character group Characteristic function (probability theory) Coefficient Commutative property Complex number Conditional expectation Conditional probability Continuous function (set theory) Continuous function Corollary Coset Counterexample Degeneracy (mathematics) Dimension (vector space) Dimensional analysis Distribution function Eigenvalues and eigenvectors Endomorphism Equation Equivalence class Equivalence relation Ergodic process Ergodic sequence Ergodic theory Ergodicity Error term Estimation Euclidean space Eventually (mathematics) Existence theorem Existential quantification Expectation value (quantum mechanics) Extrapolation Fourier series Fubini's theorem Function (mathematics) Function composition Functional equation Generic point Harmonic analysis Hilbert space Homeomorphism Homomorphism Identity element Independence (probability theory) Inverse function Invertible matrix Least squares Lebesgue measure Limit (mathematics) Linear combination Linear map Linear prediction Linear space (geometry) Markov chain Metric space Nonlinear system Nonnegative matrix Normed algebra Parameter Periodic sequence Pointwise Predictability Prediction Probability distribution Probability measure Probability space Probability Quotient space (topology) Random sequence Random variable Regular sequence Sample space Semigroup Sequence space Sequence Shift operator Sign (mathematics) Special case Stationary process Stochastic process Stochastic Subalgebra Subgroup Subsequence Subset Theorem Time series Topology Uniform convergence Variable (mathematics) Weak topology Zorn's lemma |
ISBN | 1-4008-8160-9 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | Frontmatter -- ACKNOWLEDGEMENTS -- CONTENTS -- INTRODUCTION -- CHAPTER 1 . STOCHASTIC PROCESSES AND STOCHASTIC SEQUENCES -- CHAPTER 2. THE PREDICTION PROBLEMS FOR SEQUENCES -- CHAPTER 3. EXAMPLES AND COUNTEREXAMPLES -- CHAPTER 4 . SUBPROCESSES OP MARKOFF PROCESSES -- CHAPTER 5. STOCHASTIC SEMIGROUPS AND CONTINUOUS PREDICTABILITY -- CHAPTER 6. STATISTICAL PREDICTABILITY -- CHAPTER 7. INDUCTIVE FUNCTIONS -- CHAPTER 8. INDUCTIVE FUNCTIONS AND MARKOFF PROCESSES -- CHAPTER 9 . PROJECTIVE INDUCTIVE FUNCTIONS AND PREDICTION -- BIBLIOGRAPHY -- Backmatter |
Record Nr. | UNINA-9910154745803321 |
Furstenberg Harry
![]() |
||
Princeton, NJ : , : Princeton University Press, , [2016] | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|