[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

Article Types

Countries / Regions

Search Results (148)

Search Parameters:
Keywords = IPSO

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
24 pages, 8395 KiB  
Article
Linear Active Disturbance Rejection Control System for the Travel Speed of an Electric Reel Sprinkling Irrigation Machine
by Lingdi Tang, Wei Wang, Chenjun Zhang, Zanya Wang, Zeyu Ge and Shouqi Yuan
Agriculture 2024, 14(9), 1544; https://doi.org/10.3390/agriculture14091544 - 6 Sep 2024
Viewed by 281
Abstract
The uniformity of the travel speed of electric reel sprinkling irrigation machines is a key factor affecting irrigation quality. However, conventional PID control is susceptible to sudden disturbances under complex farmland conditions, leading to reduced speed uniformity. To enhance the robustness of the [...] Read more.
The uniformity of the travel speed of electric reel sprinkling irrigation machines is a key factor affecting irrigation quality. However, conventional PID control is susceptible to sudden disturbances under complex farmland conditions, leading to reduced speed uniformity. To enhance the robustness of the control system, it is necessary to investigate new disturbance rejection control algorithms and their effects. Therefore, a kinematic model of the reel sprinkling irrigation machine and a brushless DC (BLDC) motor model were established, and a linear active disturbance rejection control (LADRC) strategy based on improved particle swarm optimization (IPSO) was proposed. The simulation results show that under variable speed conditions, the system exhibits no overshoot, with an adjustment time of 0.064 s; under variable load conditions, the speed vibration amplitude is less than 0.3%. The field test results indicate that at travel speeds of 10 m/h and 30 m/h, the maximum absolute deviation rate under IPSO-LADRC control is reduced by 27.07% and 13.98%, respectively, compared to PID control. The control strategy based on IPSO-LADRC effectively improves the control accuracy and robustness under complex farmland conditions, providing a reference for enhancing the control performance of other electric agricultural machinery. Full article
(This article belongs to the Special Issue Application of Modern Agricultural Equipment in Crop Cultivation)
Show Figures

Figure 1

Figure 1
<p>Design concept of the IPSO-LADRC controller. Note: The red arrows represent the process of parameter improvement in the PSO algorithm; * denotes the target values for the q-axis and d-axis currents.</p>
Full article ">Figure 2
<p>Components of the electric reel sprinkling irrigation machine. (<b>a</b>) Overall structure; (<b>b</b>) electric drive components. Note: 1. sprinkler cart; 2. water supply pipe; 3. reel; 4. electric drive transmission control box; 5. permanent magnet motor; 6. gearbox; 7. tachymeter rollers; 8. display screen.</p>
Full article ">Figure 3
<p>Roller speed measurement mechanism. Note: 1. speed measurement bracket; 2. encoder; 3. speed measurement rubber roller; 4. roller shaft; 5. fixing nut.</p>
Full article ">Figure 4
<p>Speed control components of the electric reel sprinkling irrigation machine.</p>
Full article ">Figure 5
<p>Main interface of the Android control terminal display screen.</p>
Full article ">Figure 6
<p>Flow chart of the system control.</p>
Full article ">Figure 7
<p>Block diagram of the control system for the electric reel sprinkling irrigation machine.</p>
Full article ">Figure 8
<p>Cross-sectional view of the reel.Note: The dotted line represents the central axis of the water pipe.</p>
Full article ">Figure 9
<p>Block diagram of the LADRC.</p>
Full article ">Figure 10
<p>Variation trends of inertia weight and learning factors. (<b>a</b>) Variation in inertia weights in PSO, LPSO, and IPSO; (<b>b</b>) variation in learning factors in PSO and IPSO.</p>
Full article ">Figure 11
<p>IPSO algorithm parameter tuning and optimization process.</p>
Full article ">Figure 12
<p>Flowchart of IPSO−optimized LADRC controller parameter process.</p>
Full article ">Figure 13
<p>Simulation diagram of the vector control system for BLDC motor based on LADRC.</p>
Full article ">Figure 14
<p>Motor load startup response curve.</p>
Full article ">Figure 15
<p>Motor variable speed control response curve.</p>
Full article ">Figure 16
<p>Motor variable load response curve.</p>
Full article ">Figure 17
<p>Fitness value variation curves of the two intelligent algorithms. (<b>a</b>) PSO; (<b>b</b>) IPSO.</p>
Full article ">Figure 18
<p>Parameter variation curves for optimizing the LADRC controller using the two intelligent algorithms. (<b>a</b>) PSO; (<b>b</b>) IPSO.</p>
Full article ">Figure 19
<p>Field tests of the JP75-300/D electric-driven reel sprinkling irrigation machine.</p>
Full article ">Figure 20
<p>Control test results of the electric reel sprinkling irrigation machine under different speeds. (<b>a</b>) Sample speed control curve at 10 m/h; (<b>b</b>) sample speed control curve at 30 m/h.</p>
Full article ">
24 pages, 4472 KiB  
Article
An Improved Particle Swarm Optimization Algorithm Based on Variable Neighborhood Search
by Hao Li, Jianjun Zhan, Zipeng Zhao and Haosen Wang
Mathematics 2024, 12(17), 2708; https://doi.org/10.3390/math12172708 - 30 Aug 2024
Viewed by 535
Abstract
Various metaheuristic algorithms inspired by nature have been designed to deal with a variety of practical optimization problems. As an excellent metaheuristic algorithm, the improved particle swarm optimization algorithm based on grouping (IPSO) has strong global search capabilities. However, it lacks a strong [...] Read more.
Various metaheuristic algorithms inspired by nature have been designed to deal with a variety of practical optimization problems. As an excellent metaheuristic algorithm, the improved particle swarm optimization algorithm based on grouping (IPSO) has strong global search capabilities. However, it lacks a strong local search ability and the ability to solve constrained discrete optimization problems. This paper focuses on improving these two aspects of the IPSO algorithm. Based on IPSO, we propose an improved particle swarm optimization algorithm based on variable neighborhood search (VN-IPSO) and design a 0-1 integer programming solution with constraints. In the experiment, the performance of the VN-IPSO algorithm is fully tested and analyzed using 23 classic benchmark functions (continuous optimization), 6 knapsack problems (discrete optimization), and 10 CEC2017 composite functions (complex functions). The results show that the VN-IPSO algorithm wins 18 first places in the classic benchmark function test set, including 6 first places in the solutions for seven unimodal test functions, indicating a good local search ability. In solving the six knapsack problems, it wins four first places, demonstrating the effectiveness of the 0-1 integer programming constraint solution and the excellent solution ability of VN-IPSO in discrete optimization problems. In the test of 10 composite functions, VN-IPSO wins first place four times and ranks the first in the comprehensive ranking, demonstrating its excellent solving ability for complex functions. Full article
Show Figures

Figure 1

Figure 1
<p>Diagram of neighborhood and operator.</p>
Full article ">Figure 2
<p>Variable neighborhood search algorithm process.</p>
Full article ">Figure 3
<p>The flow diagram for the complete work.</p>
Full article ">Figure 4
<p>The process of the VN-IPSO algorithm.</p>
Full article ">Figure 5
<p>Mapping relationship between integer variable <math display="inline"><semantics> <mrow> <msubsup> <mi>x</mi> <mi>i</mi> <mrow> <mi>b</mi> <mi>i</mi> <mi>n</mi> <mi>a</mi> <mi>r</mi> <mi>y</mi> </mrow> </msubsup> </mrow> </semantics></math> and continuous variable <math display="inline"><semantics> <mrow> <msub> <mi>x</mi> <mi>i</mi> </msub> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>Qualitative analysis results of VN-IPSO on some benchmark functions.</p>
Full article ">Figure 6 Cont.
<p>Qualitative analysis results of VN-IPSO on some benchmark functions.</p>
Full article ">Figure 7
<p>Qualitative analysis results of VN-IPSO on some benchmark test sets of knapsack problems.</p>
Full article ">Figure 8
<p>Iteration curves of VN-IPSO and comparison algorithms on the cec2017 composition functions.</p>
Full article ">Figure 9
<p>Box plots of VN-IPSO and its comparison algorithms on the cec2017 combination functions.</p>
Full article ">
26 pages, 3455 KiB  
Article
Energy-Efficient Online Path Planning for Internet of Drones Using Reinforcement Learning
by Zainab AlMania, Tarek Sheltami, Gamil Ahmed, Ashraf Mahmoud and Abdulaziz Barnawi
J. Sens. Actuator Netw. 2024, 13(5), 50; https://doi.org/10.3390/jsan13050050 - 29 Aug 2024
Viewed by 337
Abstract
Unmanned aerial vehicles (UAVs) have recently been applied in several contexts due to their flexibility, mobility, and fast deployment. One of the essential aspects of multi-UAV systems is path planning, which autonomously determines paths for drones from starting points to destination points. However, [...] Read more.
Unmanned aerial vehicles (UAVs) have recently been applied in several contexts due to their flexibility, mobility, and fast deployment. One of the essential aspects of multi-UAV systems is path planning, which autonomously determines paths for drones from starting points to destination points. However, UAVs face many obstacles in their routes, potentially causing loss or damage. Several heuristic approaches have been investigated to address collision avoidance. These approaches are generally applied in static environments where the environment is known in advance and paths are generated offline, making them unsuitable for unknown or dynamic environments. Additionally, limited flight times due to battery constraints pose another challenge in multi-UAV path planning. Reinforcement learning (RL) emerges as a promising candidate to generate collision-free paths for drones in dynamic environments due to its adaptability and generalization capabilities. In this study, we propose a framework to provide a novel solution for multi-UAV path planning in a 3D dynamic environment. The improved particle swarm optimization with reinforcement learning (IPSO-RL) framework is designed to tackle the multi-UAV path planning problem in a fully distributed and reactive manner. The framework integrates IPSO with deep RL to provide the drone with additional feedback and guidance to operate more sustainably. This integration incorporates a unique reward system that can adapt to various environments. Simulations demonstrate the effectiveness of the IPSO-RL approach, showing superior results in terms of collision avoidance, path length, and energy efficiency compared to other benchmarks. The results also illustrate that the proposed IPSO-RL framework can acquire a feasible and effective route successfully with minimum energy consumption in complicated environments. Full article
Show Figures

Figure 1

Figure 1
<p>Random function compared with logistic map [<a href="#B42-jsan-13-00050" class="html-bibr">42</a>].</p>
Full article ">Figure 2
<p>Proposed IPSO-DRL system model.</p>
Full article ">Figure 3
<p>Flowchart of IPSO-RL framework.</p>
Full article ">Figure 4
<p>Cumulative reward with respect to the number of episodes for different values of <math display="inline"><semantics> <mi>α</mi> </semantics></math>, <math display="inline"><semantics> <mi>γ</mi> </semantics></math>, and <math display="inline"><semantics> <mi>ϵ</mi> </semantics></math>.</p>
Full article ">Figure 5
<p>Scale where the improvement in the learning process occurs for IPSO-DRL with the energy model.</p>
Full article ">Figure 6
<p>Reward curve for IPSO-RL with the energy model.</p>
Full article ">Figure 7
<p>Energy consumption during the learning process.</p>
Full article ">Figure 8
<p>Scale where the improvement in the learning process occurs for IPSO-RL without the energy model.</p>
Full article ">Figure 9
<p>Reward curve for IPSO-RL without the energy model.</p>
Full article ">Figure 10
<p>Moving average curve for IPSO with the energy model.</p>
Full article ">Figure 11
<p>Moving average curve for IPSO with the energy model.</p>
Full article ">Figure 12
<p>Reward curves for IPSO-DRL.</p>
Full article ">Figure 13
<p>Reward curve for the recent study.</p>
Full article ">
17 pages, 4216 KiB  
Article
Research on Building Energy Consumption Prediction Based on Improved PSO Fusion LSSVM Model
by Suli Zhang, Yiting Chang, Hui Li and Guanghao You
Energies 2024, 17(17), 4329; https://doi.org/10.3390/en17174329 - 29 Aug 2024
Viewed by 384
Abstract
In urban building management, accurate prediction of building energy consumption is significant in realizing energy conservation and improving energy efficiency. Due to the complexity and variability of energy consumption data, existing prediction models face the challenge of difficult parameter selection, which directly affects [...] Read more.
In urban building management, accurate prediction of building energy consumption is significant in realizing energy conservation and improving energy efficiency. Due to the complexity and variability of energy consumption data, existing prediction models face the challenge of difficult parameter selection, which directly affects their accuracy and application. To solve this problem, this study proposes an improved particle swarm algorithm (IPSO) for optimizing the parameters of the least squares support vector machine (LSSVM) and constructing an energy consumption prediction model based on IPSO-LSSVM. The model fully combines the advantages of LSSVM in terms of nonlinear fitting and generalization ability and uses the IPSO algorithm to adjust the parameters precisely. By analyzing the sample data characteristics and validating them on two different types of building energy consumption datasets, the results of the study show that, compared with traditional baseline models such as back-propagation neural networks (BP) and support vector regression (SVR), the model proposed in this study is more accurate and efficient in parameter selection and significantly reduces the prediction error rate. This improved approach not only improves the accuracy of building energy consumption prediction but also enhances the robustness and adaptability of the model, which provides reliable methodological support for the development of more effective energy-saving strategies and optimization of energy use to achieve the goal of energy-saving and consumption reduction and provides a new solution for the future management of building energy consumption. Full article
(This article belongs to the Section G: Energy and Buildings)
Show Figures

Figure 1

Figure 1
<p>Simplified principle of particle swarm optimization.</p>
Full article ">Figure 2
<p>LSSVM model structure.</p>
Full article ">Figure 3
<p>IPSO-LSSVM model architecture Figure.</p>
Full article ">Figure 4
<p>Sample office building energy consumption data.</p>
Full article ">Figure 5
<p>Sample of science and education building energy consumption data.</p>
Full article ">Figure 6
<p>Comparison of energy consumption prediction results of six models in office building: (<b>a</b>) RF; (<b>b</b>) SVR; (<b>c</b>) BP; (<b>d</b>) LSSVM; (<b>e</b>) PSO-LSSVM; (<b>f</b>) IPSO-LSSVM.</p>
Full article ">Figure 7
<p>Histogram of evaluation indicators of the prediction model.</p>
Full article ">Figure 8
<p>Comparison of prediction results of six different models in science and education Building: (<b>a</b>) RF; (<b>b</b>) SVR; (<b>c</b>) BP; (<b>d</b>) LSSVM; (<b>e</b>) PSO-LSSVM; (<b>f</b>) IPSO-LSSVM.</p>
Full article ">Figure 9
<p>Histogram of model prediction evaluation indicators.</p>
Full article ">
19 pages, 4589 KiB  
Article
A Novel Approach for State of Health Estimation of Lithium-Ion Batteries Based on Improved PSO Neural Network Model
by Rashid Nasimov, Deepak Kumar, M. Rizwan, Amrish K. Panwar, Akmalbek Abdusalomov and Young-Im Cho
Processes 2024, 12(9), 1806; https://doi.org/10.3390/pr12091806 - 26 Aug 2024
Viewed by 514
Abstract
The operation and maintenance of futuristic electric vehicles need accurate estimation of the state of health (SOH) of lithium-ion batteries (LIBs). To address this issue, a robust neural network framework is proposed to estimate the SOH. This article developed a novel approach that [...] Read more.
The operation and maintenance of futuristic electric vehicles need accurate estimation of the state of health (SOH) of lithium-ion batteries (LIBs). To address this issue, a robust neural network framework is proposed to estimate the SOH. This article developed a novel approach that combines improved particle swarm optimization (IPSO) with bidirectional long short-term memory (Bi-LSTM) to effectively address the issue of precisely estimating SOH. The proposed IPSO-Bi-LSTM model is more effective than the other models for SOH estimation. This is because Bi-LSTM can capture both past and future appropriate information, making it more suitable for modeling complicated temporal sequences. The IPSO main objective is to optimize the model hyperparameters. To increase the model’s accuracy, the IPSO improves the parameters. The PSO-Bi-LSTM model performed better than the other approaches, according to experimental findings based on the NASA-PCOE battery dataset, and all of the SOH estimated outcomes, such as root mean square errors, were less than 0.50%. This result suggests that the proposed PSO-Bi-LSTM model has the ability to robustly estimate the SOH with a high accuracy. Full article
(This article belongs to the Section Energy Systems)
Show Figures

Figure 1

Figure 1
<p>Proposed framework for SOH estimation of LIBs.</p>
Full article ">Figure 2
<p>The IPSO algorithm flow chart.</p>
Full article ">Figure 3
<p>LSTM model structure.</p>
Full article ">Figure 4
<p>Bidirectional LSTM model structure.</p>
Full article ">Figure 5
<p>The IPSO-Bi-LSTM structure.</p>
Full article ">Figure 6
<p>Different capacities of battery deterioration graphs.</p>
Full article ">Figure 7
<p>Estimation performance (<b>a</b>) estimation result of B5 battery (<b>b</b>) estimation error.</p>
Full article ">Figure 8
<p>Estimation performance (<b>a</b>) estimation result of B6 battery (<b>b</b>) estimation error.</p>
Full article ">Figure 9
<p>Estimation performance (<b>a</b>) estimation result of B7 battery (<b>b</b>) estimation error.</p>
Full article ">Figure 10
<p>Estimation performance (<b>a</b>) estimation result of B18 battery (<b>b</b>) estimation error.</p>
Full article ">
22 pages, 2607 KiB  
Article
A Method to Optimize Deployment of Directional Sensors for Coverage Enhancement in the Sensing Layer of IoT
by Peng Wang and Yonghua Xiong
Future Internet 2024, 16(8), 302; https://doi.org/10.3390/fi16080302 - 22 Aug 2024
Viewed by 321
Abstract
Directional sensor networks are a widely used architecture in the sensing layer of the Internet of Things (IoT), which has excellent data collection and transmission capabilities. The coverage hole caused by random deployment of sensors is the main factor restricting the quality of [...] Read more.
Directional sensor networks are a widely used architecture in the sensing layer of the Internet of Things (IoT), which has excellent data collection and transmission capabilities. The coverage hole caused by random deployment of sensors is the main factor restricting the quality of data collection in the IoT sensing layer. Determining how to enhance coverage performance by repairing coverage holes is a very challenging task. To this end, we propose a node deployment optimization method to enhance the coverage performance of the IoT sensing layer. Firstly, with the goal of maximizing the effective coverage area, an improved particle swarm optimization (IPSO) algorithm is used to solve and obtain the optimal set of sensing directions. Secondly, we propose a repair path search method based on the improved sparrow search algorithm (ISSA), using the minimum exposure path (MEP) found as the repair path. Finally, a node scheduling algorithm is designed based on MEP to determine the optimal deployment location of mobile nodes and achieve coverage enhancement. The simulation results show that compared with existing algorithms, the proposed node deployment optimization method can significantly improve the coverage rate of the IoT sensing layer and reduce energy consumption during the redeployment process. Full article
Show Figures

Figure 1

Figure 1
<p>Basic process of the proposed method.</p>
Full article ">Figure 2
<p>The results of executing the ISSA algorithm.</p>
Full article ">Figure 3
<p>Calculation of the length of the uncovered area between sensors.</p>
Full article ">Figure 4
<p>Mobile node redeployment.</p>
Full article ">Figure 5
<p>Visualization of the proposed method. (<b>a</b>) Initial status. (<b>b</b>) Result of adjusting the sensing direction algorithm. (<b>c</b>) The result of executing an iteration. (<b>d</b>) Final result.</p>
Full article ">Figure 6
<p>Comparison of coverage rate under various numbers of sensors: (<b>a</b>) ROI = 100 m × 100 m, (<b>b</b>) ROI = 200 m × 200 m, (<b>c</b>) ROI = 300 m × 300 m.</p>
Full article ">Figure 7
<p>Comparison of coverage rate under various sensing angles: (<b>a</b>) ROI = 100 m × 100 m, (<b>b</b>) ROI = 200 m × 200 m, (<b>c</b>) ROI = 300 m × 300 m.</p>
Full article ">Figure 8
<p>Comparison of coverage rate under various sensing radii.</p>
Full article ">Figure 9
<p>Comparison of coverage rate.</p>
Full article ">Figure 10
<p>Comparison of redundant rate.</p>
Full article ">Figure 11
<p>Comparison of moving distance. (<b>a</b>) Results of different number of stationary sensors. (<b>b</b>) Results of different sensing angles. (<b>c</b>) Results of different sensing radius.</p>
Full article ">
21 pages, 13232 KiB  
Article
Research on the Fault Diagnosis Method of Rotating Machinery Based on Improved Variational Modal Decomposition and Probabilistic Neural Network Algorithm
by Zhangjie Li, Chao Zou, Zhimin Chen, Hong Lu, Shiwen Xie, Wei Zhang and Jiaqi He
Appl. Sci. 2024, 14(16), 7380; https://doi.org/10.3390/app14167380 - 21 Aug 2024
Viewed by 392
Abstract
The fault diagnosis of rotating machinery is vital in industry but traditionally depends on manual expertise, requiring substantial resources. To improve diagnostic accuracy, enable effective condition monitoring, and minimize the impact of faults on operations, advanced diagnostic techniques are essential. Hence, we propose [...] Read more.
The fault diagnosis of rotating machinery is vital in industry but traditionally depends on manual expertise, requiring substantial resources. To improve diagnostic accuracy, enable effective condition monitoring, and minimize the impact of faults on operations, advanced diagnostic techniques are essential. Hence, we propose an advanced fault diagnosis framework that leverages improved particle swarm optimization (IPSO), variational mode decomposition (VMD), and probabilistic neural networks (PNN) to accurately diagnose faults in rotating machinery using gear and rolling bearing vibration signals. Initially, the vibration signals are decomposed into intrinsic mode functions via VMD, enabling the capture of subtle but critical fault features. To address parameter selection challenges in VMD, we employed IPSO to optimize the VMD parameters, ensuring the optimal decomposition effect. Further, we refined the feature set by applying Laplace fraction optimization and feature dimensionality reduction, isolating sensitive features that serve as input to a PNN-based fault classification model. Experimental results demonstrated that this IPSO-VMD-PNN framework achieves high diagnostic accuracy for various fault types, establishing it as an effective tool for fault identification in rotating machinery. Full article
Show Figures

Figure 1

Figure 1
<p>Comparison of PSO algorithms.</p>
Full article ">Figure 2
<p>IPSO-VMD algorithm design diagram.</p>
Full article ">Figure 3
<p>Time-domain waveform of rolling bearing fault simulation signal <math display="inline"><semantics> <mrow> <mi>f</mi> <mfenced> <mi>t</mi> </mfenced> </mrow> </semantics></math> and its components.</p>
Full article ">Figure 4
<p>Simulation signal <math display="inline"><semantics> <mrow> <mi>f</mi> <mfenced> <mi>t</mi> </mfenced> </mrow> </semantics></math> time-domain waveform and its spectrum.</p>
Full article ">Figure 5
<p>Envelope waveform and envelope spectrum of simulation signal <math display="inline"><semantics> <mrow> <mi>f</mi> <mfenced> <mi>t</mi> </mfenced> </mrow> </semantics></math>.</p>
Full article ">Figure 6
<p>VMD decomposition results of rolling bearing fault simulation signal <math display="inline"><semantics> <mrow> <mi>f</mi> <mfenced> <mi>t</mi> </mfenced> </mrow> </semantics></math>.</p>
Full article ">Figure 7
<p>Basic structure of PNN.</p>
Full article ">Figure 8
<p>Gearbox transmission diagram.</p>
Full article ">Figure 9
<p>Time-domain diagram of gear data in three different conditions.</p>
Full article ">Figure 10
<p>IMF component correlation coefficient of gear data.</p>
Full article ">Figure 11
<p>Energy ratio of IMF components for gear data in different conditions.</p>
Full article ">Figure 12
<p>Gear fault diagnosis confusion matrix.</p>
Full article ">Figure 13
<p>CWRU bearing data center test bench.</p>
Full article ">Figure 14
<p>IMF component correlation coefficient of rolling bearing data.</p>
Full article ">Figure 15
<p>Energy ratio of IMF components for rolling bearing data of different states.</p>
Full article ">Figure 16
<p>Confusion matrix of rolling bearing fault diagnosis.</p>
Full article ">
17 pages, 977 KiB  
Article
A Hybrid Intelligent Optimization Algorithm Based on a Learning Strategy
by Wanyi Deng, Xiaoxue Ma and Weiliang Qiao
Mathematics 2024, 12(16), 2570; https://doi.org/10.3390/math12162570 - 20 Aug 2024
Viewed by 456
Abstract
To overcome the limitations of single-type intelligent optimization algorithms prone to becoming stuck in local optima for complex problems, a hybrid intelligent optimization algorithm named SDIQ is proposed. This algorithm combines simulated annealing (SA), differential evolution (DE), quantum-behaved particle swarm optimization (QPSO), and [...] Read more.
To overcome the limitations of single-type intelligent optimization algorithms prone to becoming stuck in local optima for complex problems, a hybrid intelligent optimization algorithm named SDIQ is proposed. This algorithm combines simulated annealing (SA), differential evolution (DE), quantum-behaved particle swarm optimization (QPSO), and improved particle swarm optimization (IPSO) into a unified framework. Initially, SA is used to explore the solution space and guide individuals toward preliminary optimization. The individuals are then ranked by fitness and divided into three subpopulations, each optimized by DE, QPSO, and IPSO, respectively. After each iteration, probabilistic learning based on fitness logarithms facilitates mutual learning among subpopulations, enabling global information sharing and improvement. The experimental results demonstrate that SDIQ exhibits strong global search capability and stability in solving both standard test functions and real-world engineering problems. Compared to traditional algorithms, SDIQ enhances global convergence and solution efficiency by integrating multiple optimization strategies and leveraging inter-individual learning, providing an effective solution for complex optimization problems. Full article
(This article belongs to the Special Issue Mathematics and Engineering II)
Show Figures

Figure 1

Figure 1
<p>SDIQ algorithm flowchart.</p>
Full article ">Figure 2
<p>The fitness of various swarm optimal particles varies with iteration.</p>
Full article ">
31 pages, 10340 KiB  
Article
Research on Coupling Knowledge Embedding and Data-Driven Deep Learning Models for Runoff Prediction
by Yanling Li, Junfang Wei, Qianxing Sun and Chunyan Huang
Water 2024, 16(15), 2130; https://doi.org/10.3390/w16152130 - 27 Jul 2024
Viewed by 673
Abstract
Accurate runoff prediction is crucial for watershed water resource management, flood prevention, and hydropower station scheduling. Data-driven models have been increasingly applied to runoff prediction tasks and have achieved impressive results. However, existing data-driven methods may produce unreasonable predictions due to the lack [...] Read more.
Accurate runoff prediction is crucial for watershed water resource management, flood prevention, and hydropower station scheduling. Data-driven models have been increasingly applied to runoff prediction tasks and have achieved impressive results. However, existing data-driven methods may produce unreasonable predictions due to the lack of prior knowledge guidance. This study proposes a multivariate runoff prediction model that couples knowledge embedding with data-driven approaches, integrating information contained in runoff probability distributions as constraints into the data-driven model and optimizing the existing loss function with prior probability density functions (PDFs). Using the main stream in the Yellow River Basin with nine hydrological stations as an example, we selected runoff feature factors using the transfer entropy method, chose a temporal convolutional network (TCN) as the data-driven model, and optimized model parameters with the IPSO algorithm, studying univariate input models (TCN-UID), multivariable input models (TCN-MID), and the coupling model. The results indicate the following: (1) Among numerous influencing factors, precipitation, sunshine duration, and relative humidity are the key feature factors driving runoff occurrence; (2) the coupling model can effectively fit the extremes of runoff sequences, improving prediction accuracy in the training set by 6.9% and 4.7% compared to TCN-UID and TCN-MID, respectively, and by 5.7% and 2.8% in the test set. The coupling model established through knowledge embedding not only retains the advantages of data-driven models but also effectively addresses the poor prediction performance of data-driven models at extremes, thereby enhancing the accuracy of runoff predictions. Full article
(This article belongs to the Special Issue Hydroinformatics in Hydrology)
Show Figures

Figure 1

Figure 1
<p>Study area. The red triangles represent the nine hydrological stations on the main stem of the Yellow River, while the blue markers indicate meteorological stations located spatially close to these hydrological stations.</p>
Full article ">Figure 2
<p>Flowchart of runoff prediction model structure.</p>
Full article ">Figure 3
<p>Comparison of iterative optimization results.</p>
Full article ">Figure 4
<p>Causal convolution.</p>
Full article ">Figure 5
<p>Dilatational convolution.</p>
Full article ">Figure 6
<p>Residual module.</p>
Full article ">Figure 7
<p>IPSO-TCN model flow.</p>
Full article ">Figure 8
<p>Diagram of the classification of knowledge-embedding algorithms.</p>
Full article ">Figure 9
<p>Coupled data-driven and knowledge-embedded architecture. In the data-driven model (TCN), the pink dots are the neurons in the input layer, the blue dots are the neurons in the hidden layer, and the yellow dots are the neurons in the output layer.</p>
Full article ">Figure 10
<p>Runoff evolution trend. (<b>a</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1964–1973. (<b>b</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1974–1983. (<b>c</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1984–1993. (<b>d</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1994–2003. (<b>e</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin from 2004 to 2013. (<b>f</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 2014–2023.</p>
Full article ">Figure 10 Cont.
<p>Runoff evolution trend. (<b>a</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1964–1973. (<b>b</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1974–1983. (<b>c</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1984–1993. (<b>d</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 1994–2003. (<b>e</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin from 2004 to 2013. (<b>f</b>) is the spatial and temporal distribution of runoff in the Yellow River Basin during 2014–2023.</p>
Full article ">Figure 11
<p>Drought evolution trend. (<b>a</b>) shows the spatial and temporal distribution of drought frequency in the Yellow River Basin during 1964–1973, and (<b>b</b>) shows the spatial and temporal distribution of drought frequency in the Yellow River Basin during 1974–1983. (<b>c</b>) shows the spatial and temporal distribution of drought frequency in the Yellow River Basin during 1984–1993, (<b>d</b>) shows the spatial and temporal distribution of drought frequency in the Yellow River Basin during 1994–2003, and (<b>e</b>) shows the spatial and temporal distribution of drought frequency in the Yellow River Basin during 2004–2013. (<b>f</b>) shows the spatial and temporal distribution of drought frequency in the Yellow River Basin during 2014–2023.</p>
Full article ">Figure 12
<p>Cross-wavelet power spectrum and coherence spectrum. (<b>a</b>) is the cross wavelet power spectrum of precipitation and runoff, which mainly shows the periodicity of precipitation and runoff. (<b>b</b>) is the cross wavelet coherence spectrum of precipitation runoff, which mainly shows the time-lag relationship of precipitation runoff.</p>
Full article ">Figure 13
<p>Information transfer relationship network. (<b>a</b>) is to calculate the degree of influence of meteorological factors on runoff, and (<b>b</b>) is to calculate the degree of influence of runoff on meteorological factors.</p>
Full article ">Figure 14
<p>Prediction results of the three models.</p>
Full article ">Figure 15
<p>Taylor diagrams of the four models.</p>
Full article ">Figure 16
<p>Comparison of prediction effect of three models. (<b>a</b>–<b>d</b>) shows that the TCN-UID model has poor prediction effect at the runoff minimum, and the TCN-MID model has poor prediction effect at the runoff maximum, and the coupling model has the best prediction effect, which can well adapt to the nonlinear and non-stationary nature of runoff.</p>
Full article ">Figure 16 Cont.
<p>Comparison of prediction effect of three models. (<b>a</b>–<b>d</b>) shows that the TCN-UID model has poor prediction effect at the runoff minimum, and the TCN-MID model has poor prediction effect at the runoff maximum, and the coupling model has the best prediction effect, which can well adapt to the nonlinear and non-stationary nature of runoff.</p>
Full article ">
20 pages, 5321 KiB  
Article
Strip Steel Defect Prediction Based on Improved Immune Particle Swarm Optimisation–Improved Synthetic Minority Oversampling Technique–Stacking
by Zhi Fang, Fan Zhang, Su Yu and Bintao Wang
Appl. Sci. 2024, 14(13), 5849; https://doi.org/10.3390/app14135849 - 4 Jul 2024
Viewed by 677
Abstract
A model framework for the prediction of defects in strip steel is proposed with the objective of enhancing the accuracy of defect detection. Initially, the data are balanced through the utilisation of the Improved Synthetic Minority Oversampling Technique (ISmote), which is based on [...] Read more.
A model framework for the prediction of defects in strip steel is proposed with the objective of enhancing the accuracy of defect detection. Initially, the data are balanced through the utilisation of the Improved Synthetic Minority Oversampling Technique (ISmote), which is based on clustering techniques. Subsequently, further enhancements are made to the inertia weights and learning factors of the immune particle swarm optimisation (IPSO), with additional optimisations in speed updates and population diversity. These enhancements are designed to address the issue of premature convergence at the early stages of the process and local optima at the later stages. Finally, a prediction model is then constructed based on stacking, with its hyperparameters optimised through the improved immune particle swarm optimisation (IIPSO). The results of the experimental trials demonstrate that the IIPSO-ISmote-Stacking model framework exhibits superior prediction performance when compared to other models. The Macro_Precision, Macro_Recall, and Macro_F1 values for this framework are 93.3%, 93.6%, and 92.2%, respectively. Full article
(This article belongs to the Special Issue Artificial Intelligence Applications in Industry)
Show Figures

Figure 1

Figure 1
<p>Result of data encoding.</p>
Full article ">Figure 2
<p>Cluster distribution.</p>
Full article ">Figure 3
<p>Process of generating the synthetic samples.</p>
Full article ">Figure 4
<p>Change curve of inertia weight.</p>
Full article ">Figure 5
<p>Change curve of learning factors.</p>
Full article ">Figure 6
<p>Contrast effect of improved Bernoulli algorithm. (<b>a</b>) Distribution before treatment; (<b>b</b>) distribution after treatment.</p>
Full article ">Figure 7
<p>Comparison of mutation probability and random number.</p>
Full article ">Figure 8
<p>Process of particle optimization.</p>
Full article ">Figure 9
<p>Stacking framework.</p>
Full article ">Figure 10
<p>Model framework.</p>
Full article ">Figure 11
<p>Effect of synthesising samples. (<b>a</b>) Original data; (<b>b</b>) Smote algorithm; (<b>c</b>) Borderline-Smote algorithm; (<b>d</b>) SVMSmote algorithm; (<b>e</b>) ADASYN algorithm; (<b>f</b>) Smote-IPF algorithm; (<b>g</b>) RSmote algorithm; and (<b>h</b>) ISmote algorithm.</p>
Full article ">Figure 12
<p>Evolution curve of test functions: (<b>a</b>) fitness value of f<sub>1</sub> function; (<b>b</b>) fitness value of f<sub>2</sub> function; (<b>c</b>) fitness value of f<sub>3</sub> function; (<b>d</b>) fitness value of f<sub>4</sub> function; and (<b>e</b>) fitness value of f<sub>5</sub> function.</p>
Full article ">Figure 12 Cont.
<p>Evolution curve of test functions: (<b>a</b>) fitness value of f<sub>1</sub> function; (<b>b</b>) fitness value of f<sub>2</sub> function; (<b>c</b>) fitness value of f<sub>3</sub> function; (<b>d</b>) fitness value of f<sub>4</sub> function; and (<b>e</b>) fitness value of f<sub>5</sub> function.</p>
Full article ">Figure 13
<p>Comparison of the prediction: (<b>a</b>) response time and system resource usage; (<b>b</b>) prediction performance.</p>
Full article ">Figure 14
<p>ROC curves of the IIPSO_ISmote_Stacking model.</p>
Full article ">Figure 15
<p>Identified strip steel defects: (<b>a</b>) Defect 1; (<b>b</b>) Defect 3; and (<b>c</b>) Defect 5.</p>
Full article ">
22 pages, 319 KiB  
Article
The More Democracy, the Better? On Whether Democracy Makes Societies Open
by Cristian López
Soc. Sci. 2024, 13(5), 261; https://doi.org/10.3390/socsci13050261 - 13 May 2024
Viewed by 1015
Abstract
It is a common view that Popper’s defense of the open society has been a defense of Western, liberal democracies. This seems to imply that by fostering democratic institutions we are ipso facto fostering open societies. I criticize this view by arguing that [...] Read more.
It is a common view that Popper’s defense of the open society has been a defense of Western, liberal democracies. This seems to imply that by fostering democratic institutions we are ipso facto fostering open societies. I criticize this view by arguing that in-built incentives in democratic mechanisms move us away from (or hamper) the open society. Democracy promotes voters’ ignorance, indulges voters’ irrationality, and allows voters to externalize costs. This is contrary to well-informed, rational decisions and personal responsibility that lie at the fundamentals of the open society. I suggest that it has been free-market capitalism, or free-market societies, which has moved us closer to the ideal of the open society and which best realizes open society’s values. Full article
14 pages, 2026 KiB  
Article
Mucolytic Drugs Ambroxol and Bromhexine: Transformation under Aqueous Chlorination Conditions
by Sergey A. Sypalov, Ilya S. Varsegov, Nikolay V. Ulyanovskii, Albert T. Lebedev and Dmitry S. Kosyakov
Int. J. Mol. Sci. 2024, 25(10), 5214; https://doi.org/10.3390/ijms25105214 - 10 May 2024
Cited by 1 | Viewed by 746
Abstract
Bromhexine and ambroxol are among the mucolytic drugs most widely used to treat acute and chronic respiratory diseases. Entering the municipal wastewater and undergoing transformations during disinfection with active chlorine, these compounds can produce nitrogen- and bromine-containing disinfection by-products (DBPs) that are dangerous [...] Read more.
Bromhexine and ambroxol are among the mucolytic drugs most widely used to treat acute and chronic respiratory diseases. Entering the municipal wastewater and undergoing transformations during disinfection with active chlorine, these compounds can produce nitrogen- and bromine-containing disinfection by-products (DBPs) that are dangerous for aquatic ecosystems. In the present study, primary and deep degradation products of ambroxol and bromhexine obtained in model aquatic chlorination experiments were studied via the combination of high-performance liquid and gas chromatography with high-resolution mass spectrometry. It was shown that at the initial stages, the reactions of cyclization, hydroxylation, chlorination, electrophilic ipso-substitution of bromine atoms with chlorine, and oxidative N-dealkylation occur. Along with known metabolites, a number of novel primary DBPs were tentatively identified based on their elemental compositions and tandem mass spectra. Deep degradation of bromhexine and ambroxol gives twenty-four identified volatile and semi-volatile compounds of six classes, among which trihalomethanes account for more than 50%. The specific class of bromhexine- and ambroxol-related DBPs are bromine-containing haloanilines. Seven of them, including methoxy derivatives, were first discovered in the present study. One more novel class of DBPs associated with bromhexine and ambroxol is represented by halogenated indazoles formed through dealkylation of the primary transformation products containing pyrazoline or tetrahydropyrimidine cycle in their structure. Full article
(This article belongs to the Section Molecular Pharmacology)
Show Figures

Figure 1

Figure 1
<p>The structural formulas of ambroxol (<b>a</b>) and bromhexine (<b>b</b>).</p>
Full article ">Figure 2
<p>Bromhexine degradation pathways and primary transformation products formed during the aqueous chlorination.</p>
Full article ">Figure 3
<p>Scheme of the formation of detected DBPs during the interaction of ambroxol with active chlorine.</p>
Full article ">Figure 4
<p>Chromatographic peak areas of parent compounds and primary transformation products of bromhexine (<b>a</b>,<b>b</b>) and ambroxol (<b>c</b>,<b>d</b>) at active chlorine concentrations of 4 (<b>a</b>,<b>c</b>) and 7 (<b>b</b>,<b>d</b>) mg L<sup>−1</sup> depending on the reaction time.</p>
Full article ">
21 pages, 2214 KiB  
Article
Photovoltaic Solar Power Prediction Using iPSO-Based Data Clustering and AdaLSTM Network
by Jincun Liu, Kangji Li and Wenping Xue
Energies 2024, 17(7), 1624; https://doi.org/10.3390/en17071624 - 28 Mar 2024
Viewed by 710
Abstract
Due to the increasing integration of photovoltaic (PV) solar power into power systems, the prediction of PV solar power output plays an important role in power system planning and management. This study combines an optimized data clustering method with a serially integrated AdaLSTM [...] Read more.
Due to the increasing integration of photovoltaic (PV) solar power into power systems, the prediction of PV solar power output plays an important role in power system planning and management. This study combines an optimized data clustering method with a serially integrated AdaLSTM network to improve the accuracy and robustness of PV solar power prediction. During the data clustering process, the Euclidean distance-based clustering centroids are optimized by an improved particle swarm optimization (iPSO) algorithm. For each obtained data cluster, the AdaLSTM network is utilized for model training, in which multiple LSTMs are serially combined together through the AdaBoost algorithm. For PV power prediction tasks, the inputs of the testing set are classified into the nearest data cluster by the K-nearest neighbor (KNN) method, and then the corresponding AdaLSTM network of this cluster is used to perform the prediction. Case studies from two real PV stations are used for prediction performance evaluation. Results based on three prediction horizons (10, 30 and 60 min) demonstrate that the proposed model combining the optimized data clustering and AdaLSTM has higher prediction accuracy and robustness than other comparison models. The root mean square error (RMSE) of the proposed model is reduced, respectively, by 75.22%, 73.80%, 67.60%, 66.30%, and 64.85% compared with persistence, BPNN, CNN, LSTM, and AdaLSTM without clustering (Case A, 30 min prediction). Even compared with the model combining the K-means clustering and AdaLSTM, the RMSE can be reduced by 10.75%. Full article
Show Figures

Figure 1

Figure 1
<p>Flowchart of iPSO-based data clustering.</p>
Full article ">Figure 2
<p>Structure of AdaLSTM model.</p>
Full article ">Figure 3
<p>Overall prediction framework.</p>
Full article ">Figure 4
<p>Prediction output scatter plots of different models (Case A, no clustering).</p>
Full article ">Figure 5
<p>Radar plot of performance metrics (Case A, no clustering): (<b>a</b>) RMSE, (<b>b</b>) MAE, (<b>c</b>) <math display="inline"><semantics> <msup> <mi>R</mi> <mn>2</mn> </msup> </semantics></math>.</p>
Full article ">Figure 6
<p>Convergence graphs of eight benchmark functions using PSO and iPSO.</p>
Full article ">Figure 7
<p>Convergence graph of clustering centroid optimization using different algorithms (Case A).</p>
Full article ">Figure 8
<p>Prediction curves (Case A, 8 February 2020–16 February 2020): (<b>a</b>) 10 min prediction, (<b>b</b>) 30 min prediction, (<b>c</b>) 60 min prediction.</p>
Full article ">Figure 9
<p>Prediction curves (Case B, 15 February 2020–23 February 2020): (<b>a</b>) 10 min prediction, (<b>b</b>) 30 min prediction, (<b>c</b>) 60 min prediction.</p>
Full article ">Figure 10
<p>Prediction curves (Case A, from 5:30 to 20:00 on 11 February 2020): (<b>a</b>) 10 min prediction, (<b>b</b>) 30 min prediction, (<b>c</b>) 60 min prediction.</p>
Full article ">Figure 11
<p>Prediction curves (Case B, from 5:30 to 20:00 on 21 February 2020): (<b>a</b>) 10 min prediction, (<b>b</b>) 30 min prediction, (<b>c</b>) 60 min prediction.</p>
Full article ">
26 pages, 1517 KiB  
Article
Energy-Efficient Internet of Drones Path-Planning Study Using Meta-Heuristic Algorithms
by Gamil Ahmed, Tarek Sheltami, Mustafa Ghaleb, Mosab Hamdan, Ashraf Mahmoud and Ansar Yasar
Appl. Sci. 2024, 14(6), 2418; https://doi.org/10.3390/app14062418 - 13 Mar 2024
Cited by 1 | Viewed by 1295
Abstract
The increasing popularity of unmanned aerial vehicles (UAVs), commonly known as drones, in various fields is primarily due to their agility, quick deployment, flexibility, and excellent mobility. Particularly, the Internet of Drones (IoD)—a networked UAV system—has gained broad-spectrum attention for its potential applications. [...] Read more.
The increasing popularity of unmanned aerial vehicles (UAVs), commonly known as drones, in various fields is primarily due to their agility, quick deployment, flexibility, and excellent mobility. Particularly, the Internet of Drones (IoD)—a networked UAV system—has gained broad-spectrum attention for its potential applications. However, threat-prone environments, characterized by obstacles, pose a challenge to the safety of drones. One of the key challenges in IoD formation is path planning, which involves determining optimal paths for all UAVs while avoiding obstacles and other constraints. Limited battery life is another challenge that limits the operation time of UAVs. To address these issues, drones require efficient collision avoidance and energy-efficient strategies for effective path planning. This study focuses on using meta-heuristic algorithms, recognized for their robust global optimization capabilities, to solve the UAV path-planning problem. We model the path-planning problem as an optimization problem that aims to minimize energy consumption while considering the threats posed by obstacles. Through extensive simulations, this research compares the effectiveness of particle swarm optimization (PSO), improved PSO (IPSO), comprehensively improved PSO (CIPSO), the artificial bee colony (ABC), and the genetic algorithm (GA) in optimizing the IoD’s path planning in obstacle-dense environments. Different performance metrics have been considered, such as path optimality, energy consumption, straight line rate (SLR), and relative percentage deviation (RPD). Moreover, a nondeterministic test is applied, and a one-way ANOVA test is obtained to validate the results for different algorithms. Results indicate IPSO’s superior performance in terms of IoD formation stability, convergence speed, and path length efficiency, albeit with a longer run time compared to PSO and ABC. Full article
(This article belongs to the Special Issue Intelligent Transportation System Technologies and Applications)
Show Figures

Figure 1

Figure 1
<p>Genetic algorithm for UAV path planning: blue dots represent obstacles, green dots represent source/destination, and gray dots represent the waypoints.</p>
Full article ">Figure 2
<p>Graphical representation of PSO evolution.</p>
Full article ">Figure 3
<p>Flowchart of the study process.</p>
Full article ">Figure 4
<p>Two-dimensional view for path planning for the four approaches: (<b>a</b>) PSO, (<b>b</b>) IPSO, (<b>c</b>) ABC, and (<b>d</b>) GA. The drones fly from starting locations to their destinations.</p>
Full article ">Figure 5
<p>Comparison of the IoD path optimality and convergence curves.</p>
Full article ">Figure 6
<p>SLR normality test.</p>
Full article ">Figure 7
<p>SLR confidence interval.</p>
Full article ">Figure 8
<p>SLR Tukey pair-wise comparison.</p>
Full article ">Figure 9
<p>RPD normality test.</p>
Full article ">Figure 10
<p>RPD confidence interval.</p>
Full article ">Figure 11
<p>RPD Tukey pair-wise comparison.</p>
Full article ">Figure 12
<p>(<b>a</b>) SLR and (<b>b</b>) RPD of the IoD formation for all algorithms.</p>
Full article ">Figure 13
<p>Average execution time.</p>
Full article ">Figure 14
<p>Two-dimensional view of paths for 18 UAVs navigating in environment filled with 24 obstacles.</p>
Full article ">
11 pages, 2267 KiB  
Article
Synthesis, Crystal Structure, and Electrochemistry of Mono- and Bis-Homoannular Ferrocene Derivatives
by Uttam R. Pokharel, Derek P. Daigle, Stone D. Naquin, Gwyneth S. Engeron, Mary A. Lo and Frank R. Fronczek
Crystals 2024, 14(2), 141; https://doi.org/10.3390/cryst14020141 - 30 Jan 2024
Cited by 1 | Viewed by 2128
Abstract
Two ferrocene derivatives, namely, 1,2-(tetramethylene)-ferrocene and 1,2,1′,2′-bis(tetramethylene)-ferrocene, were synthesized in a four-step reaction sequence starting from ferrocene. Friedel–Crafts acylation of ferrocene using succinic anhydride gave mono- or bis(3-carboxypropinoyl)-ferrocene depending on the stoichiometry of succinic anhydride. The reduction of the keto groups to methylene [...] Read more.
Two ferrocene derivatives, namely, 1,2-(tetramethylene)-ferrocene and 1,2,1′,2′-bis(tetramethylene)-ferrocene, were synthesized in a four-step reaction sequence starting from ferrocene. Friedel–Crafts acylation of ferrocene using succinic anhydride gave mono- or bis(3-carboxypropinoyl)-ferrocene depending on the stoichiometry of succinic anhydride. The reduction of the keto groups to methylene followed by ring-closing using trifluoroacetic anhydride gave 1,2-(α-ketotetramethylene)-ferrocene or 1,2,1′,2′-bis(α-ketotetramethylene)-ferrocene. The diastereomeric mixture of the latter diketones was separated using column chromatography, characterized via single-crystal X-ray analysis, and assigned its stereochemistry. Reduction of the keto groups to methylene under Clemmensen conditions gave homoannular mono- or bis(tetramethylene)-ferrocene derivatives. The molecular structure of 1,2-(tetramethylene)-ferrocene revealed that the ipso carbon atoms of the cyclopentadienyl group are 0.023(3) Å farther away from Fe(II) compared to the remaining three carbon atoms. Both complexes exhibit lower half-wave oxidation potentials than ferrocene, possibly due to the electron-releasing effects of the tetramethylene bridges. Full article
(This article belongs to the Special Issue Coordination Complexes: Synthesis, Characterization and Application)
Show Figures

Figure 1

Figure 1
<p>ORTEP diagram of solid-state structure showing the atom-numbering scheme of compound <b>3a.</b> Thermal ellipsoids are drawn at the 50% probability level. Selected bond lengths (Å) for the complex: Fe1–C1 2.0397(9), Fe1–C2 2.0508(8), Fe1–C3 2.0526(6), Fe1–C4 2.0527(7), Fe1–C5 2.0456(9), Fe1–C10 2.0553(7), Fe1–C11 2.0530(8), Fe1–C12 2.045(1), Fe1–C13 2.0548(9), Fe1–C14 2.0554(6), C1–C6 1.465(1), C6–O1 1.2265(9), Cp (centroid, substituted)–Fe 1.647, and Cp (centroid, unsubstituted) 1.655.</p>
Full article ">Figure 2
<p>ORTEP diagram of the solid-state structure showing the atom-numbering scheme of compound <b>3b</b> (meso). Thermal ellipsoids are drawn at the 50% probability level. Selected bond lengths (Å) for the complex: Fe1–C1 2.0397(8), Fe1–C2 2.0627(7), Fe1–C3 2.0605(8), Fe1–C4 2.0664(8), Fe1–C5 2.0511(7), O1–C9 1.2230(9), and Cp (centroid)–Fe 1.660.</p>
Full article ">Figure 3
<p>ORTEP diagram of the solid-state structure showing the atom-numbering scheme of compound <b>3b′</b>. Thermal ellipsoids are drawn at the 50% probability level. The minor component of the disordered O atom is not shown. Selected bond lengths (Å) for the complexes: Fe1–C1 2.0409(7), Fe1–C2 2.0575(7), Fe1–C3 2.0681(7), Fe1–C4 2.0534(7), Fe1–C5 2.0442(7), Fe1–C10 2.0469(6), Fe1–C11 2.0688(6), Fe1–C12 2.0615(7), Fe1–C13 2.0566(7), Fe1–C4 2.0534(7), Fe1–C4 2.0534(7), O2–C9 1.2212(17), and average Cp(Centroid)–Fe 1.652.</p>
Full article ">Figure 4
<p>ORTEP diagram of the solid-state structure showing the atom-numbering scheme of compound <b>4a</b>. Thermal ellipsoids are drawn at the 50% probability level. Selected bond lengths (Å) for the complexes: Fe1–C1 2.049(3), Fe1–C2 2.064(3), Fe1–C3 2.040(3), Fe1–C4 2.034(2), Fe1–C5 2.031(3), Fe1–C10 2.043(3), Fe1–C11 2.036(3), Fe1–C12 2.045(3), Fe1–C13 2.051(3), Fe1–C14 2.042(3), Cp (centroid, substituted)–Fe 1.647, and Cp (centroid, unsubstituted) 1.648.</p>
Full article ">Figure 5
<p>Cyclic voltammogram of Ferrocene (red), <b>4a</b> (blue), and <b>4b</b> (purple).</p>
Full article ">Scheme 1
<p>Synthesis of homoannular ferrocene derivatives.</p>
Full article ">
Back to TopTop