Duān-hiàn Yáng Yuán-Ruì

Dr. Duān-hiàn Yáng Yuán-Ruì

orcid

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
23 October 2025 in Knowledge-Based Systems
Verified
Journal Article
Closed access
PLPeng Lin
Peng Lin
YWYafei Wang
Yafei Wang
YLYuanyuan Li
Yuanyuan Li
DYDuān-hiàn Yáng Yuán-Ruì
Duān-hiàn Yáng Yuán-Ruì
XFXianping Fu
Xianping Fu

29 September 2023 in IEEE Transactions on Image Processing
Verified
Journal Article
Closed access
RSRui She
Rui She
QKQiyu Kang
Qiyu Kang
SWSijie Wang
Sijie Wang
DYDuān-hiàn Yáng Yuán-Ruì
Duān-hiàn Yáng Yuán-Ruì
KZKai Zhao
Kai Zhao
WTWee Peng Tay
Wee Peng Tay
For autonomous vehicles (AVs), visual perception techniques based on sensors like cameras play crucial roles in information acquisition and processing. In various computer perception tasks for AVs, it may be helpful to match landmark patches taken by an onboard camera with other landmark patches captured at a different time or saved in a street scene image database. To perform matching under challenging driving environments caused by changing seasons, weather, and illumination, we utilize the spatial neighborhood information of each patch. We propose an approach, named RobustMat , which derives its robustness to perturbations from neural differential equations. A convolutional neural ODE diffusion module is used to learn the feature representation for the landmark patches. A graph neural PDE diffusion module then aggregates information from neighboring landmark patches in the street scene. Finally, feature similarity learning outputs the final matching score. Our approach is evaluated on several street scene datasets and demonstrated to achieve state-of-the-art matching results under environmental perturbations.

18 March 2025 in Displays
Verified
Journal Article
Closed access
PLPeng Lin
Peng Lin
ZFZihao Fan
Zihao Fan
YWYafei Wang
Yafei Wang
Xudong SunXudong Sun
Xudong Sun
DYDuān-hiàn Yáng Yuán-Ruì
Duān-hiàn Yáng Yuán-Ruì
XFXianping Fu
Xianping Fu

2 December 2025 in Optics and Lasers in Engineering
Verified
Journal Article
Closed access
PLPeng Lin
Peng Lin
YWYafei Wang
Yafei Wang
ZWZhendong Wang
Zhendong Wang
NCNan Cao
Nan Cao
DYDuān-hiàn Yáng Yuán-Ruì
Duān-hiàn Yáng Yuán-Ruì
XFXianping Fu
Xianping Fu

16 September 2022 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
DYDuān-hiàn Yáng Yuán-Ruì
Duān-hiàn Yáng Yuán-Ruì
PCPeter C.Y. Chen
Peter C.Y. Chen
We propose a novel reactive algorithm for a multi-robot formation navigating from its starting point to its destination in geometrically changing non-convex environments containing dynamic obstacles that move stochastically. Taking formation’s buffer into consideration, the proposed algorithm estimates the optimal velocity by means of minimizing collision threats from obstacles to the formation. It considers the obstacles in pairs so that the formation crosses the gap between every involved pair of obstacles. At every time step, this algorithm is executed in four phases: 1) optimal velocity estimation using a probabilistic model; 2) topological trajectory decision; 3) optimal waypoint (crossing point) determination; and 4) real-time optimal velocity determination. Compared to existing algorithms, the simulation shows that our algorithm is robust and has significant improvement. Note to Practitioners —This paper was motivated by the problem of formation navigation in places containing a large number of moving objects such as human beings and other vehicles. Existing approaches either do not forecast the probability of collision, or do not explicitly consider a certain comfort or safety distance to maintain. This paper quantifies the expectation of objects getting “too close” to the formation before collision as a numerical collision forecast, where the future motions of objects are unknown: this allows a formation to navigate by acquiring least environment information. From this expectation, by considering the formation to be moving between pairs of these objects, the optimal path to the destination for the formation is computed. Our approach is proved by the simulation to have significant improvement compared to the existing approaches. In future research, we will consider more ways to avoid obstacles such as formation rotation and waiting.

29 December 2022 in Sensors
Verified
Journal Article
Open access
PDF file
DYDuān-hiàn Yáng Yuán-Ruì
Duān-hiàn Yáng Yuán-Ruì
QKQiyu Kang
Qiyu Kang
RSRui She
Rui She
For the area coverage (e.g., using a WSN), despite the comprehensive research works on full-plane coverage using a multi-node team equipped with the ideal constant model, only very few works have discussed the coverage of practical models with varying intensity. This paper analyzes the properties of the effective coverage of multi-node teams consisting of a given numbers of nodes. Each node is equipped with a radial attenuation disk model as its individual model of coverage, which conforms to the natural characteristics of devices in the real world. Based on our previous analysis of 2-node teams, the properties of the effective coverage of 3-node and n-node (n≥4) teams in regular geometric formations are analyzed as generalized cases. Numerical analysis and simulations for 3-node and n-node teams (n≥4) are conducted separately. For the 3-node cases, the relations between the side lengths of equilateral triangle formation and the effective coverage of the team equipped with two different types of models are respectively inspected. For the n-node cases (n≥4), the effective coverage of a team in three formations, namely regular polygon, regular star, and equilateral triangular tessellation (for n=6), are investigated. The results can be applied to many scenarios, either dynamic (e.g., robots with sensors) or static, where a team of multiple nodes cooperate to produce a larger effective coverage.