(Georgia Institute of Technology, 2010-12)
Lu, Yibiao; Huo, Xiaoming; Tsiotras, Panagiotis
We consider the deterministic path-planning problem
dealing with the single-pair shortest path on a given graph.
We propose a multiscale version of the well known A* algorithm
(m-A*), which utilizes information of the environment at
distinct scales. This information is collected via a bottom-up
fusion method. Comparing with existing algorithms such as
Dijkstra’s or A*, the use of multiscale information leads to an
improvement in terms of computational complexity.
(Georgia Institute of Technology, 2004)
Jeong, Myong-Kee; Lu, Jye-Chyi; Huo, Xiaoming; Vidakovic, Brani; Chen, Di
To handle potentially large and complicated nonstationary data curves, this article presents new data reduction methods based on the discrete wavelet transform. The methods minimize objective functions to balance the tradeoff between data reduction and modeling accuracy. Theoretic investigations provide the optimality of the methods and the large-sample distribution of a closedform estimate of the thresholding parameter. An upper bound of errors in signal approximation (or estimation) is derived. Based on evaluation studies with popular testing curves and real-life data sets, the proposed methods demonstrate their competitiveness to the existing engineering data-compression and statistical data-denoising methods for achieving the data reduction goals. Further experimentation with a tree-based classification procedure for identifying process fault classes illustrates the potential of the data-reduction tools. Extension of the engineering scalogram to the reduced-size semiconductor fabrication data leads to a visualization tool for monitoring and understanding process problems.