Research Appraisals
Evidence-based critical appraisals of the latest medical research, systematically evaluated using Oxford CEBM methodology.
Showing 3 appraisals
PloS one
Trajectory planning method for pipeline installation robots based on AS-DTRRT
Pipeline installation robots install pipelines on both sides of mine roadways using robotic arms; the geometric shape and length of the pipelines affect the movement trajectory of the robotic arms, and the working environment is complex and changeable. Aiming at the issues of the mechanical arm's long motion trajectory, low installation efficiency, and pipeline collision vulnerability during installation, a trajectory planning method based on the improved dual-tree RRT algorithm (AS-DTRRT) is proposed. Taking the pipeline installation robot with a 6-degree-of-freedom Cartesian coordinate robotic arm as the research object, the Artificial Potential Field method is introduced to guide the growth direction of new nodes in the path of the dual-tree RRT algorithm; aiming at the problem that the Artificial Potential Field method is prone to falling into local optimality, an adaptive step-size dynamic environment bias strategy is proposed, which automatically adjusts the step size according to the environmental conditions of the position where the new node is located to further improve the path search capability. This study analyzes the influence of pipeline geometry and length on the robotic arm's working space, proposes a pipeline collision avoidance strategy considering the working environment, and applies quintic polynomial interpolation to plan the trajectory of collision-free paths while considering joint speed and acceleration constraints. Simulations and platform experiments comparing AS-DTRRT with RRT*, D-RRT, Bi-RRT*, and A-RRT validate the method's feasibility, demonstrating that AS-DTRRT outperforms the four algorithms by reducing actual runtime by 20.22%, 15.48%, 4.69%, and 16.47% and shortening average path lengths by 21.17%, 13.78%, 6.85%, and 9.24% respectively. The proposed method enhances search efficiency and reduces path lengths, providing an effective approach for trajectory planning of pipeline installation robots.
24 May 2026
Read appraisal →PloS one
A load forecasting method based on edge graph attention network.
Given the increasing demand for high-accuracy power load forecasting, traditional load forecasting methods can capture long-term dependencies in time series, but cannot fully capture the complex relationships between multi-dimensional features. This paper proposes an innovative method to convert time series data into graph features. By constructing a graph structure based on time nodes, the time series forecasting problem is transformed into a graph-based load forecasting problem. On this basis, the Edge Graph Attention Network (EGAT) is used to combine the feature information of nodes and edges to further enhance the ability to represent feature interactions and improve the accuracy of load forecasting. This paper compares the EGAT model with common load forecasting methods, including gated recurrent units (GRU), multi-layer perceptron networks (MLP) and long short-term memory (LSTM). The results show that EGAT is effective at finding important features and understanding complex time patterns, which means it shows strong potential in predicting energy demand. A limitation of the proposed approach is its increased computational cost introduced by graph construction and attention-based aggregation, which may raise training time and memory usage for large-scale graphs. In addition, the forecasting performance can be influenced by the design of the time-series graph (e.g., connectivity patterns) and the availability/quality of edge features.
27 Apr 2026
Read appraisal →PloS one
Topology-aware design of spiking neural networks via modular graph architectures
Spiking Neural Networks (SNNs) offer a biologically plausible and energy-efficient alternative to traditional artificial neural networks (ANNs), yet their design remains constrained by limited architectural flexibility and slow training dynamics. In this work, we introduce a novel SNN framework that leverages modular graph-based topologies and explicit synaptic delays to significantly enhance both training efficiency and classification performance. Our architecture, TANet-Tiny, incorporates structured graph stages with up to 32 nodes and diverse community-driven connectivity patterns derived from KMeans clustering, Louvain modularity, and Watts-Strogatz small-world models. We integrate these topologies into a topology-aware search space and explore them via a Spatio-Temporal Topology Sampling (STTS) approach, enabling the discovery of high-performing networks without exhaustive search. Experimental results on MNIST, CIFAR-10, and CIFAR-100 demonstrate that our modular designs achieve state-of-the-art accuracy while requiring 6-10 × fewer training epochs, with top-1 accuracy reaching 99.57% on MNIST and over 92% on CIFAR-10, all with reduced parameter counts. We introduce an accuracy-per-epoch metric to quantify training efficiency and show that modularity, rather than network size, is the critical driver of performance. This work lays the groundwork for scalable, interpretable, and low-latency SNN architectures suitable for deployment in neuromorphic and edge computing environments.
12 Apr 2026
Read appraisal →