| Literature DB >> 35265167 |
Abstract
Particle crowd algorithmic rule is a mayor examination hotspot in the authentic optimization algorithmic rule respond. Based on the PSO algorithmic rule to make optimal the RBFNN example, an amended order of nonlinear adaptable laziness power supported on the contest of population variegation is intended to extend the fixedness of population unlikeness performance and hunt capabilities to preclude the algorithmic rule from dripping into a topical extreme point prematurely, thereby further improving the prophecy correctness. Simulation experience shows that the amended PSO-RBFNN standard has open advantageous in the fixedness and sharp convergency of the prognosis proceed. In fashion to reprove the justness of reverse kinematics of robots with composite make and supercilious degrees of liberty, an amended adaptative suffix abound optimization (IAPSO) is spoken. First, the motoric equality of the 6-DOF strength-example avaricious robot design is established by the amended DH (Denavit-Hartenberg) argument course; second, on the base of the existent morsel abound algorithmic rule, the population Manhattan ceremoniousness is interested to lead the maneuver condition of the population in aqiqiy measure. And bound the adaptative lore substitute accordingly to the dissimilar maneuver possession and then adopt distinct site and hurry update modes; lastly, the fitness province with handicap substitute is present to trial the honest-prick and extended course transposition of the robot mold, and the delusion is not joint product major than 0.005 rad. The feint inference shows that the established kinematics shape is chasten, and the amended algorithmic program captures into recital the nicety, uniqueness, and velocity of the inverted resolution of the existent PSO algorithmic program, as well as higher deliverance truths. We conduct an experiment on the Brazilian jiu-jitsu. The results have clearly shown the advantage of our method.Entities:
Mesh:
Year: 2022 PMID: 35265167 PMCID: PMC8901310 DOI: 10.1155/2022/2474951
Source DB: PubMed Journal: Comput Math Methods Med ISSN: 1748-670X Impact factor: 2.238
Figure 1Key steps of our method.
Figure 2The iterative solution of our method.
Figure 3Key steps of the particle swarm.
Figure 4Key steps of particle swarm Eq. (7).
Figure 5Optimization path of particle swarm.
Performance decrement (-)/increment (+) of different algorithms on [7].
| Settings | S11 | S12 | S13 | S14 |
|---|---|---|---|---|
| Accuracy | -4.87% | -3.54% | -4.54% | -4.21% |
Figure 6Our Brazilian jiu-jitsu data set.
Performance decrement (-)/increment (+) of different algorithms on our adopted data set.
| Settings | S11 | S12 | S13 | S14 |
|---|---|---|---|---|
| Accuracy | -4.35% | -3.54% | -3.53% | -4.36% |
Performance decrement (-)/increment (+) of different algorithms on [10].
| Settings | S11 | S12 | S13 | S14 |
|---|---|---|---|---|
| Accuracy | -4.09% | -2.43% | -3.32% | -3.76% |
Performance decrement (-)/increment (+) of different algorithms on [13].
| Settings | S11 | S12 | S13 | S14 |
|---|---|---|---|---|
| Accuracy | -5.11% | -4.35% | -4.34% | -4.43% |
Accuracy decrement (-)/increment (+) and time cost of different algorithms on our adopted data set.
| Settings | S21 | S22 | S23 | Ours |
|---|---|---|---|---|
| Accuracy | -16.54% | -13.33% | -6.57% | n/a |
| Time | 21m5s | 6m16s | 13m6s | 6m43s |
Accuracy decrement (-)/increment (+) and time cost of different algorithms on [7].
| Settings | S21 | S22 | S23 | Ours |
|---|---|---|---|---|
| Accuracy | -16.54% | -17.54% | -9.33% | n/a |
| Time | 13m27s | 6m33s | 6m32s | 7m16s |
Accuracy decrement (-)/increment (+) and time cost of different algorithms on [10].
| Settings | S21 | S22 | S23 | Ours |
|---|---|---|---|---|
| Accuracy | -13.43% | -21.22% | -9.56% | n/a |
| Time | 21m14s | 7m21s | 6m21s | 7m43s |
Accuracy decrement (-)/increment (+) and time cost of different algorithms on [13].
| Settings | S21 | S22 | S23 | Ours |
|---|---|---|---|---|
| Accuracy | -14.44% | -16.57% | -8.49% | n/a |
| Time | 9m16s | 16m32s | 8m32s | 6m32s |
The accuracy of image retrieval using different distance measure on our data set.
| Distance measure | Accuracy |
|---|---|
| Euclidean distance | 0.5465 |
| Cosine distance | 0.4543 |
| Manhattan distance | 0.6676 |
| Minkowski distance | 0.9121 |
The accuracy of image retrieval using different distance measure on [13].
| Distance measure | Accuracy |
|---|---|
| Euclidean distance | 0.6576 |
| Cosine distance | 0.5568 |
| Manhattan distance | 0.7121 |
| Minkowski distance | 0.8436 |