Daniele Mortari

Prof. Daniele Mortari

Texas A&M University
orcid

Research Focus & Metrics

Academic Career Length

31Years (1996-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 June 2000 in The Journal of the Astronautical Sciences
Verified
Journal Article
Closed access
PDF file
FMF. Landis Markley
F. Landis Markley
Daniele MortariDaniele Mortari
Daniele Mortari

1 September 2004 in NAVIGATION: Journal of the Institute of Navigation
Verified
Journal Article
Closed access
PDF file
Daniele MortariDaniele Mortari
Daniele Mortari
MSMalak A. Samaan
Malak A. Samaan
CBChristian Bruccoleri
Christian Bruccoleri
JJJohn L. Junkins
John L. Junkins
A new highly robust algorithm, called Pyramid, is presented to identify the stars observed by star trackers in the general lost-in-space case, where no a priori estimate of pointing is available. At the heart of the method is the k-vector approach for accessing the star catalog, which provides a searchless means to obtain all cataloged stars from the whole sky that could possibly correspond to a particular measured pair, given the measured interstar angle and the measurement precision. The Pyramid logic is built on the identification of a four-star polygon structure—the Pyramid—which is associated with an almost certain star identification. Consequently, the Pyramid algorithm is capable of identifying and discarding even a high number of spikes (false stars). The method, which has already been tested in space, is demonstrated to be highly efficient, extremely robust, and fast. All of these features are supported by simulations and by a few ground test experimental results.

29 January 2009 in Algorithms
Verified
Journal Article
Open access
PDF file
BSBenjamin B. Spratling
Benjamin B. Spratling
Daniele MortariDaniele Mortari
Daniele Mortari
The author surveys algorithms used in star identification, commonly used in star trackers to determine the attitude of a spacecraft. Star trackers are a staple of attitude determination systems for most types of satellites. The paper covers: (a) lost-in-space algorithms (when no a priori attitude information is available), (b) recursive algorithms (when some a priori attitude information is available), and (c) non-dimensional algorithms (when the star tracker calibration is not well-known). The performance of selected algorithms and supporting algorithms are compared.

1 June 1997 in The Journal of the Astronautical Sciences
Verified
Journal Article
Closed access
PDF file
Daniele MortariDaniele Mortari
Daniele Mortari

1 November 2017 in Mathematics
Verified
Journal Article
Open access
PDF file
Daniele MortariDaniele Mortari
Daniele Mortari
This study introduces a procedure to obtain all interpolating functions, y = f ( x ) , subject to linear constraints on the function and its derivatives defined at specified values. The paper first shows how to express these interpolating functions passing through a single point in three distinct ways: linear, additive, and rational. Then, using the additive formalism, interpolating functions with linear constraints on one, two, and n points are introduced as well as those satisfying relative constraints. In particular, for expressions passing through n points, a generalization of the Waring’s interpolation form is introduced. An alternative approach to derive additive constraint interpolating expressions is introduced requiring the inversion of a matrix with dimensions equally the number of constraints. Finally, continuous and discontinuous interpolating periodic functions passing through a set of points with specified periods are provided. This theory has already been applied to obtain least-squares solutions of initial and boundary value problems applied to nonhomogeneous linear differential equations with nonconstant coefficients.

1 March 2004 in The Journal of the Astronautical Sciences
Verified
Journal Article
Closed access
PDF file
Daniele MortariDaniele Mortari
Daniele Mortari
MWMatthew P. Wilkins
Matthew P. Wilkins
CBChristian Bruccoleri
Christian Bruccoleri