Hybrid Learning Algorithm of Radial Basis Function Networks for Reliability Analysis
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
With the wide application of industrial robots in the field of precision machining, reliability analysis of positioning accuracy becomes increasingly important for industrial robots. Since the industrial robot is a complex nonlinear system, the traditional approximate reliability methods often produce unreliable results in analyzing its positioning accuracy. In order to study the positioning accuracy reliability of industrial robot more efficiently and accurately, a radial basis function network is used to construct the mapping relationship between the uncertain parameters and the position coordinates of the end-effector. Combining with the Monte Carlo simulation method, the positioning accuracy reliability is then evaluated. A novel hybrid learning algorithm for training radial basis function network, which integrates the clustering learning algorithm and the orthogonal least squares learning algorithm, is proposed in this article. Examples are presented to illustrate the high proficiency and reliability of the proposed method.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
An efficient k-means clustering algorithm: analysis and implementation
Kanungo, T., Mount, D. M., Netanyahu, N. S., Piatko, C. D., Silverman, R., & Wu, A. Y. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1017616 · Cited by 5,660
Metadata
- Authors
- Zhang, D., Zhang, N., Ye, N., Fang, J., & Han, X.
- Venue
- IEEE Transactions on Reliability
- Published
- 2021-09
- Volume
- 70
- Issue
- 3
- Pages
- 887-900
- ISSN
- 0018-9529 (ISSN-L)
- 1558-1721
- OpenAlex
- W3044937396
- Cited by
- 169
- References
- 1
- FWCI
- 8.81
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.