Search

This paper proposes an improved height profile model for drop-on-demand 3D printing with UV curable ink. It is extended from a previously validated model and computes height profile indirectly from volume and area propagation to ensure volume conservation. To accommodate 2D patterns using multiple passes, volume change and area change within region of interest are modeled as a piecewise function of height difference before drop deposition. Model coefficients are experimentally obtained and validated with bootstrapping of experimental samples. Six different drop patterns are experimentally validated. The RMS height profile errors for 2D patterns from the proposed model are consistently smaller than existing models from literature and are on the same level as 1D patterns reported in our previous publication.

This paper proposes a height profile model for drop-on-demand printing of UV curable ink. Existing models includesuperposition of single drops, numerical models, and graphic-based model. They are either too complicated or over simplified.Graphic model intends to find a sweet spot in between, however, accuracy is marginally improved from superposition modelwhile it demands more computation. The proposed model aimsto achieve the same as graphic model by introducing volumeand area propagation matrices to reflect the localized ink flowfrom higher location to the lower, while avoiding the detailedphysics behind it. This model assumes a constant volume andarea propagation of subsequent drop due to height profile difference. It is validated with experiments on single drop, 2-drop and 3-drop line printing. Stability of this model is analyzed.. Usingroot mean square (RMS) error as benchmark, proposed modelachieves 6.6% along the center row and 7.4% overall, better thanexisting models.

This paper proposes an improved model of height profile for drop-on-demand printing of UV curable ink. Unlike previous model, the proposed model propagates volume and covered area based on height difference between adjacent drops. Height profile is then calculated from the propagated volume and area. Measurements of 2-drop and 3-drop patterns are used to experimentally compute model parameters. The parameters are used to predict and validate height profiles of 4 and more drops in a straight line. Using the same root mean square (RMS) error as benchmark, this model achieves 5.9% RMS height profile error on 4-drop lines. This represents more than 60% reduction from graph-based model and an improvement from our previous effort.

Identifying a linear system model from data has wide applications in control theory. The existing work on finite sample analysis for linear system identification typically uses data from a single system trajectory under i.i.d random inputs, and assumes that the underlying dynamics is truly linear. In contrast, we consider the problem of identifying a linearized model when the true underlying dynamics is nonlinear. We provide a multiple trajectories-based deterministic data acquisition algorithm followed by a regularized least squares algorithm, and provide a finite sample error bound on the learned linearized dynamics. Our error bound demonstrates a trade-off between the error due to nonlinearity and the error due to noise, and shows that one can learn the linearized dynamics with arbitrarily small error given sufficiently many samples. We validate our results through experiments, where we also show the potential insufficiency of linear system identification using a single trajectory with i.i.d random inputs, when nonlinearity does exist., Comment: 8 pages, 3 figures, IEEE Conference on Decision and Control, 2023

While no known asteroid poses a threat to Earth for at least the next century, the catalog of near-Earth asteroids is incomplete for objects whose impacts would produce regional devastation. Several approaches have been proposed to potentially prevent an asteroid impact with Earth by deflecting or disrupting an asteroid. A test of kinetic impact technology was identified as the highest priority space mission related to asteroid mitigation. NASA's Double Asteroid Redirection Test (DART) mission is the first full-scale test of kinetic impact technology. The mission's target asteroid was Dimorphos, the secondary member of the S-type binary near-Earth asteroid (65803) Didymos. This binary asteroid system was chosen to enable ground-based telescopes to quantify the asteroid deflection caused by DART's impact. While past missions have utilized impactors to investigate the properties of small bodies those earlier missions were not intended to deflect their targets and did not achieve measurable deflections. Here we report the DART spacecraft's autonomous kinetic impact into Dimorphos and reconstruct the impact event, including the timeline leading to impact, the location and nature of the DART impact site, and the size and shape of Dimorphos. The successful impact of the DART spacecraft with Dimorphos and the resulting change in Dimorphos's orbit demonstrates that kinetic impactor technology is a viable technique to potentially defend Earth if necessary., Comment: Accepted by Nature

We consider the problem of learning the dynamics of a linear system when one has access to data generated by an auxiliary system that shares similar (but not identical) dynamics, in addition to data from the true system. We use a weighted least squares approach, and provide finite sample error bounds of the learned model as a function of the number of samples and various system parameters from the two systems as well as the weight assigned to the auxiliary data. We show that the auxiliary data can help to reduce the intrinsic system identification error due to noise, at the price of adding a portion of error that is due to the differences between the two system models. We further provide a data-dependent bound that is computable when some prior knowledge about the systems, such as upper bounds on noise levels and model difference, is available. This bound can also be used to determine the weight that should be assigned to the auxiliary data during the model training stage., Comment: 15 pages,9 figures

We study the problem of estimating an unknown parameter in a distributed and online manner. Existing work on distributed online learning typically either focuses on asymptotic analysis, or provides bounds on regret. However, these results may not directly translate into bounds on the error of the learned model after a finite number of time-steps. In this paper, we propose a distributed online estimation algorithm which enables each agent in a network to improve its estimation accuracy by communicating with neighbors. We provide non-asymptotic bounds on the estimation error, leveraging the statistical properties of the underlying model. Our analysis demonstrates a trade-off between estimation error and communication costs. Further, our analysis allows us to determine a time at which the communication can be stopped (due to the costs associated with communications), while meeting a desired estimation accuracy. We also provide a numerical example to validate our results., Comment: 9 pages, 1 figure, 2022 Conference on Decision and Control (CDC)

We study the problem of identifying the dynamics of a linear system when one has access to samples generated by a similar (but not identical) system, in addition to data from the true system. We use a weighted least squares approach and provide finite sample performance guarantees on the quality of the identified dynamics. Our results show that one can effectively use the auxiliary data generated by the similar system to reduce the estimation error due to the process noise, at the cost of adding a portion of error that is due to intrinsic differences in the models of the true and auxiliary systems. We also provide numerical experiments to validate our theoretical results. Our analysis can be applied to a variety of important settings. For example, if the system dynamics change at some point in time (e.g., due to a fault), how should one leverage data from the prior system in order to learn the dynamics of the new system? As another example, if there is abundant data available from a simulated (but imperfect) model of the true system, how should one weight that data compared to the real data from the system? Our analysis provides insights into the answers to these questions., Comment: 7 pages, 3 figuers, 2022 American Control Conference (ACC)

We consider the problem of learning the dynamics of autonomous linear systems (i.e., systems that are not affected by external control inputs) from observations of multiple trajectories of those systems, with finite sample guarantees. Existing results on learning rate and consistency of autonomous linear system identification rely on observations of steady state behaviors from a single long trajectory, and are not applicable to unstable systems. In contrast, we consider the scenario of learning system dynamics based on multiple short trajectories, where there are no easily observed steady state behaviors. We provide a finite sample analysis, which shows that the dynamics can be learned at a rate $\mathcal{O}(\frac{1}{\sqrt{N}})$ for both stable and unstable systems, where $N$ is the number of trajectories, when the initial state of the system has zero mean (which is a common assumption in the existing literature). We further generalize our result to the case where the initial state has non-zero mean. We show that one can adjust the length of the trajectories to achieve a learning rate of $\mathcal{O}(\sqrt{\frac{\log{N}}{N})}$ for strictly stable systems and a learning rate of $\mathcal{O}(\frac{(\log{N})^d}{\sqrt{N}})$ for marginally stable systems, where $d$ is some constant., Comment: 8 pages, 2022 American Control Conference (ACC)