Lingyi Zhang

dblp:47/2657 · DBLP profile ↗
← Back
6ranked-venue papers in the field
1as first author
3since 2021 · last 2025
—ORCID · conflict

Domains — venue-derived; a paper can count in several

Other / Interdisciplinary · 5 (1 first)Database Systems & Data Management · 1
YearPublicationVenuePosition
2025 A Computational Framework for Estimating Days of Maintenance Delay of Naval Ships
Gerald White, Deep Mistry, Kevin Chhoa, Senjuti Basu Roy, Lingyi Zhang, Adam Bienkowski, Krishna R. Pattipati
EDBT5
2023 Computational Algorithms for Acoustic Signals Direction of Arrival and Sound Speed Estimation
abstract
This paper develops computationally efficient algorithms for the analysis of acoustic data to localize a target through improved angle of arrival estimation. The passive target localization problem has a wide range of applications in wireless communication, navigation, acoustic sensor networks, indoor localization, to name a few. We have focused on novel formulations and solution methods for target localization using Time Differences of Arrival (TDOA) among distinct pairs of passive sensor nodes in an acoustic sensor network with known sensor positions.
Chris Norton, Ryan Harvey, Peter Willett 0001, Lingyi Zhang, Krishna R. Pattipati
FUSION5
2021 A Single-pass Noise Covariance Estimation Algorithm in Adaptive Kalman Filtering for Non-stationary Systems
Hee-Seung Kim, Lingyi Zhang, Adam Bienkowski, Krishna R. Pattipati
FUSION2
2018 Path Planning in an Uncertain Environment Using Approximate Dynamic Programming Methods
abstract
Routing in uncertain environments is challenging as it involves a number of contextual elements, such as different environmental conditions (forecast realizations with varying spatial and temporal uncertainty), changes in mission goals while en route, and asset status. In this paper, we use an approximate dynamic programming method with Q-factors to determine a cost-to-go approximation by treating the weather forecast realization information as a stochastic state. These types of algorithms take a large amount of offline computation time to determine the cost-to-go approximation, but once obtained, the online route recommendation is nearly instantaneous and several orders of magnitude faster than previously proposed ship routing algorithms. The proposed algorithm is robust to the uncertainty present in the weather forecasts. We compare this algorithm to a well-known shortest path algorithm and apply the approach to a real-world shipping tragedy using weather forecast realizations available prior to the event.
Adam Bienkowski, David Sidoti, Lingyi Zhang, Krishna R. Pattipati, Charles R. Sampson, James A. Hansen
FUSION3
2016 Approaches for solving m-best 3-dimensional dynamic scheduling problems for large m
Lingyi Zhang, David Sidoti, Krishna R. Pattipati, David A. Castañón
FUSION1
2015 Dynamic resource management and information integration for proactive decision support and planning
Manisha Mishra, David Sidoti, Diego Fernando Martinez Ayala, Xu Han 0001, Gopi Vinod Avvari, Lingyi Zhang, Krishna R. Pattipati, Woosun An, James A. Hansen, David L. Kleinman
FUSION6