Sheng Liu

Sheng Liu

Auto-generated profile, based on publicly available information

Sheng Liu

School of Mathematics and Computational Science, the Key Laboratory of Credible Intelligent Navigation and Positioning of Hunan Province, and the School of Automation and Electronic Information, Xiangtan University, Xiangtan, China

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
22 December 2023 in Automotive Innovation
Verified
Journal Article
Closed access
PDF file
DSDehua Shi
Dehua Shi
SLSheng Liu
Sheng Liu
Yujie ShenYujie Shen
Yujie Shen
SWShaohua Wang
Shaohua Wang
CYChaochun Yuan
Chaochun Yuan
LCLong Chen
Long Chen

14 October 2024 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
SLSheng Liu
Sheng Liu
Zhiqiang YaoZhiqiang Yao
Zhiqiang Yao
XCXuemeng Cao
Xuemeng Cao
XCXiaowen Cai
Xiaowen Cai
MSMenggang Sheng
Menggang Sheng
Context-adaptive navigation (CAN) systems enable seamless navigation in complex environments by identifying the surrounding contexts of ground vehicles. Developing a fast, reliable, and robust navigational context recognition (NCR) method is crucial for the effective operation of CAN systems. However, most existing context recognition approaches focus on coarse binary or quaternary indoor/outdoor detection, which is not tailored to the specific needs of CAN applications. In this paper, we propose a fine-grained context categorization framework consisting of seven environment categories for vehicle navigation, representing the most elaborate context categorization framework in this research domain. To address the inter-class confusion resulting from the increased number of categories, a novel feature is devised by utilizing the carrier-power to noise-density ratio ( C / N 0) and azimuth derived from Global Navigation Satellite System (GNSS) measurements. Additionally, a low-complexity algorithm is developed to extract this feature efficiently. Furthermore, to ensure real-time performance, we employ a lightweight gated recurrent unit (GRU) network for its superior sequence data processing capabilities. A dataset containing 120,436 samples is created and made publicly available. Extensive experiments conducted on this dataset demonstrate that our proposed method achieves an overall recognition accuracy of 99.43% for isolated scenarios and 95.24% for transition scenarios, with an average transition delay of 1.37 seconds.

29 October 2021 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
PDF file
HZHuijie Zhu
Huijie Zhu
SLSheng Liu
Sheng Liu
ZYZhiqiang Yao
Zhiqiang Yao
MOMoses Chukwuka Okonkwo
Moses Chukwuka Okonkwo
ZPZheng Peng
Zheng Peng
Source localisation is an important component in the application of wireless sensor networks, and plays a key role in environmental monitoring, healthcare and battlefield surveillance and so on. In this article, the source localisation problem based on time-of-arrival measurements in asynchronous sensor networks is studied. Because of imperfect time synchronisation between the anchor nodes and the signal source node, the unknown parameter of start transmission time of signal source makes the localisation problem further sophisticated. The derived maximum-likelihood estimator cost function with multiple local minimum is non-linear and non-convex. A novel two-step method which can solve the global minimum is proposed. First, by leveraging dimensionality reduction, the maximum (minimum) distance maximum (minimum) time-of-arrival matching-based second-order Monte Carlo method is applied to find a rough initial position of the signal source with low computational complexity. Then, the rough initial position value is refined using trust region method to obtain the final positioning result. Comparative analysis with state-of-the-art semidefinite programming and min–max criterion-based algorithms are conducted. Simulations show that the proposed method is superior in terms of localisation accuracy and computational complexity, and can reach the optimality benchmark of Cramér–Rao Lower Bound even in high signal-to-noise ratio environments.