ArticleScientific reports2025
Machine learning modeling and multi objective optimization of artificial detrusor.
Article in Scientific reports, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
1 citing paper in PubMed.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
2 authors.
Funding
Abstract
To address the problem of obtaining optimal design parameters for existing artificial detrusors using single-objective optimization methods, this research proposed a machine learning-based artificial detrusor modeling and multi-objective optimization approach, which includes a thorough process from modeling to optimization. Extreme learning machine was used to model artificial detrusors in the suggested approach, and in order to increase modeling accuracy, a multi-strategy modified crayfish optimization algorithm for tuning the extreme learning machine's parameters was put forth in this research. The multi-objective grey wolf optimization algorithm was utilized to optimize the artificial detrusor based on the model. In order to validate the suggested approach, an artificial detrusor driven by a shape memory spring was finally built as an experimental platform. The results show that the improved crayfish optimization algorithm proposed in this paper can effectively avoid the defects of the original algorithm, and its optimization performance and convergence ability are better than the comparison algorithm. With a root mean square error of 1.51E-02, a coefficient of determination of 9.81E-01, a mean absolute error of 1.32E-02, and a mean absolute percentage error of 1.66E-01, the established artificial detrusor model predicts the shape memory spring-driven artificial detrusor's emptying rate. It also predicts the temperature increment with a root mean square error of 8.47E-01, a coefficient of determination of 9.81E-01, a mean absolute error of 5.81E-01, and a mean absolute percentage error of 7.23E-02. These predictions are superior to the comparison prediction model, indicating good predictive performance and stability. Additionally, the established artificial detrusor model also demonstrates outstanding performance in uncertainty and reliability analysis, thereby further confirming its superior comprehensive performance. The optimized artificial detrusor's computed values of emptying rate and temperature increment, as well as its experimental measurement values, have errors of 7.8% and 11.8%, respectively, which satisfy engineering design specifications. The artificial detrusor optimized by our proposed method exhibits significant performance enhancements over existing designs. Specifically, the optimized detrusor achieves an approximately 20% increase in emptying rate and a 62% reduction in temperature increment, successfully balancing urinary efficiency with mitigated risks of thermal tissue injury.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.