[go: up one dir, main page]

 
 
Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Journals

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Article Types

Countries / Regions

remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline
remove_circle_outline

Search Results (6,895)

Search Parameters:
Keywords = iterative method

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
37 pages, 6083 KiB  
Article
MISAO: A Multi-Strategy Improved Snow Ablation Optimizer for Unmanned Aerial Vehicle Path Planning
by Cuiping Zhou, Shaobo Li, Cankun Xie, Panliang Yuan and Xiangfu Long
Mathematics 2024, 12(18), 2870; https://doi.org/10.3390/math12182870 (registering DOI) - 14 Sep 2024
Abstract
The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article [...] Read more.
The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article suggests a multi-strategy improved (MISAO) snow ablation optimizer. It is employed in the unmanned aerial vehicle (UAV) path planning issue. To begin with, the tent chaos and elite reverse learning initialization strategies are merged to extend the diversity of the population; secondly, a greedy selection method is deployed to retain superior alternative solutions for the upcoming iteration; then, the Harris hawk (HHO) strategy is introduced to enhance the exploitation capability, which prevents trapping in partial ideals; finally, the red-tailed hawk (RTH) is adopted to perform the global exploration, which, enhances global optimization capability. To comprehensively evaluate MISAO’s optimization capability, a battery of digital optimization investigations is executed using 23 test functions, and the results of the comparative analysis show that the suggested algorithm has high solving accuracy and convergence velocity. Finally, the effectiveness and feasibility of the optimization path of the MISAO algorithm are demonstrated in the UAV path planning project. Full article
Show Figures

Figure 1

Figure 1
<p>Taxonomy of meta-heuristic algorithms and representative algorithms.</p>
Full article ">Figure 2
<p>Melting and sublimation process of SAO algorithm.</p>
Full article ">Figure 3
<p>Schematic diagram of the cross term.</p>
Full article ">Figure 4
<p>Distribution of tent chaos mapping.</p>
Full article ">Figure 5
<p>MISAO flowchart.</p>
Full article ">Figure 6
<p>Convergence process of different algorithms.</p>
Full article ">Figure 7
<p>Convergence process of different strategies.</p>
Full article ">Figure 8
<p>Runtime line chart.</p>
Full article ">Figure 9
<p>Friedman cumulative value.</p>
Full article ">Figure 10
<p>Terrain environment with mountain peaks.</p>
Full article ">Figure 11
<p>Path planning diagram of different algorithms.</p>
Full article ">Figure 12
<p>3D and plan view of path planning with different algorithms.</p>
Full article ">
27 pages, 4032 KiB  
Article
Multi-Feature Extraction and Selection Method to Diagnose Burn Depth from Burn Images
by Xizhe Zhang, Qi Zhang, Peixian Li, Jie You, Jingzhang Sun and Jianhang Zhou
Electronics 2024, 13(18), 3665; https://doi.org/10.3390/electronics13183665 (registering DOI) - 14 Sep 2024
Abstract
Burn wound depth is a significant determinant of patient treatment. Typically, the evaluation of burn depth relies heavily on the clinical experience of doctors. Even experienced surgeons may not achieve high accuracy and speed in diagnosing burn depth. Thus, intelligent burn depth classification [...] Read more.
Burn wound depth is a significant determinant of patient treatment. Typically, the evaluation of burn depth relies heavily on the clinical experience of doctors. Even experienced surgeons may not achieve high accuracy and speed in diagnosing burn depth. Thus, intelligent burn depth classification is useful and valuable. Here, an intelligent classification method for burn depth based on machine learning techniques is proposed. In particular, this method involves extracting color, texture, and depth features from images, and sequentially cascading these features. Then, an iterative selection method based on random forest feature importance measure is applied. The selected features are input into the random forest classifier to evaluate this proposed method using the standard burn dataset. This method classifies burn images, achieving an accuracy of 91.76% when classified into two categories and 80.74% when classified into three categories. The comprehensive experimental results indicate that this proposed method is capable of learning effective features from limited data samples and identifying burn depth effectively. Full article
16 pages, 6029 KiB  
Article
FusionOpt-Net: A Transformer-Based Compressive Sensing Reconstruction Algorithm
by Honghao Zhang, Bi Chen, Xianwei Gao, Xiang Yao and Linyu Hou
Sensors 2024, 24(18), 5976; https://doi.org/10.3390/s24185976 (registering DOI) - 14 Sep 2024
Abstract
Compressive sensing (CS) is a notable technique in signal processing, especially in multimedia, as it allows for simultaneous signal acquisition and dimensionality reduction. Recent advancements in deep learning (DL) have led to the creation of deep unfolding architectures, which overcome the inefficiency and [...] Read more.
Compressive sensing (CS) is a notable technique in signal processing, especially in multimedia, as it allows for simultaneous signal acquisition and dimensionality reduction. Recent advancements in deep learning (DL) have led to the creation of deep unfolding architectures, which overcome the inefficiency and subpar quality of traditional CS reconstruction methods. In this paper, we introduce a novel CS image reconstruction algorithm that leverages the strengths of the fast iterative shrinkage-thresholding algorithm (FISTA) and modern Transformer networks. To enhance computational efficiency, we employ a block-based sampling approach in the sampling module. By mapping FISTA’s iterative process onto neural networks in the reconstruction module, we address the hyperparameter challenges of traditional algorithms, thereby improving reconstruction efficiency. Moreover, the robust feature extraction capabilities of Transformer networks significantly enhance image reconstruction quality. Experimental results show that the FusionOpt-Net model surpasses other advanced methods on various public benchmark datasets. Full article
(This article belongs to the Section Intelligent Sensors)
Show Figures

Figure 1

Figure 1
<p>FusionOpt-Net framework.</p>
Full article ">Figure 2
<p>Reconstruction results for butterfly and bird images using FusionOpt-Net and other methods. Sampling rates <math display="inline"><semantics> <mi>τ</mi> </semantics></math> are 0.04 for the first row and 0.25 for the second row. Please zoom in for better comparison.</p>
Full article ">Figure 3
<p>Noise Robustness Comparison. Visual analysis of different image CS methods on cactus and ship images from the BSD100 dataset at sampling rates <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>∈</mo> <mrow> <mn>0.04</mn> <mo>,</mo> <mn>0.10</mn> <mo>,</mo> <mn>0.25</mn> </mrow> </mrow> </semantics></math>. Gaussian noise with variances <math display="inline"><semantics> <mrow> <mi>σ</mi> <mo>∈</mo> <mrow> <mn>0.001</mn> <mo>,</mo> <mn>0.002</mn> <mo>,</mo> <mn>0.004</mn> </mrow> </mrow> </semantics></math> was introduced. Note the effectiveness in recovering the ship images.</p>
Full article ">Figure 4
<p>Comparison of the number of GFLOPs required to run a 256 × 256 pixel image in the model and the number of model parameters for <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>=</mo> <mn>0.1</mn> </mrow> </semantics></math>.</p>
Full article ">Figure 5
<p>Comparison of visualizations with and without momentum at different sampling rates <math display="inline"><semantics> <mrow> <mi>τ</mi> <mo>∈</mo> <mrow> <mn>0.04</mn> <mo>,</mo> <mn>0.25</mn> </mrow> </mrow> </semantics></math>.</p>
Full article ">
22 pages, 633 KiB  
Article
Two-Step Simplified Modulus-Based Matrix Splitting Iteration Method for Linear Complementarity Problems
by Ximing Fang
Symmetry 2024, 16(9), 1210; https://doi.org/10.3390/sym16091210 (registering DOI) - 14 Sep 2024
Abstract
A two-step simplified modulus-based matrix splitting iteration method is presented for solving the linear complementarity problem. According to general matrix splitting and special matrix splitting, a general convergence analysis and a specific convergence analysis are described, respectively. Numerical experiments show that the iteration [...] Read more.
A two-step simplified modulus-based matrix splitting iteration method is presented for solving the linear complementarity problem. According to general matrix splitting and special matrix splitting, a general convergence analysis and a specific convergence analysis are described, respectively. Numerical experiments show that the iteration method is effective and that the convergence theories are valid. Full article
16 pages, 1294 KiB  
Article
A Generalized Method for Deriving Steady-State Behavior of Consistent Fuzzy Priority for Interdependent Criteria
by Jih-Jeng Huang and Chin-Yi Chen
Mathematics 2024, 12(18), 2863; https://doi.org/10.3390/math12182863 (registering DOI) - 14 Sep 2024
Abstract
Interdependent criteria play a crucial role in complex decision-making across various domains. Traditional methods often struggle to evaluate and prioritize criteria with intricate dependencies. This paper introduces a generalized method integrating the analytic network process (ANP), the decision-making trial and evaluation laboratory (DEMATEL), [...] Read more.
Interdependent criteria play a crucial role in complex decision-making across various domains. Traditional methods often struggle to evaluate and prioritize criteria with intricate dependencies. This paper introduces a generalized method integrating the analytic network process (ANP), the decision-making trial and evaluation laboratory (DEMATEL), and the consistent fuzzy analytic hierarchy process (CFAHP) in a fuzzy environment. The Drazin inverse technique is applied to derive a fuzzy total priority matrix, and we normalize the row sum to achieve the steady-state fuzzy priorities. A numerical example in the information systems (IS) industry demonstrates the approach’s real-world applications. The proposed method derives narrower fuzzy spreads compared to the past fuzzy analytic network process (FANP) approaches, minimizing objective uncertainty. Total priority interdependent maps provide insights into complex technical and usability criteria relationships. Comparative analysis highlights innovations, including non-iterative convergence of the total priority matrix and the ability to understand interdependencies between criteria. The integration of the FANP’s network structure with the fuzzy DEMATEL’s influence analysis transcends the capabilities of either method in isolation, marking a significant methodological advancement. By addressing challenges such as parameter selection and mathematical complexity, this research offers new perspectives for future research and application in multi-attribute decision-making (MADM). Full article
Show Figures

Figure 1

Figure 1
<p>The structure of the proposed algorithm.</p>
Full article ">Figure 2
<p>The total priority interdependent maps.</p>
Full article ">
20 pages, 8565 KiB  
Article
Optimization of Operation Strategy of Multi-Islanding Microgrid Based on Double-Layer Objective
by Zheng Shi, Lu Yan, Yingying Hu, Yao Wang, Wenping Qin, Yan Liang, Haibo Zhao, Yongming Jing, Jiaojiao Deng and Zhi Zhang
Energies 2024, 17(18), 4614; https://doi.org/10.3390/en17184614 (registering DOI) - 14 Sep 2024
Abstract
The shared energy storage device acts as an energy hub between multiple microgrids to better play the complementary characteristics of the microgrid power cycle. In this paper, the cooperative operation process of shared energy storage participating in multiple island microgrid systems is researched, [...] Read more.
The shared energy storage device acts as an energy hub between multiple microgrids to better play the complementary characteristics of the microgrid power cycle. In this paper, the cooperative operation process of shared energy storage participating in multiple island microgrid systems is researched, and the two-stage research on multi-microgrid operation mode and shared energy storage optimization service cost is focused on. In the first stage, the output of each subject is determined with the goal of profit optimization and optimal energy storage capacity, and the modified grey wolf algorithm is used to solve the problem. In the second stage, the income distribution problem is transformed into a negotiation bargaining process. The island microgrid and the shared energy storage are the two sides of the game. Combined with the non-cooperative game theory, the alternating direction multiplier method is used to reduce the shared energy storage service cost. The simulation results show that shared energy storage can optimize the allocation of multi-party resources by flexibly adjusting the control mode, improving the efficiency of resource utilization while improving the consumption of renewable energy, meeting the power demand of all parties, and realizing the sharing of energy storage resources. Simulation results show that compared with the traditional PSO algorithm, the iterative times of the GWO algorithm proposed in this paper are reduced by 35.62%, and the calculation time is shortened by 34.34%. Compared with the common GWO algorithm, the number of iterations is reduced by 18.97%, and the calculation time is shortened by 22.31%. Full article
Show Figures

Figure 1

Figure 1
<p>Multi-microgrid island operation diagram.</p>
Full article ">Figure 2
<p>Schematic diagram of bi-level optimization decision-making model for islanded microgrid equipped with shared energy storage.</p>
Full article ">Figure 3
<p>Improved grey wolf algorithm flow chart.</p>
Full article ">Figure 4
<p>ADMM bargaining model flow chart.</p>
Full article ">Figure 5
<p>Output curve of each main body of microgrid I.</p>
Full article ">Figure 6
<p>Microgrid I load curve after optimization and adjustment.</p>
Full article ">Figure 7
<p>Microgrid I electric energy transaction diagram.</p>
Full article ">Figure 8
<p>The output curve of each main body of microgrid II.</p>
Full article ">Figure 9
<p>Microgrid II load optimization adjustment curve diagram.</p>
Full article ">Figure 10
<p>Microgrid II energy trading diagram.</p>
Full article ">Figure 11
<p>The output curve of each main body of the Microgrid III.</p>
Full article ">Figure 12
<p>Microgrid III load optimization adjustment curve diagram.</p>
Full article ">Figure 13
<p>Microgrid III electric energy transaction diagram.</p>
Full article ">Figure 14
<p>Microgrid I energy transaction optimization results.</p>
Full article ">Figure 15
<p>Microgrid II energy transaction optimization results.</p>
Full article ">Figure 16
<p>Microgrid III energy transaction optimization results.</p>
Full article ">Figure 17
<p>Charging and discharging power and power state of shared energy storage power station.</p>
Full article ">
22 pages, 13696 KiB  
Article
Evaluating the Geo-Environmental Conditions within a Working Face Using a Hybrid Intelligent Optimization Model
by Changfang Guo, Tingjiang Tan, Liuzhu Ma, Zhicong Zhang, Xiaoping Ma, Difei Zhao and Wenhua Jiao
Appl. Sci. 2024, 14(18), 8284; https://doi.org/10.3390/app14188284 (registering DOI) - 14 Sep 2024
Viewed by 196
Abstract
Geological anomalies within the working face likely induce geological disasters, such as water, gas, and coal mine roof fall, directly impacting the rational planning and safe mining of underground resources. Constrained by the conditions of underground closed spaces, effective reconstruction under incomplete and [...] Read more.
Geological anomalies within the working face likely induce geological disasters, such as water, gas, and coal mine roof fall, directly impacting the rational planning and safe mining of underground resources. Constrained by the conditions of underground closed spaces, effective reconstruction under incomplete and highly sparse projection is the central challenge when evaluating geo-environmental conditions. This work proposes a new hybrid intelligent optimization model (MPGA-SIRT) that integrates a multiple-population genetic algorithm (MPGA) with the simultaneous iterative reconstruction technique (SIRT) to finely reconstruct the geo-environmental conditions within a working face based on electromagnetic wave tomography theory. MPGA-SIRT can provide a more precise initial inversion model for the conventional linear reconstruction technique of SIRT, incorporating a local search property by leveraging the robust global search capacity of MPGA. The advantages of MPGA-SIRT have been demonstrated through numerical modeling, theoretical testing, and engineering practices on the 8208 working face in the Datong mining area, Shanxi Province. In comparison to individual SIRT inversion models, MPGA-SIRT reconstruction yields more accurate and stable performance, as demonstrated by the evolution curve of the objective function and the corresponding convergence tomography results. Consequently, the geomagnetic wave absorption coefficient within the area of reconstruction can be precisely ascertained through the use of our proposed technique. This innovation represents a groundbreaking strategy for assessing geological anomaly zones within a working face. The introduced method stands as a valuable theoretical instrument for confronting the complexities associated with geo-environmental reconstruction in underground engineering. Full article
(This article belongs to the Section Energy Science and Technology)
Show Figures

Figure 1

Figure 1
<p>The exploratory technology used to assess geo-environmental conditions within a working face.</p>
Full article ">Figure 2
<p>The schematic diagram of mesh discretization for electromagnetic wave tomography.</p>
Full article ">Figure 3
<p>Flow chart of the proposed MPGA-SIRT program.</p>
Full article ">Figure 4
<p>Distribution diagram of the model construction.</p>
Full article ">Figure 5
<p>Evolution curves of objective function f obtained based on different reconstruction models. (<b>a</b>) Evolution curve of objective function inversion based on the SIRT algorithm. (<b>b</b>) Evolution curve of objective function inversion based on the SGA-SIRT hybrid intelligent optimization algorithm. (<b>c</b>) Evolution curve of objective function inversion based on the MPGA-SIRT hybrid intelligent optimization algorithm.</p>
Full article ">Figure 5 Cont.
<p>Evolution curves of objective function f obtained based on different reconstruction models. (<b>a</b>) Evolution curve of objective function inversion based on the SIRT algorithm. (<b>b</b>) Evolution curve of objective function inversion based on the SGA-SIRT hybrid intelligent optimization algorithm. (<b>c</b>) Evolution curve of objective function inversion based on the MPGA-SIRT hybrid intelligent optimization algorithm.</p>
Full article ">Figure 6
<p>Tomography inversion results obtained using different reconstruction models. (<b>a</b>) Tomography inversion result obtained via the SIRT algorithm. (<b>b</b>) Tomography inversion result obtained via the SGA-SIRT algorithm. (<b>c</b>) Tomography inversion result obtained via the MPGA-SIRT algorithm.</p>
Full article ">Figure 7
<p>Evolution curves of objective function f obtained based on different reconstruction models with repeated tests. (<b>a</b>) Evolution curves of objective function based on SIRT with repeated tests. (<b>b</b>) Evolution curves of objective function based on SGA-SIRT with repeated tests. (<b>c</b>) Evolution curves of objective function based on MPGA-SIRT with repeated tests.</p>
Full article ">Figure 7 Cont.
<p>Evolution curves of objective function f obtained based on different reconstruction models with repeated tests. (<b>a</b>) Evolution curves of objective function based on SIRT with repeated tests. (<b>b</b>) Evolution curves of objective function based on SGA-SIRT with repeated tests. (<b>c</b>) Evolution curves of objective function based on MPGA-SIRT with repeated tests.</p>
Full article ">Figure 8
<p>Convergence results of objective function <span class="html-italic">f</span> obtained based on different reconstruction models with repeated tests.</p>
Full article ">Figure 9
<p>The distribution diagram of the 8208 working face survey area.</p>
Full article ">Figure 10
<p>Evolution curves of objective function obtained based on different reconstruction models for 8208 working face. (<b>a</b>) Evolution curve of objective function inversion based on SIRT algorithm. (<b>b</b>) Evolution curve of objective function inversion based on SGA-SIRT hybrid intelligent optimization algorithm. (<b>c</b>) Evolution curve of objective function inversion based on MPGA-SIRT hybrid intelligent optimization algorithm.</p>
Full article ">Figure 10 Cont.
<p>Evolution curves of objective function obtained based on different reconstruction models for 8208 working face. (<b>a</b>) Evolution curve of objective function inversion based on SIRT algorithm. (<b>b</b>) Evolution curve of objective function inversion based on SGA-SIRT hybrid intelligent optimization algorithm. (<b>c</b>) Evolution curve of objective function inversion based on MPGA-SIRT hybrid intelligent optimization algorithm.</p>
Full article ">Figure 11
<p>Tomography inversion results of the 8208 working face obtained using different reconstruction models. (<b>a</b>) Tomography inversion result obtained using the SIRT algorithm. (<b>b</b>) Tomography inversion result obtained using the SGA-SIRT algorithm. (<b>c</b>) Tomography inversion result obtained using the MPGA-SIRT algorithm.</p>
Full article ">Figure 12
<p>Evolution curves of objective function <span class="html-italic">f</span> obtained based on different reconstruction models with repeated tests for 8208 working face. (<b>a</b>) Evolution curves of objective function based on SIRT with repeated tests. (<b>b</b>) Evolution curves of objective function based on SGA-SIRT with repeated tests. (<b>c</b>) Evolution curves of objective function based on MPGA-SIRT with repeated tests.</p>
Full article ">Figure 12 Cont.
<p>Evolution curves of objective function <span class="html-italic">f</span> obtained based on different reconstruction models with repeated tests for 8208 working face. (<b>a</b>) Evolution curves of objective function based on SIRT with repeated tests. (<b>b</b>) Evolution curves of objective function based on SGA-SIRT with repeated tests. (<b>c</b>) Evolution curves of objective function based on MPGA-SIRT with repeated tests.</p>
Full article ">Figure 13
<p>Convergence results of objective function <span class="html-italic">f</span> obtained based on different reconstruction models with repeated tests for 8208 working face.</p>
Full article ">
40 pages, 12527 KiB  
Article
Monitoring and Diagnosing Faults in Induction Motors’ Three-Phase Systems Using NARX Neural Network
by Valbério Gonzaga de Araújo, Aziz Oloroun-Shola Bissiriou, Juan Moises Mauricio Villanueva, Elmer Rolando Llanos Villarreal, Andrés Ortiz Salazar, Rodrigo de Andrade Teixeira and Diego Antonio de Moura Fonsêca
Energies 2024, 17(18), 4609; https://doi.org/10.3390/en17184609 (registering DOI) - 13 Sep 2024
Viewed by 192
Abstract
Three-phase induction motors play a key role in industrial operations. However, their failure can result in serious operational problems. This study focuses on the early identification of faults through the accurate diagnosis and classification of faults in three-phase induction motors using artificial intelligence [...] Read more.
Three-phase induction motors play a key role in industrial operations. However, their failure can result in serious operational problems. This study focuses on the early identification of faults through the accurate diagnosis and classification of faults in three-phase induction motors using artificial intelligence techniques by analyzing current, temperature, and vibration signals. Experiments were conducted on a test bench, simulating real operating conditions, including stator phase unbalance, bearing damage, and shaft unbalance. To classify the faults, an Auto-Regressive Neural Network with Exogenous Inputs (NARX) was developed. The parameters of this network were determined through a process of selecting the best network by using the scanning method with multiple training and validation iterations with the introduction of new data. The results of these tests showed that the network exhibited excellent generalization across all evaluated situations, achieving the following accuracy rates: motor without fault = 94.2%, unbalanced fault = 95%, bearings with fault = 98%, and stator with fault = 95%. Full article
Show Figures

Figure 1

Figure 1
<p>TIM components.</p>
Full article ">Figure 2
<p>Failure tree.</p>
Full article ">Figure 3
<p>Topology of a recurrent neural network.</p>
Full article ">Figure 4
<p>Topology of a NARX neural network.</p>
Full article ">Figure 5
<p>ROC curve.</p>
Full article ">Figure 6
<p>Confusion matrix for multiclass classification.</p>
Full article ">Figure 7
<p>Process flowchart.</p>
Full article ">Figure 8
<p>Test bench.</p>
Full article ">Figure 9
<p>Three-phase induction motor.</p>
Full article ">Figure 10
<p>Current sensor.</p>
Full article ">Figure 11
<p>Signal at the output of the sensor.</p>
Full article ">Figure 12
<p>Current conditioning circuit.</p>
Full article ">Figure 13
<p>Current conditioning board.</p>
Full article ">Figure 14
<p>Sinusoidal waveform with offset value.</p>
Full article ">Figure 15
<p>Vibration accelerometer sensor.</p>
Full article ">Figure 16
<p>Temperature sensor.</p>
Full article ">Figure 17
<p>NI USB 6008.</p>
Full article ">Figure 18
<p>LabVIEW block diagram.</p>
Full article ">Figure 19
<p>NARX neural network.</p>
Full article ">Figure 20
<p>Sensors installed in the motor.</p>
Full article ">Figure 21
<p>Vibration signal in the time domain.</p>
Full article ">Figure 22
<p>Current signal in the time domain.</p>
Full article ">Figure 23
<p>Vibration signal in the frequency domain.</p>
Full article ">Figure 24
<p>Current signal in the frequency domain.</p>
Full article ">Figure 25
<p>Signal of motor temperature under good operating conditions.</p>
Full article ">Figure 26
<p>Installation of mass for unbalancing.</p>
Full article ">Figure 27
<p>Vibration signal in the time domain.</p>
Full article ">Figure 28
<p>Vibration signal in the frequency domain.</p>
Full article ">Figure 29
<p>Current signal in the time domain.</p>
Full article ">Figure 30
<p>Current signal in the frequency domain.</p>
Full article ">Figure 31
<p>Temperature signal for the unbalanced motor.</p>
Full article ">Figure 32
<p>Failure occurrence frequencies for bearings 6203–2z.</p>
Full article ">Figure 33
<p>Failure occurrence frequencies for bearings 6204–2z.</p>
Full article ">Figure 34
<p>Bearings with defects 6203–2z/6204–2z.</p>
Full article ">Figure 35
<p>Vibration signal in the time domain.</p>
Full article ">Figure 36
<p>Vibration signal in the frequency domain.</p>
Full article ">Figure 37
<p>Current signal in the time domain.</p>
Full article ">Figure 38
<p>Current signal in the frequency domain.</p>
Full article ">Figure 39
<p>Temperature signal of motor bearing with defect.</p>
Full article ">Figure 40
<p>Bank of resistors for current unbalance.</p>
Full article ">Figure 41
<p>Vibration signal in the time domain.</p>
Full article ">Figure 42
<p>Vibration signal in the frequency domain.</p>
Full article ">Figure 43
<p>Current signal in the time domain—Phase 1.</p>
Full article ">Figure 44
<p>Current signal in the frequency domain—Phase 1.</p>
Full article ">Figure 45
<p>Current signal in the time domain—Phase 2.</p>
Full article ">Figure 46
<p>Current signal in the frequency domain—Phase 2.</p>
Full article ">Figure 47
<p>Current signal in the time domain—Phase 3.</p>
Full article ">Figure 48
<p>Current signal in the frequency domain—Phase 3.</p>
Full article ">Figure 49
<p>Temperature signal for phase unbalanced motor.</p>
Full article ">Figure 50
<p>Standard training ROC curve.</p>
Full article ">Figure 51
<p>Standard training confusion matrix.</p>
Full article ">Figure 52
<p>Failures classified in standard training.</p>
Full article ">Figure 53
<p>ROC curve of the motor without defect test set.</p>
Full article ">Figure 54
<p>Confusion matrix of the ‘Motor without defect’ test set.</p>
Full article ">Figure 55
<p>Number of failures classified in the ‘Motor without defect’ test set.</p>
Full article ">Figure 56
<p>ROC curve of the defect unbalanced test set.</p>
Full article ">Figure 57
<p>Confusion matrix of the ‘Defect unbalance’ test set.</p>
Full article ">Figure 58
<p>Number of failures classified in the ‘Defect unbalance’ test set.</p>
Full article ">Figure 59
<p>ROC curve of the faulty bearings test set.</p>
Full article ">Figure 60
<p>Confusion matrix for defective bearings.</p>
Full article ">Figure 61
<p>Classified failures for defective bearings.</p>
Full article ">Figure 62
<p>ROC curve for defective stator.</p>
Full article ">Figure 63
<p>Confusion matrix for the defective stator.</p>
Full article ">Figure 64
<p>Faults classified for defective stator.</p>
Full article ">
35 pages, 3798 KiB  
Article
An AI-Based Evaluation Framework for Smart Building Integration into Smart City
by Mustafa Muthanna Najm Shahrabani and Rasa Apanaviciene
Sustainability 2024, 16(18), 8032; https://doi.org/10.3390/su16188032 - 13 Sep 2024
Viewed by 323
Abstract
The integration of smart buildings (SBs) into smart cities (SCs) is critical to urban development, with the potential to improve SCs’ performance. Artificial intelligence (AI) applications have emerged as a promising tool to enhance SB and SC development. The authors apply an AI-based [...] Read more.
The integration of smart buildings (SBs) into smart cities (SCs) is critical to urban development, with the potential to improve SCs’ performance. Artificial intelligence (AI) applications have emerged as a promising tool to enhance SB and SC development. The authors apply an AI-based methodology, particularly Large Language Models of OpenAI ChatGPT-3 and Google Bard as AI experts, to uniquely evaluate 26 criteria that represent SB services across five SC infrastructure domains (energy, mobility, water, waste management, and security), emphasizing their contributions to the integration of SB into SC and quantifying their impact on the efficiency, resilience, and environmental sustainability of SC. The framework was then validated through two rounds of the Delphi method, leveraging human expert knowledge and an iterative consensus-building process. The framework’s efficiency in analyzing complicated information and generating important insights is demonstrated via five case studies. These findings contribute to a deeper understanding of the effects of SB services on SC infrastructure domains, highlighting the intricate nature of SC, as well as revealing areas that require further integration to realize the SC performance objectives. Full article
Show Figures

Figure 1

Figure 1
<p>Conceptual framework of smart building integration into a smart city [<a href="#B5-sustainability-16-08032" class="html-bibr">5</a>].</p>
Full article ">Figure 2
<p>Integration of LLMs within AI subfields (adopted from [<a href="#B103-sustainability-16-08032" class="html-bibr">103</a>]).</p>
Full article ">Figure 3
<p>Open AI ChatGPT-3 model application.</p>
Full article ">Figure 4
<p>Google Bard model application.</p>
Full article ">Figure 5
<p>Round 1 agreement levels for the smart building service factors.</p>
Full article ">Figure 6
<p>Round 2 agreement level for the smart building services factors.</p>
Full article ">Figure 7
<p>Smart city infrastructure domain analysis responses from Rounds 1 and 2.</p>
Full article ">Figure 8
<p>The overview of case studies’ integration scores.</p>
Full article ">
25 pages, 1113 KiB  
Article
Semi-Analytical Closed-Form Solutions of the Ball–Plate Problem
by Remus-Daniel Ene and Nicolina Pop
Processes 2024, 12(9), 1977; https://doi.org/10.3390/pr12091977 - 13 Sep 2024
Viewed by 179
Abstract
Mathematical models and numerical simulations are necessary to understand the dynamical behaviors of complex systems. The aim of this work is to investigate closed-form solutions for the ball–plate problem considering a system derived from an optimal control problem for ball–plate dynamics. The nonlinear [...] Read more.
Mathematical models and numerical simulations are necessary to understand the dynamical behaviors of complex systems. The aim of this work is to investigate closed-form solutions for the ball–plate problem considering a system derived from an optimal control problem for ball–plate dynamics. The nonlinear properties of ball and plate control system are presented in this work. To semi-analytically solve this system, we explored a second-order nonlinear differential equation. Consequently, we obtained the approximate closed-form solutions by the Optimal Parametric Iteration Method (OPIM) using only one iteration. A comparison between the analytical and corresponding numerical procedures reflects the advantages of the first one. The accordance between the obtained results and the numerical ones highlights that the procedure used is accurate, effective, and good to implement in applications such as sliding mode control to the ball-and-plate problem. Full article
(This article belongs to the Special Issue Advances in the Control of Complex Dynamic Systems)
Show Figures

Figure 1

Figure 1
<p>Difference between semi-analytical and numerical results: <math display="inline"><semantics> <mrow> <msub> <mi>ϵ</mi> <mi>w</mi> </msub> <mo>=</mo> <mrow> <mo>|</mo> <msub> <mi>w</mi> <mrow> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>e</mi> <mi>r</mi> <mi>i</mi> <mi>c</mi> <mi>a</mi> <mi>l</mi> </mrow> </msub> <mo>−</mo> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>|</mo> </mrow> </mrow> </semantics></math> for the initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.45</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>0.85</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>; <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>1</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD27-processes-12-01977" class="html-disp-formula">27</a>) and (<a href="#FD54-processes-12-01977" class="html-disp-formula">A3</a>).</p>
Full article ">Figure 2
<p>The function <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>1</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD27-processes-12-01977" class="html-disp-formula">27</a>), (<a href="#FD28-processes-12-01977" class="html-disp-formula">28</a>) and (<a href="#FD54-processes-12-01977" class="html-disp-formula">A3</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.45</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>0.85</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>: OPIM solution (dotted black line) and numerical results (solid green line), respectively.</p>
Full article ">Figure 3
<p>The functions <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <msub> <mover accent="true"> <mi>x</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>y</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>z</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>∈</mo> <msub> <mi mathvariant="script">CFS</mi> <mn>1</mn> </msub> </mrow> </semantics></math> using Equation (<a href="#FD54-processes-12-01977" class="html-disp-formula">A3</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.45</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>0.85</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mn>0.5</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>: OPIM solution (dashing black line) and numerical results (solid color line: green line for <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, red line for <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, blue line for <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>), respectively.</p>
Full article ">Figure 4
<p>Difference between semi-analytical and numerical results: <math display="inline"><semantics> <mrow> <msub> <mi>ϵ</mi> <mi>w</mi> </msub> <mo>=</mo> <mrow> <mo>|</mo> <msub> <mi>w</mi> <mrow> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>e</mi> <mi>r</mi> <mi>i</mi> <mi>c</mi> <mi>a</mi> <mi>l</mi> </mrow> </msub> <mo>−</mo> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>|</mo> </mrow> </mrow> </semantics></math> for the initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.55</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mo>−</mo> <mn>0.65</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>; <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>2</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD38-processes-12-01977" class="html-disp-formula">38</a>) and (<a href="#FD55-processes-12-01977" class="html-disp-formula">A4</a>).</p>
Full article ">Figure 5
<p>The function <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>2</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD38-processes-12-01977" class="html-disp-formula">38</a>), (<a href="#FD39-processes-12-01977" class="html-disp-formula">39</a>) and (<a href="#FD55-processes-12-01977" class="html-disp-formula">A4</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.55</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mo>−</mo> <mn>0.65</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>: OPIM solution (dotted black line) and numerical results (solid green line), respectively.</p>
Full article ">Figure 6
<p>The functions <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <msub> <mover accent="true"> <mi>x</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>y</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>z</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>∈</mo> <msub> <mi mathvariant="script">CFS</mi> <mn>2</mn> </msub> </mrow> </semantics></math> using Equation (<a href="#FD55-processes-12-01977" class="html-disp-formula">A4</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.55</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mo>−</mo> <mn>0.65</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mn>0.75</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>: OPIM solution (dashing black line) and numerical results (solid color line: green line for <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, red line for <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, blue line for <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>), respectively.</p>
Full article ">Figure 7
<p>Difference between semi-analytical and numerical results: <math display="inline"><semantics> <mrow> <msub> <mi>ϵ</mi> <mi>w</mi> </msub> <mo>=</mo> <mrow> <mo>|</mo> <msub> <mi>w</mi> <mrow> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>e</mi> <mi>r</mi> <mi>i</mi> <mi>c</mi> <mi>a</mi> <mi>l</mi> </mrow> </msub> <mo>−</mo> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>|</mo> </mrow> </mrow> </semantics></math> for the initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.55</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mo>−</mo> <mn>0.450</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mo>−</mo> <mn>0.25</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math>; <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>3</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD47-processes-12-01977" class="html-disp-formula">47</a>) and (<a href="#FD56-processes-12-01977" class="html-disp-formula">A5</a>).</p>
Full article ">Figure 8
<p>The function <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>3</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD47-processes-12-01977" class="html-disp-formula">47</a>), (<a href="#FD48-processes-12-01977" class="html-disp-formula">48</a>) and (<a href="#FD56-processes-12-01977" class="html-disp-formula">A5</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.55</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mo>−</mo> <mn>0.450</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mo>−</mo> <mn>0.25</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>: OPIM solution (dotted black line) and numerical results (solid green line), respectively.</p>
Full article ">Figure 9
<p>The functions <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <msub> <mover accent="true"> <mi>x</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>y</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>z</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>∈</mo> <msub> <mi mathvariant="script">CFS</mi> <mn>3</mn> </msub> </mrow> </semantics></math> using Equation (<a href="#FD56-processes-12-01977" class="html-disp-formula">A5</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.55</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.25</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mo>−</mo> <mn>0.450</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mo>−</mo> <mn>0.25</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math>: OPIM solution (dashing black line) and numerical results (solid color line: green line for <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, red line for <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, blue line for <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>), respectively.</p>
Full article ">Figure 10
<p>Difference between semi-analytical and numerical results: <math display="inline"><semantics> <mrow> <msub> <mi>ϵ</mi> <mi>w</mi> </msub> <mo>=</mo> <mrow> <mo>|</mo> <msub> <mi>w</mi> <mrow> <mi>n</mi> <mi>u</mi> <mi>m</mi> <mi>e</mi> <mi>r</mi> <mi>i</mi> <mi>c</mi> <mi>a</mi> <mi>l</mi> </mrow> </msub> <mo>−</mo> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>|</mo> </mrow> </mrow> </semantics></math> for the initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.85</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.95</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>0.750</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mo>−</mo> <mn>0.45</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math>; <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>3</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD47-processes-12-01977" class="html-disp-formula">47</a>) and (<a href="#FD57-processes-12-01977" class="html-disp-formula">A6</a>).</p>
Full article ">Figure 11
<p>The function <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>w</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>∈</mo> <msub> <mi mathvariant="script">SA</mi> <mn>3</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD47-processes-12-01977" class="html-disp-formula">47</a>), (<a href="#FD48-processes-12-01977" class="html-disp-formula">48</a>) and (<a href="#FD57-processes-12-01977" class="html-disp-formula">A6</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.85</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.95</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>0.750</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mo>−</mo> <mn>0.45</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>23</mn> </mrow> </semantics></math>: OPIM solution (dotted black line) and numerical results (solid green line), respectively.</p>
Full article ">Figure 12
<p>The functions <math display="inline"><semantics> <mrow> <mrow> <mo>(</mo> <msub> <mover accent="true"> <mi>x</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>y</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>,</mo> <msub> <mover accent="true"> <mi>z</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mo>)</mo> </mrow> <mo>∈</mo> <msub> <mi mathvariant="script">CFS</mi> <mn>3</mn> </msub> </mrow> </semantics></math> using Equations (<a href="#FD9-processes-12-01977" class="html-disp-formula">9</a>) and (<a href="#FD57-processes-12-01977" class="html-disp-formula">A6</a>) for initial data: <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.85</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.95</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mn>0</mn> </msub> <mo>=</mo> <mn>0.35</mn> </mrow> </semantics></math>, physical parameters: <math display="inline"><semantics> <mrow> <mi>k</mi> <mo>=</mo> <mn>0.750</mn> </mrow> </semantics></math>, <math display="inline"><semantics> <mrow> <mi>l</mi> <mo>=</mo> <mo>−</mo> <mn>0.45</mn> </mrow> </semantics></math> and index <math display="inline"><semantics> <mrow> <msub> <mi>N</mi> <mrow> <mi>m</mi> <mi>a</mi> <mi>x</mi> </mrow> </msub> <mo>=</mo> <mn>16</mn> </mrow> </semantics></math>: OPIM solution (dashing black line) and numerical results (solid color line: green line for <math display="inline"><semantics> <mrow> <mi>x</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, red line for <math display="inline"><semantics> <mrow> <mi>y</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>, blue line for <math display="inline"><semantics> <mrow> <mi>z</mi> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </semantics></math>), respectively.</p>
Full article ">Figure 13
<p>Approximate analytical solution <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>x</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> of the Equation (<a href="#FD1-processes-12-01977" class="html-disp-formula">1</a>) using Equation (<a href="#FD54-processes-12-01977" class="html-disp-formula">A3</a>), the iterative solution <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mrow> <mi>i</mi> <mi>t</mi> <mi>e</mi> <mi>r</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> using Equation (<a href="#FD51-processes-12-01977" class="html-disp-formula">51</a>) and the corresponding numerical ones: OPIM solution (dashing black line), iterative solution (dotted red line) and numerical results (solid green line), respectively.</p>
Full article ">Figure 14
<p>Approximate analytical solution <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>y</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> of Equation (<a href="#FD1-processes-12-01977" class="html-disp-formula">1</a>) using Equation (<a href="#FD54-processes-12-01977" class="html-disp-formula">A3</a>), the iterative solution <math display="inline"><semantics> <mrow> <msub> <mi>y</mi> <mrow> <mi>i</mi> <mi>t</mi> <mi>e</mi> <mi>r</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> using Equation (<a href="#FD51-processes-12-01977" class="html-disp-formula">51</a>) and the corresponding numerical ones: OPIM solution (dashing black line), iterative solution (dotted red line) and numerical results (solid magenta line), respectively.</p>
Full article ">Figure 15
<p>Approximate analytical solution <math display="inline"><semantics> <mrow> <msub> <mover accent="true"> <mi>z</mi> <mo stretchy="false">¯</mo> </mover> <mrow> <mi>O</mi> <mi>P</mi> <mi>I</mi> <mi>M</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> of Equation (<a href="#FD1-processes-12-01977" class="html-disp-formula">1</a>) using Equation (<a href="#FD54-processes-12-01977" class="html-disp-formula">A3</a>), the iterative solution <math display="inline"><semantics> <mrow> <msub> <mi>z</mi> <mrow> <mi>i</mi> <mi>t</mi> <mi>e</mi> <mi>r</mi> </mrow> </msub> <mrow> <mo>(</mo> <mi>t</mi> <mo>)</mo> </mrow> </mrow> </semantics></math> using Equation (<a href="#FD51-processes-12-01977" class="html-disp-formula">51</a>) and the corresponding numerical ones: OPIM solution (dashing black line), iterative solution (dotted red line) and numerical results (solid blue line), respectively.</p>
Full article ">
27 pages, 6348 KiB  
Article
Vehicle-UAV Integrated Routing Optimization Problem for Emergency Delivery of Medical Supplies
by Muhammad Arslan Ghaffar, Lei Peng, Muhammad Umer Aslam, Muhammad Adeel and Salim Dassari
Electronics 2024, 13(18), 3650; https://doi.org/10.3390/electronics13183650 - 13 Sep 2024
Viewed by 238
Abstract
In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach, namely integrating vehicle and unmanned aerial [...] Read more.
In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach, namely integrating vehicle and unmanned aerial vehicle (UAV) logistics to enhance the efficiency and resilience of medical supply chains. Our study introduces a dual-mode distribution framework which employs the density-based spatial clustering of applications with noise (DBSCAN) algorithm for efficiently clustering demand zones unreachable by conventional vehicles, thereby identifying areas requiring UAV delivery. Furthermore, we categorize the demand for medical supplies into two distinct sets based on vehicle accessibility, optimizing distribution routes via both UAVs and vehicles. Through comparative analysis, our findings reveal that the artificial bee colony (ABC) algorithm significantly outperforms the genetic algorithm in terms of solving efficiency, iteration counts, and delivery speed. However, the ABC algorithm’s tendency toward early local optimization and rapid convergence leads to potential stagnation in local optima. To mitigate this issue, we incorporate a simulated annealing technique into the ABC framework, culminating in a refined optimization approach which successfully overcomes the limitations of premature local optima convergence. The experimental results validate the efficacy of our enhanced algorithm, demonstrating reduced iteration counts, shorter computation times, and substantially improved solution quality over traditional logistic models. The proposed method holds promise for significantly improving the operational efficiency and service quality of the healthcare system’s logistics during critical situations. Full article
Show Figures

Figure 1

Figure 1
<p>Delivery sketch map.</p>
Full article ">Figure 2
<p>Time satisfaction graph.</p>
Full article ">Figure 3
<p>Satisfaction rate of material delivery volume.</p>
Full article ">Figure 4
<p>Flowchart of DBSCAN algorithm.</p>
Full article ">Figure 5
<p>Flowchart of ABC algorithm.</p>
Full article ">Figure 6
<p>Encoding diagram.</p>
Full article ">Figure 7
<p>Diagram for neighborhood search technique.</p>
Full article ">Figure 8
<p>Decoding diagram.</p>
Full article ">Figure 9
<p>Basic probability graph.</p>
Full article ">Figure 10
<p>Adaptive probability graph.</p>
Full article ">Figure 11
<p>Customer clustering results for UAV delivery.</p>
Full article ">Figure 12
<p>Vehicle delivery path solved by genetic algorithm.</p>
Full article ">Figure 13
<p>Vehicle delivery path solved by artificial bee colony algorithm.</p>
Full article ">Figure 14
<p>Comparison between genetic algorithm and artificial bee colony algorithm for optimizing vehicle path iteration.</p>
Full article ">Figure 15
<p>Path optimization of three different classes of UAV delivery customers using genetic algorithm.</p>
Full article ">Figure 16
<p>Path optimization of three different classes of UAV delivery to customers using artificial bee colony algorithm.</p>
Full article ">Figure 17
<p>Comparison of iterative solutions between artificial bee colony algorithm and genetic algorithm for all classes of UAV customers.</p>
Full article ">Figure 18
<p>Flowchart of improved bee colony algorithm.</p>
Full article ">Figure 19
<p>Improved bee colony algorithm for path optimization.</p>
Full article ">Figure 20
<p>Comparison of iterative optimization curves for solving vehicle paths.</p>
Full article ">Figure 21
<p>Solving path optimization for three different classes of UAV delivery customers using the improved bee colony algorithm.</p>
Full article ">Figure 22
<p>Comparison chart of iterative optimization curves between improved bee colony algorithm and artificial bee colony algorithm for solving all classes of UAV customers.</p>
Full article ">
42 pages, 25590 KiB  
Article
Quantitative Assessment of Drone Pilot Performance
by Daniela Doroftei, Geert De Cubber, Salvatore Lo Bue and Hans De Smet
Drones 2024, 8(9), 482; https://doi.org/10.3390/drones8090482 - 13 Sep 2024
Viewed by 463
Abstract
This paper introduces a quantitative methodology for assessing drone pilot performance, aiming to reduce drone-related incidents by understanding the human factors influencing performance. The challenge lies in balancing evaluations in operationally relevant environments with those in a standardized test environment for statistical relevance. [...] Read more.
This paper introduces a quantitative methodology for assessing drone pilot performance, aiming to reduce drone-related incidents by understanding the human factors influencing performance. The challenge lies in balancing evaluations in operationally relevant environments with those in a standardized test environment for statistical relevance. The proposed methodology employs a novel virtual test environment that records not only basic flight metrics but also complex mission performance metrics, such as the video quality from a target. A group of Belgian Defence drone pilots were trained using this simulator system, yielding several practical results. These include a human-performance model linking human factors to pilot performance, an AI co-pilot providing real-time flight performance guidance, a tool for generating optimal flight trajectories, a mission planning tool for ideal pilot assignment, and a method for iterative training improvement based on quantitative input. The training results with real pilots demonstrate the methodology’s effectiveness in evaluating pilot performance for complex military missions, suggesting its potential as a valuable addition to new pilot training programs. Full article
(This article belongs to the Collection Drones for Security and Defense Applications)
Show Figures

Figure 1

Figure 1
<p>Taxonomy of video quality analysis methodologies.</p>
Full article ">Figure 2
<p>Conceptual overview of the main contributions of this paper.</p>
Full article ">Figure 3
<p>Software architecture of the proposed drone simulator system.</p>
Full article ">Figure 4
<p>Snapshots of the simulator environment, showing the elements of the standardised test environment.</p>
Full article ">Figure 5
<p>Interface of the QGroundControl application.</p>
Full article ">Figure 6
<p>Video quality scores obtained by seven operators.</p>
Full article ">Figure 7
<p>Main interface of the performance analysis tool, featuring on the right side a number of performance metrics and on the left side a top-down view of the standardised simulation environment, showing the locations of the different enemies (blue dots), the enemy camp (red square), and the drone trajectory (blue line).</p>
Full article ">Figure 8
<p>Expert analysis panel of the performance analysis tool. The user can select any of the 60 recorded time-signals on the right to better understand the composition of the performance score. Here, the graph shows the <span class="html-italic">X</span>-axis component of the drone velocity, as measured by its on-board GPS system.</p>
Full article ">Figure 9
<p>Expert analysis panel of the performance analysis tool. The user can select any of the 60 recorded time-signals on the right to better understand the composition of the performance score. Here, the graph shows the <span class="html-italic">Z</span>-axis component of the drone vibrations.</p>
Full article ">Figure 10
<p>Degradation of performance due to increasing wind speed. Each line represents the performance score of an individual pilot across various wind speeds. The figure shows that good pilots manage to keep a consistent performance level, whereas bad pilots see their performance reduced.</p>
Full article ">Figure 11
<p>Degradation of performance due to auditive disturbances level. The figure shows that military pilots (blue line) handle auditive disturbances very well, whereas civilian pilots tend to have their performance reduced when subjected to auditive disturbances.</p>
Full article ">Figure 12
<p>Degradation of performance due to a priori stress level. No clear correlation between the a priori stress level and the pilot flight performance could be established [<a href="#B92-drones-08-00482" class="html-bibr">92</a>].</p>
Full article ">Figure 13
<p>Degradation of performance due to pilot experience. The figure shows that training drastically improves performance (red line), but the training should be specific to the type of drone, as training on fixed wing drones (blue line) will not help much for increasing the performance on quadrotors.</p>
Full article ">Figure 14
<p>Convergence of the accuracy and loss of the ADAM pilot skill classifier [<a href="#B57-drones-08-00482" class="html-bibr">57</a>].</p>
Full article ">Figure 15
<p>Co-pilot classifier performance [<a href="#B57-drones-08-00482" class="html-bibr">57</a>].</p>
Full article ">Figure 16
<p>Drone trajectory generation validation. (<b>a</b>) Evolution of the <math display="inline"><semantics> <msub> <mi>ϕ</mi> <mi>p</mi> </msub> </semantics></math> criterion. (<b>b</b>) Evolution of the <math display="inline"><semantics> <msub> <mi>ϕ</mi> <mi>d</mi> </msub> </semantics></math> criterion. (<b>c</b>) Evolution of the <math display="inline"><semantics> <msub> <mi>ϕ</mi> <mi>t</mi> </msub> </semantics></math> criterion. (<b>d</b>) Scan completeness evolution. (<b>e</b>) Drone trajectory.</p>
Full article ">Figure 17
<p>Graphical user interface of the drone mission preparation tool. (<b>a</b>) Interface of the drone mission preparation tool, enabling the operator to select the available drones and pilots and the type of mission. The system then calculates the optimal drone and pilot for the given mission and presents this information to the user. (<b>b</b>) Details of the calculation of the optimal resource allocation. The optimizer uses stored capability profiles for drones and pilots for different missions and experience levels of the different pilots with all the drones to propose an optimal allocation.</p>
Full article ">
16 pages, 2885 KiB  
Article
Trajectory Planning of Robotic Arm Based on Particle Swarm Optimization Algorithm
by Nengkai Wu, Dongyao Jia, Ziqi Li and Zihao He
Appl. Sci. 2024, 14(18), 8234; https://doi.org/10.3390/app14188234 - 12 Sep 2024
Viewed by 333
Abstract
Achieving vibration-free smooth motion of industrial robotic arms in a short period is an important research topic. Existing path planning algorithms often sacrifice smoothness in pursuit of efficient motion. A robotic trajectory planning particle swarm optimization algorithm (RTPPSO) is introduced for optimizing joint [...] Read more.
Achieving vibration-free smooth motion of industrial robotic arms in a short period is an important research topic. Existing path planning algorithms often sacrifice smoothness in pursuit of efficient motion. A robotic trajectory planning particle swarm optimization algorithm (RTPPSO) is introduced for optimizing joint angles or paths of mechanical arm movements. The RTPPSO algorithm is enhanced through the introduction of adaptive weight strategies and random perturbation terms. Subsequently, the RTPPSO algorithm is utilized to plan selected parameters of an S-shaped velocity profile, iterating to obtain the optimal solution. Experimental results demonstrate that this velocity planning algorithm significantly improves the acceleration of the robotic arm, surpassing traditional trial-and-error velocity planning methods. Full article
(This article belongs to the Special Issue Motion Control for Robots and Automation)
Show Figures

Figure 1

Figure 1
<p>Circular interpolation based on relative coordinate system.</p>
Full article ">Figure 2
<p>Trapezoidal speed planning.</p>
Full article ">Figure 3
<p>S-shaped speed planning.</p>
Full article ">Figure 4
<p>RTPPSO algorithm flow chart.</p>
Full article ">Figure 5
<p>Machine arm motion illustration.</p>
Full article ">Figure 6
<p>Comparison of trapezoidal curve and S-curve.</p>
Full article ">Figure 7
<p>Velocity curve of the first iteration.</p>
Full article ">Figure 8
<p>Velocity curve of global optimal solution.</p>
Full article ">Figure 9
<p>Fitness learning curve.</p>
Full article ">
18 pages, 509 KiB  
Article
State Estimators for Plants Implementing ILC Strategies through Delay Links
by Lina Si, Xinyang Guo, Lixun Huang and Qiuwen Zhang
Mathematics 2024, 12(18), 2834; https://doi.org/10.3390/math12182834 - 12 Sep 2024
Viewed by 277
Abstract
Random delays in the communication links affect the precise tracking of the expected trajectory by a plant controlled by the iterative learning control (ILC) strategy. To tackle the link impact, this paper proposes a state estimator to derive accurate plant outputs that are [...] Read more.
Random delays in the communication links affect the precise tracking of the expected trajectory by a plant controlled by the iterative learning control (ILC) strategy. To tackle the link impact, this paper proposes a state estimator to derive accurate plant outputs that are necessary for controller learning. First, a data pre-processing method is designed to ensure that both the controller and actuator ends receive only one piece of data at any given moment. Subsequently, the data pre-processing method and the system information are used according to the theory of orthogonality to construct the state estimator. The simulation examples demonstrate that the developed estimators aid in the precise tracking of the desired trajectory by the plant implementing ILC strategies through delay links. Full article
(This article belongs to the Section Computational and Applied Mathematics)
Show Figures

Figure 1

Figure 1
<p>Plants implementing ILC strategies with state estimators.</p>
Full article ">Figure 2
<p>The velocity states of motors with no processing when noise variances are 0.05.</p>
Full article ">Figure 3
<p>The velocity states of motors with the time-domain compensation when noise variances are 0.05.</p>
Full article ">Figure 4
<p>The velocity states of motors with the proposed estimator when noise variances are 0.05.</p>
Full article ">Figure 5
<p>The inputs emitted by controllers and corresponding outputs with no processing when noise variances are 0.05.</p>
Full article ">Figure 6
<p>The inputs emitted by controllers and corresponding outputs with the time-domain compensation when noise variances are 0.05.</p>
Full article ">Figure 7
<p>The inputs emitted by controllers and corresponding outputs with the proposed estimator when noise variances are 0.05.</p>
Full article ">Figure 8
<p>The velocity states of motors with no processing when noise variances are 0.15.</p>
Full article ">Figure 9
<p>The velocity states of motors with the time-domain compensation when noise variances are 0.15.</p>
Full article ">Figure 10
<p>The velocity states of motors with the proposed estimator when noise variances are 0.15.</p>
Full article ">Figure 11
<p>The inputs emitted by controllers and corresponding outputs with no processing when noise variances are 0.15.</p>
Full article ">Figure 12
<p>The inputs emitted by controllers and corresponding outputs with the time-domain compensation when noise variances are 0.15.</p>
Full article ">Figure 13
<p>The inputs emitted by controllers and corresponding outputs with the proposed estimator when noise variances are 0.15.</p>
Full article ">Figure 14
<p>The convergence of mean absolute errors of velocity states of motors when noise variances are 0.15.</p>
Full article ">Figure 15
<p>The convergence of mean absolute errors of inputs emitted by controllers when noise variances are 0.15.</p>
Full article ">Figure 16
<p>The convergence of mean absolute errors of system output when noise variances are 0.15.</p>
Full article ">
19 pages, 8616 KiB  
Article
Research on the Optimization Method of Visual Sensor Calibration Combining Convex Lens Imaging with the Bionic Algorithm of Wolf Pack Predation
by Qingdong Wu, Jijun Miao, Zhaohui Liu and Jiaxiu Chang
Sensors 2024, 24(18), 5926; https://doi.org/10.3390/s24185926 - 12 Sep 2024
Viewed by 307
Abstract
To improve the accuracy of camera calibration, a novel optimization method is proposed in this paper, which combines convex lens imaging with the bionic algorithm of Wolf Pack Predation (CLI-WPP). During the optimization process, the internal parameters and radial distortion parameters of the [...] Read more.
To improve the accuracy of camera calibration, a novel optimization method is proposed in this paper, which combines convex lens imaging with the bionic algorithm of Wolf Pack Predation (CLI-WPP). During the optimization process, the internal parameters and radial distortion parameters of the camera are regarded as the search targets of the bionic algorithm of Wolf Pack Predation, and the reprojection error of the calibration results is used as the fitness evaluation criterion of the bionic algorithm of Wolf Pack Predation. The goal of optimizing camera calibration parameters is achieved by iteratively searching for a solution that minimizes the fitness value. To overcome the drawback that the bionic algorithm of Wolf Pack Predation is prone to fall into local optimal, a reverse learning strategy based on convex lens imaging is introduced to transform the current optimal individual and generate a series of new individuals with potential better solutions that are different from the original individual, helping the algorithm out of the local optimum dilemma. The comparative experimental results show that the average reprojection errors of the simulated annealing algorithm, Zhang’s calibration method, the sparrow search algorithm, the particle swarm optimization algorithm, bionic algorithm of Wolf Pack Predation, and the algorithm proposed in this paper (CLI-WPP) are 0.42986500, 0.28847656, 0.23543161, 0.219342495, 0.10637477, and 0.06615037, respectively. The results indicate that calibration accuracy, stability, and robustness are significantly improved with the optimization method based on the CLI-WPP, in comparison to the existing commonly used optimization algorithms. Full article
(This article belongs to the Section Sensing and Imaging)
Show Figures

Figure 1

Figure 1
<p>The logic diagram showing the novelty and advantages of the proposed method.</p>
Full article ">Figure 2
<p>The relationship between the four coordinate systems.</p>
Full article ">Figure 3
<p>Position shift phenomenon due to distortion.</p>
Full article ">Figure 4
<p>Relationship of coordinate transformation in camera calibration.</p>
Full article ">Figure 5
<p>Schematic diagram of convex lens imaging of light.</p>
Full article ">Figure 6
<p>The reverse learning strategy for the convex lens imaging technique.</p>
Full article ">Figure 7
<p>Flowchart of the optimized camera calibration method using the CLI-WPP.</p>
Full article ">Figure 8
<p>Calibration plate image acquisition.</p>
Full article ">Figure 9
<p>The 3D model diagram of the external parameters of the camera.</p>
Full article ">Figure 10
<p>Binocular camera reprojection error graph. The horizontal coordinates of the figure indicate the 30 images used for left and right target timing, and the vertical coordinates indicate the value of the reprojection error.</p>
Full article ">Figure 11
<p>The reprojection error distribution of SA.</p>
Full article ">Figure 12
<p>The reprojection error distribution of Zhang’s calibration method.</p>
Full article ">Figure 13
<p>The reprojection error distribution of PSO.</p>
Full article ">Figure 14
<p>The reprojection error distribution of the SSA.</p>
Full article ">Figure 15
<p>The reprojection error distribution of WPP.</p>
Full article ">Figure 16
<p>The reprojection error distribution of the CLI-WPP.</p>
Full article ">Figure 17
<p>The objective value optimization process.</p>
Full article ">Figure 18
<p>Average calibration results under different levels of noise intensity.</p>
Full article ">
Back to TopTop