| Daniele Mortari | |
| Birth Date: | June 30, 1955 |
| Birth Place: | Colleferro (Italy) |
| Alma Mater: | Sapienza University of Rome |
| Known For: | Flower Constellations k-vector Range Searching Technique The Theory of Functional Connections |
| Awards: | 2021 IAA Member[1] 2007 IEEE Judith A. Resnik Award 2015 AAS Dirk Brouwer Award Fellow IEEE |
Daniele Mortari (born 30 June 1955) is Professor of Aerospace Engineering at Texas A&M University and Chief Scientist for Space for Texas A&M ASTRO Center.[3] Mortari is known for inventing the Flower Constellations and the k-vector range searching technique and the Theory of Functional Connections.
Mortari was elected Member of the International Academy of Astronautics (IAA) in 2021.[4] He was named Fellow of the Institute of Electrical and Electronics Engineers (IEEE) in 2016[5] for contributions to navigational aspects of space systems", Fellow of the American Astronautical Society (AAS) in 2012 "for outstanding contributions to astronautics", recipient of 2015 Dirk Brower Award (AAS) "for seminal contributions to the theory and practice of spacecraft orbital and rotational dynamics, particularly attitude determination and satellite constellation design", and of 2007 IEEE Judith A. Resnik Award "for innovative designs of orbiting spacecraft constellations, and efficient algorithms for star identification and spacecraft attitude estimation". His other notable awards include: Texas A&M College of Engineering, Herbert H. Richardson Fellow Award,[6] (2015). Texas A&M College of Engineering, William Keeler Memorial Award,[7] (2015). Best Paper Award,[8] Mechanics Meeting Conference, Honorary Member of IEEE-AESS Space System Technical Panel,[9] (Sep. 2009), NASA Group Achievement Award, (May 2008), AIAA, Associate Fellow, (Nov. 2007), IEEE-AESS Distinguished Speaker,[10] (Feb. 2005),Spacecraft Technology Center Award (Jan. 2003), NASA Group Achievement Award, (May 1989).
The original theory of Flower Constellations has been proposed in 2004.[11] Then, the theory has evolved, moving to the 2-D Lattice theory,[12] to the 3-D lattice theory,[13] and recently, to the Necklace theory.[14] These constellations are particularly suitable for classic applications, such as space-based navigation systems (e.g., GPS and Galileo), Earth observation systems (global, regional, persistent, uniform, weighted), and communication systems. Some more advanced and futuristic applications, such as Hyland's intensity correlation interferometric system, configurations to provide global internet broadband service from space, and solar system communication networks, are currently studied.
The K-vector Range Searching Technique is a range searching technique that can be applied to fast retrieve data from any static database. The k-vector technique was initially proposed to identify stars observed by star trackers on board spacecraft. Then, it has been applied to solve different kinds of problems belonging to different fields, such as: 1) nonlinear functions inversion and intersection, 2) extensive sampling data generation with assigned analytical (or numerical) distribution, 3) find approximate solutions of nonlinear Diophantine equations, and 4) iso-surface identification for 3-dimensional data distributions and level set analysis.
The Theory of Functional Connections (TFC) is a mathematical framework generalizing interpolation. TFC derives analytical functionals representing all possible functions subject to a set of constraints. These functionals restrict the whole space of functions to just the subspace that fully satisfies the constraints. Using these functionals, constrained optimization problems are transformed into unconstrained problems. Then, already available and optimized solution methods can be used.The TFC theory has been developed for multivariate rectangular domains subject to absolute, integral, relative, and linear combinations of constraints.[15] [16] [17] Numerically efficient applications of TFC have already been implemented in optimization problems, especially in solving differential equations.[18] [19] In this area, TFC has unified initial, boundary, and multi-value problems by providing fast solutions at machine-error accuracy. This approach has already been applied to solve, in real-time, direct optimal control problems, such as autonomous landing on a large planetary body.[20] Additional applications of TFC are found in nonlinear programming and calculus of variations,[21] in Radiative Transfer[22] Compartmental models in epidemiology,[23] and in Machine learning,[24] where orders of magnitude improvements in speed and accuracy are obtained thanks to the search-space restriction enabled by TFC.