2,382 results
Search Results
202. Defect Detection Algorithm for Wing Skin with Stiffener Based on Phased-Array Ultrasonic Imaging.
- Author
-
Wu, Chuangui, Xu, GuiLi, Shan, Yimeng, Fan, Xin, Zhang, Xiaohui, and Liu, Yaxing
- Subjects
SKIN imaging ,ALGORITHMS ,ULTRASONIC imaging - Abstract
In response to the real-time imaging detection requirements of structural defects in the R region of rib-stiffened wing skin, a defect detection algorithm based on phased-array ultrasonic imaging for wing skin with stiffener is proposed. We select the full-matrix–full-focusing algorithm with the best imaging quality as the prototype for the required detection algorithm. To address the problem of poor real-time performance of the algorithm, a sparsity-based full-focusing algorithm with symmetry redundancy imaging mode is proposed. To address noise artifacts, an adaptive beamforming method and an equal-acoustic-path echo dynamic removal scheme are proposed to adaptively suppress noise artifacts. Finally, within 0.5 s of imaging time, the algorithm achieves a detection sensitivity of 1 mm and a resolution of 0.5 mm within a single-frame imaging range of 30 mm × 30 mm. The defect detection algorithm proposed in this paper combines phased-array ultrasonic technology and post-processing imaging technology to improve the real-time performance and noise artifact suppression of ultrasound imaging algorithms based on engineering applications. Compared with traditional single-element ultrasonic detection technology, phased-array detection technology based on post-processing algorithms has better defect detection and imaging characterization performance and is suitable for R-region structural detection scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
203. Lightweight Object Detection Algorithm for UAV Aerial Imagery.
- Author
-
Wang, Jian, Zhang, Fei, Zhang, Yuesong, Liu, Yahui, and Cheng, Ting
- Subjects
OBJECT recognition (Computer vision) ,ALGORITHMS ,PYRAMIDS - Abstract
Addressing the challenges of low detection precision and excessive parameter volume presented by the high resolution, significant scale variations, and complex backgrounds in UAV aerial imagery, this paper introduces MFP-YOLO, a lightweight detection algorithm based on YOLOv5s. Initially, a multipath inverse residual module is designed, and an attention mechanism is incorporated to manage the issues associated with significant scale variations and abundant interference from complex backgrounds. Then, parallel deconvolutional spatial pyramid pooling is employed to extract scale-specific information, enhancing multi-scale target detection. Furthermore, the Focal-EIoU loss function is utilized to augment the model's focus on high-quality samples, consequently improving training stability and detection accuracy. Finally, a lightweight decoupled head replaces the original model's detection head, accelerating network convergence speed and enhancing detection precision. Experimental results demonstrate that MFP-YOLO improved the mAP50 on the VisDrone 2019 validation and test sets by 12.9% and 8.0%, respectively, compared to the original YOLOv5s. At the same time, the model's parameter volume and weight size were reduced by 79.2% and 73.7%, respectively, indicating that MFP-YOLO outperforms other mainstream algorithms in UAV aerial imagery detection tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
204. Optimization of Tungsten Heavy Alloy Cutting Parameters Based on RSM and Reinforcement Dung Beetle Algorithm.
- Author
-
Zhu, Xu, Ni, Chao, Chen, Guilin, and Guo, Jiang
- Subjects
DUNG beetles ,OPTIMIZATION algorithms ,TUNGSTEN alloys ,ALGORITHMS ,SURFACE roughness ,METAL cutting ,CUTTING force - Abstract
Tungsten heavy alloys (WHAs) are an extremely hard-to-machine material extensively used in demanding applications such as missile liners, aerospace, and optical molds. However, the machining of WHAs remains a challenging task as a result of their high density and elastic stiffness which lead to the deterioration of the machined surface roughness. This paper proposes a brand-new multi-objective dung beetle algorithm. It does not take the cutting parameters (i.e., cutting speed, feed rate, and depth of cut) as the optimization objects but directly optimizes cutting forces and vibration signals monitored using a multi-sensor (i.e., dynamometer and accelerometer). The cutting parameters in the WHA turning process are analyzed through the use of the response surface method (RSM) and the improved dung beetle optimization algorithm. Experimental verification shows that the algorithm has better convergence speed and optimization ability compared with similar algorithms. The optimized forces and vibration are reduced by 9.7% and 46.47%, respectively, and the surface roughness R
a of the machined surface is reduced by 18.2%. The proposed modeling and optimization algorithms are anticipated to be powerful to provide the basis for the parameter optimization in the cutting of WHAs. [ABSTRACT FROM AUTHOR]- Published
- 2023
- Full Text
- View/download PDF
205. Underwater Target Detection Utilizing Polarization Image Fusion Algorithm Based on Unsupervised Learning and Attention Mechanism.
- Author
-
Cheng, Haoyuan, Zhang, Deqing, Zhu, Jinchi, Yu, Hao, and Chu, Jinkui
- Subjects
IMAGE fusion ,OPTICAL polarization ,LIGHT propagation ,FEATURE extraction ,IMAGE processing ,ALGORITHMS - Abstract
Since light propagation in water bodies is subject to absorption and scattering effects, underwater images using only conventional intensity cameras will suffer from low brightness, blurred images, and loss of details. In this paper, a deep fusion network is applied to underwater polarization images; that is, the underwater polarization images are fused with intensity images using the deep learning method. To construct a training dataset, we establish an experimental setup to obtain underwater polarization images and perform appropriate transformations to expand the dataset. Next, an end-to-end learning framework based on unsupervised learning and guided by an attention mechanism is constructed for fusing polarization and light intensity images. The loss function and weight parameters are elaborated. The produced dataset is used to train the network under different loss weight parameters, and the fused images are evaluated based on different image evaluation metrics. The results show that the fused underwater images are more detailed. Compared with light intensity images, the information entropy and standard deviation of the proposed method increase by 24.48% and 139%. The image processing results are better than other fusion-based methods. In addition, the improved U-net network structure is used to extract features for image segmentation. The results show that the target segmentation based on the proposed method is feasible under turbid water. The proposed method does not require manual adjustment of weight parameters, has faster operation speed, and has strong robustness and self-adaptability, which is important for research in vision fields, such as ocean detection and underwater target recognition. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
206. Heterogeneous Algorithm for Efficient-Path Detection and Congestion Avoidance for a Vehicular-Management System.
- Author
-
Noussaiba, Melaouene, Razaque, Abdul, and Rahal, Romadi
- Subjects
END-to-end delay ,ALGORITHMS ,TRAFFIC congestion ,ENERGY consumption ,CITIES & towns - Abstract
Finding reliable and efficient routes is a persistent problem in megacities. To address this problem, several algorithms have been proposed. However, there are still areas of research that require attention. Many traffic-related problems can be resolved with the help of smart cities that incorporate the Internet of Vehicles (IoV). On the other hand, due to rapid increases in the population and automobiles, traffic congestion has become a serious concern. This paper presents a heterogeneous algorithm called ant-colony optimization with pheromone termite (ACO-PT), which combines two state-of-the-art algorithms, pheromone termite (PT) and ant-colony optimization (ACO), to address efficient routing to improve energy efficiency, increase throughput, and shorten end-to-end latency. The ACO-PT algorithm seeks to provide an effective shortest path from a source to a destination for drivers in urban areas. Vehicle congestion is a severe issue in urban areas. To address this issue, a congestion-avoidance module is added to handle potential overcrowding. Automatic vehicle detection has also been a challenging issue in vehicle management. To address this issue, an automatic-vehicle-detection (AVD) module is employed with ACO-PT. The effectiveness of the proposed ACO-PT algorithm is demonstrated experimentally using network simulator-3 (NS-3) and Simulation of Urban Mobility (SUMO). Our proposed algorithm is compared with three cutting-edge algorithms. The results demonstrate that the proposed ACO-PT algorithm is superior to earlier algorithms in terms of energy usage, end-to-end delay, and throughput. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
207. Improving Accuracy of Real-Time Positioning and Path Tracking by Using an Error Compensation Algorithm against Walking Modes.
- Author
-
Gong, Jiale, Li, Ziyang, Chen, Mingzhu, Wang, Hong, and Hu, Dongmo
- Subjects
WIRELESS sensor networks ,ALGORITHMS ,SENSOR placement ,MULTISENSOR data fusion ,POSITION sensors ,MOTION capture (Human mechanics) ,NANOPOSITIONING systems - Abstract
Wide-range application scenarios, such as industrial, medical, rescue, etc., are in various demand for human spatial positioning technology. However, the existing MEMS-based sensor positioning methods have many problems, such as large accuracy errors, poor real-time performance and a single scene. We focused on improving the accuracy of IMU-based both feet localization and path tracing, and analyzed three traditional methods. In this paper, a planar spatial human positioning method based on high-resolution pressure insoles and IMU sensors was improved, and a real-time position compensation method for walking modes was proposed. To validate the improved method, we added two high-resolution pressure insoles to our self-developed motion capture system with a wireless sensor network (WSN) system consisting of 12 IMUs. By multi-sensor data fusion, we implemented dynamic recognition and automatic matching of compensation values for five walking modes, with real-time spatial-position calculation of the touchdown foot, enhancing the 3D accuracy of its practical positioning. Finally, we compared the proposed algorithm with three old methods by statistical analysis of multiple sets of experimental data. The experimental results show that this method has higher positioning accuracy in real-time indoor positioning and path-tracking tasks. The methodology can have more extensive and effective applications in the future. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
208. Research on Apple Recognition Algorithm in Complex Orchard Environment Based on Deep Learning.
- Author
-
Zhao, Zhuoqun, Wang, Jiang, and Zhao, Hui
- Subjects
DEEP learning ,RECOGNITION (Psychology) ,ORCHARDS ,ALGORITHMS ,APPLES ,REFERENCE values - Abstract
In the complex environment of orchards, in view of low fruit recognition accuracy, poor real-time and robustness of traditional recognition algorithms, this paper propose an improved fruit recognition algorithm based on deep learning. Firstly, the residual module was assembled with the cross stage parity network (CSP Net) to optimize recognition performance and reduce the computing burden of the network. Secondly, the spatial pyramid pool (SPP) module is integrated into the recognition network of the YOLOv5 to blend the local and global features of the fruit, thus improving the recall rate of the minimum fruit target. Meanwhile, the NMS algorithm was replaced by the Soft NMS algorithm to enhance the ability of identifying overlapped fruits. Finally, a joint loss function was constructed based on focal and CIoU loss to optimize the algorithm, and the recognition accuracy was significantly improved. The test results show that the MAP value of the improved model after dataset training reaches 96.3% in the test set, which is 3.8% higher than the original model. F1 value reaches 91.8%, which is 3.8% higher than the original model. The average detection speed under GPU reaches 27.8 frames/s, which is 5.6 frames/s higher than the original model. Compared with current advanced detection methods such as Faster RCNN and RetinaNet, among others, the test results show that this method has excellent detection accuracy, good robustness and real-time performance, and has important reference value for solving the problem of accurate recognition of fruit in complex environment. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
209. WARNING: A Wearable Inertial-Based Sensor Integrated with a Support Vector Machine Algorithm for the Identification of Faults during Race Walking.
- Author
-
Taborri, Juri, Palermo, Eduardo, and Rossi, Stefano
- Subjects
SUPPORT vector machines ,NAIVE Bayes classification ,WEARABLE technology ,MACHINE learning ,DECISION trees ,LINEAR acceleration ,ALGORITHMS ,K-nearest neighbor classification - Abstract
Due to subjectivity in refereeing, the results of race walking are often questioned. To overcome this limitation, artificial-intelligence-based technologies have demonstrated their potential. The paper aims at presenting WARNING, an inertial-based wearable sensor integrated with a support vector machine algorithm to automatically identify race-walking faults. Two WARNING sensors were used to gather the 3D linear acceleration related to the shanks of ten expert race-walkers. Participants were asked to perform a race circuit following three race-walking conditions: legal, illegal with loss-of-contact and illegal with knee-bent. Thirteen machine learning algorithms, belonging to the decision tree, support vector machine and k-nearest neighbor categories, were evaluated. An inter-athlete training procedure was applied. Algorithm performance was evaluated in terms of overall accuracy, F1 score and G-index, as well as by computing the prediction speed. The quadratic support vector was confirmed to be the best-performing classifier, achieving an accuracy above 90% with a prediction speed of 29,000 observations/s when considering data from both shanks. A significant reduction of the performance was assessed when considering only one lower limb side. The outcomes allow us to affirm the potential of WARNING to be used as a referee assistant in race-walking competitions and during training sessions. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
210. Parameter Estimation Algorithm of Frequency-Hopping Signal in Compressed Domain Based on Improved Atomic Dictionary.
- Author
-
Zhu, Weipeng, Wang, Yourui, Jin, Hu, and Lei, Yingke
- Subjects
TIME perception ,ALGORITHMS ,SIGNAL sampling ,PARAMETER estimation - Abstract
This paper considers the problem of estimating the parameters of a frequency-hopping signal under non-cooperative conditions. To make the estimation of different parameters independently of each other, a compressed domain frequency-hopping signal parameter estimation algorithm based on the improved atomic dictionary is proposed. By segmenting and compressive sampling the received signal, the center frequency of each signal segment is estimated using the maximum dot product. The signal segments are processed with central frequency variation using the improved atomic dictionary to accurately estimate the hopping time. We highlight that one superiority of the proposed algorithm is that high-resolution center frequency estimation can be directly obtained without reconstructing the frequency-hopping signal. Additionally, another superiority of the proposed algorithm is that hopping time estimation has nothing to do with center frequency estimation. Numerical results show that the proposed algorithm can achieve superior performance compared with the competing method. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
211. Decoding Multi-Class Motor Imagery and Motor Execution Tasks Using Riemannian Geometry Algorithms on Large EEG Datasets.
- Author
-
Shuqfa, Zaid, Belkacem, Abdelkader Nasreddine, and Lakas, Abderrahmane
- Subjects
RIEMANNIAN geometry ,MOTOR imagery (Cognition) ,DECODING algorithms ,BRAIN-computer interfaces ,ELECTROENCEPHALOGRAPHY ,ALGORITHMS ,WAKEFULNESS - Abstract
The use of Riemannian geometry decoding algorithms in classifying electroencephalography-based motor-imagery brain–computer interfaces (BCIs) trials is relatively new and promises to outperform the current state-of-the-art methods by overcoming the noise and nonstationarity of electroencephalography signals. However, the related literature shows high classification accuracy on only relatively small BCI datasets. The aim of this paper is to provide a study of the performance of a novel implementation of the Riemannian geometry decoding algorithm using large BCI datasets. In this study, we apply several Riemannian geometry decoding algorithms on a large offline dataset using four adaptation strategies: baseline, rebias, supervised, and unsupervised. Each of these adaptation strategies is applied in motor execution and motor imagery for both scenarios 64 electrodes and 29 electrodes. The dataset is composed of four-class bilateral and unilateral motor imagery and motor execution of 109 subjects. We run several classification experiments and the results show that the best classification accuracy is obtained for the scenario where the baseline minimum distance to Riemannian mean has been used. The mean accuracy values up to 81.5% for motor execution, and up to 76.4% for motor imagery. The accurate classification of EEG trials helps to realize successful BCI applications that allow effective control of devices. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
212. Surgical Instrument Detection Algorithm Based on Improved YOLOv7x.
- Author
-
Ran, Boping, Huang, Bo, Liang, Shunpan, and Hou, Yulei
- Subjects
SURGICAL instruments ,OBJECT recognition (Computer vision) ,FEATURE extraction ,ALGORITHMS ,MEDICAL technology ,COMPUTER vision ,PATIENT safety - Abstract
The counting of surgical instruments is an important task to ensure surgical safety and patient health. However, due to the uncertainty of manual operations, there is a risk of missing or miscounting instruments. Applying computer vision technology to the instrument counting process can not only improve efficiency, but also reduce medical disputes and promote the development of medical informatization. However, during the counting process, surgical instruments may be densely arranged or obstruct each other, and they may be affected by different lighting environments, all of which can affect the accuracy of instrument recognition. In addition, similar instruments may have only minor differences in appearance and shape, which increases the difficulty of identification. To address these issues, this paper improves the YOLOv7x object detection algorithm and applies it to the surgical instrument detection task. First, the RepLK Block module is introduced into the YOLOv7x backbone network, which can increase the effective receptive field and guide the network to learn more shape features. Second, the ODConv structure is introduced into the neck module of the network, which can significantly enhance the feature extraction ability of the basic convolution operation of the CNN and capture more rich contextual information. At the same time, we created the OSI26 data set, which contains 452 images and 26 surgical instruments, for model training and evaluation. The experimental results show that our improved algorithm exhibits higher accuracy and robustness in surgical instrument detection tasks, with F1, AP, AP50, and AP75 reaching 94.7%, 91.5%, 99.1%, and 98.2%, respectively, which are 4.6%, 3.1%, 3.6%, and 3.9% higher than the baseline. Compared to other mainstream object detection algorithms, our method has significant advantages. These results demonstrate that our method can more accurately identify surgical instruments, thereby improving surgical safety and patient health. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
213. Energy-Efficient Algorithms for Path Coverage in Sensor Networks.
- Author
-
Liu, Zhixiong and Zhou, Wei
- Subjects
WIRELESS sensor networks ,SENSOR networks ,NP-hard problems ,ENERGY conservation ,ENERGY industries ,ALGORITHMS - Abstract
Path coverage attracts many interests in some scenarios, such as object tracing in sensor networks. However, the problem of how to conserve the constrained energy of sensors is rarely considered in existing research. This paper studies two problems in the energy conservation of sensor networks that have not been addressed before. The first problem is called the least movement of nodes on path coverage. It first proves the problem as NP-hard, and then uses curve disjunction to separate each path into some discrete points, and ultimately moves nodes to new positions under some heuristic regulations. The utilized curve disjunction technique makes the proposed mechanism unrestricted by the linear path. The second problem is called the largest lifetime on path coverage. It first separates all nodes into independent partitions by utilizing the method of largest weighted bipartite matching, and then schedules these partitions to cover all paths in the network by turns. We eventually analyze the energy cost of the two proposed mechanisms, and evaluate the effects of some parameters on performance through extensive experiments, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
214. Comparative Evaluation of Background Subtraction Algorithms in Remote Scene Videos Captured by MWIR Sensors.
- Author
-
Guangle Yao, Tao Lei, Jiandan Zhong, Ping Jiang, and Wenwu Jia
- Subjects
VIDEO recording ,INFRARED imaging ,INFRARED cameras ,PIXELS ,REMOTE sensing ,ALGORITHMS - Abstract
Background subtraction (BS) is one of the most commonly encountered tasks in video analysis and tracking systems. It distinguishes the foreground (moving objects) from the video sequences captured by static imaging sensors. Background subtraction in remote scene infrared (IR) video is important and common to lots of fields. This paper provides a Remote Scene IR Dataset captured by our designed medium-wave infrared (MWIR) sensor. Each video sequence in this dataset is identified with specific BS challenges and the pixel-wise ground truth of foreground (FG) for each frame is also provided. A series of experiments were conducted to evaluate BS algorithms on this proposed dataset. The overall performance of BS algorithms and the processor/memory requirements were compared. Proper evaluation metrics or criteria were employed to evaluate the capability of each BS algorithm to handle different kinds of BS challenges represented in this dataset. The results and conclusions in this paper provide valid references to develop new BS algorithm for remote scene IR video sequence, and some of them are not only limited to remote scene or IR video sequence but also generic for background subtraction. The Remote Scene IR dataset and the foreground masks detected by each evaluated BS algorithm are available online: https://github.com/JerryYaoGl/BSEvaluationRemoteSceneIR. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
215. Wide-Sense Nonblocking Converting-Converting Networks with Multirate Connections.
- Author
-
Kabaciński, Wojciech and Rajewski, Remigiusz
- Subjects
SWITCHING systems (Telecommunication) ,SUCCESSIVE approximation analog-to-digital converters ,ALGORITHMS - Abstract
In this paper, we consider a two-stage converting-converting (CC) switching network. This structure can be used, for instance, in switches of elastic optical networks (EONs) or in time-division switches. We propose a new routing algorithm based on fixed slot assignment in interstage links. This algorithm, called Fixed Input–interstage Slot Assignment (FISA), reduces the switching network complexity compared to the rearrangeable (RNB) switching networks of the same structure. We derive the wide-sense nonblocking (WNB) conditions for the switching network controlled by this algorithm. The obtained WNB conditions are the same as those of the RNB, but the switching network does not need troublesome and time-consuming rearrangements. When implementing the proposed switching network structure, we can also reduce the number of tunable full-range spectrum converters and replace part of them with fixed spectrum converters, or even use space switches in the first stage. This is especially important when this architecture is applied in EONs. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
216. Improved Algorithm for Insulator and Its Defect Detection Based on YOLOX.
- Author
-
Han, Gujing, Li, Tao, Li, Qiang, Zhao, Feng, Zhang, Min, Wang, Ruijie, Yuan, Qiwei, Liu, Kaipei, and Qin, Liang
- Subjects
ALGORITHMS ,PROBLEM solving ,REGRESSION analysis ,TRACKING algorithms - Abstract
Aerial insulator defect images have some features. For instance, the complex background and small target of defects would make it difficult to detect insulator defects quickly and accurately. To solve the problem of low accuracy of insulator defect detection, this paper concerns the shortcomings of IoU and the sensitivity of small targets to the model regression accuracy. An improved SIoU loss function was proposed based on the regular influence of regression direction on the accuracy. This loss function can accelerate the convergence of the model and make it achieve better results in regressions. For complex backgrounds, ECA (Efficient Channel Attention Module) is embedded between the backbone and the feature fusion layer of the model to reduce the influence of redundant features on the detection accuracy and make progress in the aspect. As a result, these experiments show that the improved model achieved 97.18% mAP which is 2.74% higher than before, and the detection speed could reach 71 fps. To some extent, it can detect insulator and its defects accurately and in real-time. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
217. Dynamic QoS Prediction Algorithm Based on Kalman Filter Modification.
- Author
-
Yan, Yunfei, Sun, Peng, Zhang, Jieyong, Ma, Yutang, Zhao, Liang, and Qin, Yueyi
- Subjects
ARTIFICIAL neural networks ,MATRIX decomposition ,NONNEGATIVE matrices ,ALGORITHMS ,FORECASTING ,QUALITY of service ,KALMAN filtering - Abstract
With the widespread adoption of service-oriented architectures (SOA), services with the same functionality but the different Quality of Service (QoS) are proliferating, which is challenging the ability of users to build high-quality services. It is often costly for users to evaluate the QoS of all feasible services; therefore, it is necessary to investigate QoS prediction algorithms to help users find services that meet their needs. In this paper, we propose a QoS prediction algorithm called the MFDK model, which is able to fill in historical sparse QoS values by a non-negative matrix decomposition algorithm and predict future QoS values by a deep neural network. In addition, this model uses a Kalman filter algorithm to correct the model prediction values with real-time QoS observations to reduce its prediction error. Through extensive simulation experiments on the WS-DREAM dataset, we analytically validate that the MFDK model has better prediction accuracy compared to the baseline model, and it can maintain good prediction results under different tensor densities and observation densities. We further demonstrate the rationality of our proposed model and its prediction performance through model ablation experiments and parameter tuning experiments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
218. A Computationally Efficient and Virtualization-Free Two-Dimensional DOA Estimation Method for Nested Planar Array: RD-Root-MUSIC Algorithm.
- Author
-
Han, Shengxinlai, Lai, Xin, Zhang, Yu, and Zhang, Xiaofei
- Subjects
MULTIPLE Signal Classification ,POLYNOMIAL time algorithms ,DIRECTION of arrival estimation ,ALGORITHMS ,COMPUTATIONAL complexity - Abstract
To address the problem of expensive computation in traditional two-dimensional (2D) direction of arrival (DOA) estimation, in this paper, we propose a 2D DOA estimation method based on a reduced dimension and root-finding MUSIC algorithm for nested planar arrays (NPAs). Specifically, the algorithm proposed in this paper transforms the problem based on 2D spectral peak search into two one-dimensional estimation problems by reducing the dimension, and then transforms the one-dimensional estimation problem into a problem of polynomial root finding. Finally the parameters are paired to realize the 2D DOA estimation. The proposed algorithm not only performs two root finding operations directly according to the 2D spectral function transformation, avoiding the performance degradation caused by intermediate operations, but can also fully exploit the enlarged array aperture offered by NPAs with reduced computational complexity and no need for virtualization. The superiorities of the proposed algorithm in terms of estimation accuracy and complexity are verified by simulations. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
219. Adjusting the Stiffness of Supports during Milling of a Large-Size Workpiece Using the Salp Swarm Algorithm.
- Author
-
Kaliński, Krzysztof J., Galewski, Marek A., Stawicka-Morawska, Natalia, Mazur, Michał, and Parus, Arkadiusz
- Subjects
WORKPIECES ,FINITE element method ,SWARM intelligence ,ALGORITHMS ,ARTIFICIAL intelligence - Abstract
This paper concerns the problem of vibration reduction during milling. For this purpose, it is proposed that the standard supports of the workpiece be replaced with adjustable stiffness supports. This affects the modal parameters of the whole system, i.e., object and its supports, which is essential from the point of view of the relative tool–workpiece vibrations. To reduce the vibration level during milling, it is necessary to appropriately set the support stiffness coefficients, which are obtained from numerous milling process simulations. The simulations utilize the model of the workpiece with adjustable supports in the convention of a Finite Element Model (FEM) and a dynamic model of the milling process. The FEM parameters are tuned based on modal tests of the actual workpiece. For assessing simulation results, the proper indicator of vibration level must be selected, which is also discussed in the paper. However, simulating the milling process is time consuming and the total number of simulations needed to search the entire available range of support stiffness coefficients is large. To overcome this issue, the artificial intelligence salp swarm algorithm is used. Finally, for the best combination of stiffness coefficients, the vibration reduction is obtained and a significant reduction in search time for determining the support settings makes the approach proposed in the paper attractive from the point of view of practical applications. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
220. A New Proportionate Filtered-x RLS Algorithm for Active Noise Control System.
- Author
-
Liang, Xiaobei, Yao, Jinyong, Luo, Lei, Zhu, Wenzhao, Zhang, Weifang, and Wang, Yanrong
- Subjects
ACTIVE noise control ,AIRCRAFT cabins ,ALGORITHMS - Abstract
The filtered-x recursive least square (FxRLS) algorithm is widely used in the active noise control system and has achieved great success in some complex de-noising environments, such as the cabin in vehicles and aircraft. However, its performance is sensitive to some user-defined parameters such as the forgetting factor and initial gain. Once these parameters are not selected properly, the de-noising effect of FxRLS will deteriorate. Moreover, the tracking performance of FxRLS for mutation is still restricted to a certain extent. To solve the above problems, this paper proposes a new proportional FxRLS (PFxRLS) algorithm. The forgetting factor and initial gain sensitivity are successfully reduced without introducing new turning parameters. The de-noising level and tracking performance have also been improved. Moreover, the momentum technique is introduced in PFxRLS to further improve its robustness and de-noising level. To ensure stability, its convergence condition is also discussed in this paper. The effectiveness of the proposed algorithms is illustrated by simulations and experiments with different user-defined parameters and time-varying noise environments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
221. Gravity-Matching Algorithm Based on K-Nearest Neighbor.
- Author
-
Gao, Shuaipeng, Cai, Tijing, and Fang, Ke
- Subjects
K-nearest neighbor classification ,INERTIAL navigation systems ,ALGORITHMS ,SPIN labels ,EUCLIDEAN distance ,PATTERN matching - Abstract
The gravity-aided inertial navigation system is a technique using geophysical information, which has broad application prospects, and the gravity-map-matching algorithm is one of its key technologies. A novel gravity-matching algorithm based on the K-Nearest neighbor is proposed in this paper to enhance the anti-noise capability of the gravity-matching algorithm, improve the accuracy of gravity-aided navigation, and reduce the application threshold of the matching algorithm. This algorithm selects K sample labels by the Euclidean distance between sample datum and measurement, and then creatively determines the weight of each label from its spatial position using the weighted average of labels and the constraint conditions of sailing speed to obtain the continuous navigation results by gravity matching. The simulation experiments of post processing are designed to demonstrate the efficiency. The experimental results show that the algorithm reduces the INS positioning error effectively, and the position error in both longitude and latitude directions is less than 800 m. The computing time can meet the requirements of real-time navigation, and the average running time of the KNN algorithm at each matching point is 5.87s. This algorithm shows better stability and anti-noise capability in the continuously matching process. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
222. Research and Implementation of Autonomous Navigation for Mobile Robots Based on SLAM Algorithm under ROS.
- Author
-
Zhao, Jianwei, Liu, Shengyi, and Li, Jinyu
- Subjects
MOBILE robots ,RESEARCH implementation ,NAUTICAL charts ,ALGORITHMS ,NAVIGATION ,AIRBORNE lasers - Abstract
Aiming at the problems of low mapping accuracy, slow path planning efficiency, and high radar frequency requirements in the process of mobile robot mapping and navigation in an indoor environment, this paper proposes a four-wheel drive adaptive robot positioning and navigation system based on ROS. By comparing and analyzing the mapping effects of various 2D-SLAM algorithms (Gmapping, Karto SLAM, and Hector SLAM), the Karto SLAM algorithm is used for map building. By comparing the Dijkstra algorithm with the A* algorithm, the A* algorithm is used for heuristic searches, which improves the efficiency of path planning. The DWA algorithm is used for local path planning, and real-time path planning is carried out by combining sensor data, which have a good obstacle avoidance performance. The mathematical model of four-wheel adaptive robot sliding steering was established, and the URDF model of the mobile robot was established under a ROS system. The map environment was built in Gazebo, and the simulation experiment was carried out by integrating lidar and odometer data, so as to realize the functions of mobile robot scanning mapping and autonomous obstacle avoidance navigation. The communication between the ROS system and STM32 is realized, the packaging of the ROS chassis node is completed, and the ROS chassis node has the function of receiving speed commands and feeding back odometer data and TF transformation, and the slip rate of the four-wheel robot in situ steering is successfully measured, making the chassis pose more accurate. Simulation tests and experimental verification show that the system has a high precision in environment map building and can achieve accurate navigation tasks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
223. Mobile Robot Localization and Mapping Algorithm Based on the Fusion of Image and Laser Point Cloud.
- Author
-
Dai, Jun, Li, Dongfang, Li, Yanqin, Zhao, Junwei, Li, Wenbo, and Liu, Gang
- Subjects
LASER fusion ,POSE estimation (Computer vision) ,MOBILE robots ,POINT cloud ,IMAGE fusion ,OPTICAL scanners ,ALGORITHMS ,MULTISENSOR data fusion - Abstract
Given the lack of scale information of the image features detected by the visual SLAM (simultaneous localization and mapping) algorithm, the accumulation of many features lacking depth information will cause scale blur, which will lead to degradation and tracking failure. In this paper, we introduce the lidar point cloud to provide additional depth information for the image features in estimating ego-motion to assist visual SLAM. To enhance the stability of the pose estimation, the front-end of visual SLAM based on nonlinear optimization is improved. The pole error is introduced in the pose estimation between frames, and the residuals are calculated according to whether the feature points have depth information. The residuals of features reconstruct the objective function and iteratively solve the robot's pose. A keyframe-based method is used to optimize the pose locally in reducing the complexity of the optimization problem. The experimental results show that the improved algorithm achieves better results in the KITTI dataset and outdoor scenes. Compared with the pure visual SLAM algorithm, the trajectory error of the mobile robot is reduced by 52.7%. The LV-SLAM algorithm proposed in this paper has good adaptability and robust stability in different environments. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
224. A Novel Method for Obtaining Analytical Parameters Based on Double-Flank Measurement.
- Author
-
Wang, Xiaoyi, Liu, Mingkang, Yao, Tianyang, Zheng, Kunlei, Zhao, Chengxiang, Xiao, Longyuan, Zhu, Dongjie, and Shi, Zhaoyao
- Subjects
MEASUREMENT ,TEETH ,GEARING machinery ,ALGORITHMS - Abstract
Double-flank measurement is the most commonly used method for full inspection of mass-produced gears and has high measurement efficiency, but it cannot obtain the analytical parameters and is not helpful enough to evaluate the NVH performance of the gears. Based on the double-flank rolling tester with a new principle, a simulation method for double-flank measurement and a solving method for analytical parameters are proposed. Using the simulation method, the double-flank measurements without random error can be obtained through the collision detection algorithm. The solving method uses the iteration to obtain the minimum rolling length of each position of the tooth surface, then obtains the analytical parameters of the gear. In the experiments, the difference between the profile deviations obtained by the solving method and superimposed in the simulation method is less than 0.03 μm. The experiment results have verified the correctness of the simulation method and the solving method. These methods can greatly improve the value of double-flank measurement. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
225. Two-Point Localization Algorithm of a Magnetic Target Based on Tensor Geometric Invariant.
- Author
-
Chi, Cheng, Wang, Dan, Tao, Ronghua, Li, Jianwei, Wang, Ye, Yu, Zhentao, and Yu, Lu
- Subjects
OPTIMIZATION algorithms ,GEOMAGNETISM ,NONLINEAR equations ,EIGENVECTORS ,ALGORITHMS ,PARTICLE swarm optimization ,MAGNETIC moments - Abstract
Currently, magnetic gradient tensor-based localization methods face challenges such as significant errors in geomagnetic field estimation, susceptibility to local optima in optimization algorithms, and inefficient performance. In addressing these issues, this article propose a two-point localization method under the constraint of overlaying geometric invariants. This method initially establishes the relationship between the target position and the magnetic gradient tensor by substituting an intermediate variable for the magnetic moment. Exploiting the property of the eigenvector corresponding to the minimum absolute eigenvalue being perpendicular to the target position vector, this constraint is superimposed to formulate a nonlinear system of equations of the target's position. In the process of determining the target position, the Nara method is employed for obtaining the initial values, followed by the utilization of the Levenberg–Marquardt algorithm to derive a precise solution. Experimental validation through both simulations and experiments confirms the effectiveness of the proposed method. The results demonstrate its capability to overcome the challenges faced by a single-point localization method in the presence of some errors in geomagnetic field estimation. In comparison to traditional two-point localization methods, the proposed method exhibits the highest precision. The localization outcomes under different noise conditions underscore the robust noise resistance and resilience of the proposed method. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
226. HP3D-V2V: High-Precision 3D Object Detection Vehicle-to-Vehicle Cooperative Perception Algorithm.
- Author
-
Chen, Hongmei, Wang, Haifeng, Liu, Zilong, Gu, Dongbing, and Ye, Wen
- Subjects
OBJECT recognition (Computer vision) ,ALGORITHMS ,DATA scrubbing ,POINT cloud ,AUTONOMOUS vehicles ,FEATURE extraction - Abstract
Cooperative perception in the field of connected autonomous vehicles (CAVs) aims to overcome the inherent limitations of single-vehicle perception systems, including long-range occlusion, low resolution, and susceptibility to weather interference. In this regard, we propose a high-precision 3D object detection V2V cooperative perception algorithm. The algorithm utilizes a voxel grid-based statistical filter to effectively denoise point cloud data to obtain clean and reliable data. In addition, we design a feature extraction network based on the fusion of voxels and PointPillars and encode it to generate BEV features, which solves the spatial feature interaction problem lacking in the PointPillars approach and enhances the semantic information of the extracted features. A maximum pooling technique is used to reduce the dimensionality and generate pseudoimages, thereby skipping complex 3D convolutional computation. To facilitate effective feature fusion, we design a feature level-based crossvehicle feature fusion module. Experimental validation is conducted using the OPV2V dataset to assess vehicle coperception performance and compare it with existing mainstream coperception algorithms. Ablation experiments are also carried out to confirm the contributions of this approach. Experimental results show that our architecture achieves lightweighting with a higher average precision (AP) than other existing models. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
227. Experimental Setup for Investigating the Efficient Load Balancing Algorithms on Virtual Cloud.
- Author
-
Alankar, Bhavya, Sharma, Gaurav, Kaur, Harleen, Valverde, Raul, and Chang, Victor
- Subjects
ALGORITHMS ,COMMUNICATION infrastructure ,CLOUD computing ,WEB servers - Abstract
Cloud computing has emerged as the primary choice for developers in developing applications that require high-performance computing. Virtualization technology has helped in the distribution of resources to multiple users. Increased use of cloud infrastructure has led to the challenge of developing a load balancing mechanism to provide optimized use of resources and better performance. Round robin and least connections load balancing algorithms have been developed to allocate user requests across a cluster of servers in the cloud in a time-bound manner. In this paper, we have applied the round robin and least connections approach of load balancing to HAProxy, virtual machine clusters and web servers. The experimental results are visualized and summarized using Apache Jmeter and a further comparative study of round robin and least connections is also depicted. Experimental setup and results show that the round robin algorithm performs better as compared to the least connections algorithm in all measuring parameters of load balancer in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2020
- Full Text
- View/download PDF
228. Research on an Improved Segmentation Recognition Algorithm of Overlapping Agaricus bisporus.
- Author
-
Yang, Shuzhen, Ni, Bowen, Du, Wanhe, and Yu, Tao
- Subjects
CULTIVATED mushroom ,CONCAVE surfaces ,ALGORITHMS ,LEAST squares ,ELLIPSES (Geometry) ,POLYGONS - Abstract
The accurate identification of overlapping Agaricus bisporus in a factory environment is one of the challenges faced by automated picking. In order to better segment the complex adhesion between Agaricus bisporus, this paper proposes a segmentation recognition algorithm for overlapping Agaricus bisporus. This algorithm calculates the global gradient threshold and divides the image according to the image edge gradient feature to obtain the binary image. Then, the binary image is filtered and morphologically processed, and the contour of the overlapping Agaricus bisporus area is obtained by edge detection in the Canny operator, the convex hull and concave area are extracted for polygon simplification, and the vertices are extracted using Harris corner detection to determine the segmentation point. After dividing the contour fragments by the dividing point, the branch definition algorithm is used to merge and group all the contours of the same Agaricus bisporus. Finally, the least squares ellipse fitting algorithm and the minimum distance circle fitting algorithm are used to reconstruct the outline of Agaricus bisporus, and the demand information of Agaricus bisporus picking is obtained. The experimental results show that this method can effectively overcome the influence of uneven illumination during image acquisition and be more adaptive to complex planting environments. The recognition rate of Agaricus bisporus in overlapping situations is more than 96%, and the average coordinate deviation rate of the algorithm is less than 1.59%. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
229. Research on Fast Recognition and Localization of an Electric Vehicle Charging Port Based on a Cluster Template Matching Algorithm.
- Author
-
Quan, Pengkun, Lou, Ya'nan, Lin, Haoyu, Liang, Zhuo, Wei, Dongbo, and Di, Shichun
- Subjects
ELECTRIC charge ,ALGORITHMS ,ELECTRIC vehicles - Abstract
With the gradual maturity of driverless and automatic parking technologies, electric vehicle charging has been gradually developing in the direction of automation. However, the pose calculation of the charging port (CP) is an important part of realizing automatic charging, and it represents a problem that needs to be solved urgently. To address this problem, this paper proposes a set of efficient and accurate methods for determining the pose of an electric vehicle CP, which mainly includes the search and aiming phases. In the search phase, the feature circle algorithm is used to fit the ellipse information to obtain the pixel coordinates of the feature point. In the aiming phase, contour matching and logarithmic evaluation indicators are used in the cluster template matching algorithm (CTMA) proposed in this paper to obtain the matching position. Based on the image deformation rate and zoom rates, a matching template is established to realize the fast and accurate matching of textureless circular features and complex light fields. The EPnP algorithm is employed to obtain the pose information, and an AUBO-i5 robot is used to complete the charging gun insertion. The results show that the average CP positioning errors (x, y, z, Rx, Ry, and Rz) of the proposed algorithm are 0.65 mm, 0.84 mm, 1.24 mm, 1.11 degrees, 0.95 degrees, and 0.55 degrees. Further, the efficiency of the positioning method is improved by 510.4% and the comprehensive plug-in success rate is 95%. Therefore, the proposed CTMA in this paper can efficiently and accurately identify the CP while meeting the actual plug-in requirements. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
230. Improvement of Lightweight Convolutional Neural Network Model Based on YOLO Algorithm and Its Research in Pavement Defect Detection.
- Author
-
Du, Fu-Jun and Jiao, Shuang-Jian
- Subjects
ARTIFICIAL neural networks ,CONVOLUTIONAL neural networks ,PAVEMENTS ,ALGORITHMS ,FEATURE extraction - Abstract
To ensure the safe operation of highway traffic lines, given the imperfect feature extraction of existing road pit defect detection models and the practicability of detection equipment, this paper proposes a lightweight target detection algorithm with enhanced feature extraction based on the YOLO (You Only Look Once) algorithm. The BIFPN (Bidirectional Feature Pyramid Network) network structure is used for multi-scale feature fusion to enhance the feature extraction ability, and Varifocal Loss is used to optimize the sample imbalance problem, which improves the accuracy of road defect target detection. In the evaluation test of the model in the constructed PCD1 (Pavement Check Dataset) dataset, the mAP@.5 (mean Average Precision when IoU = 0.5) of the BV-YOLOv5S (BiFPN Varifocal Loss-YOLOv5S) model increased by 4.1%, 3%, and 0.9%, respectively, compared with the YOLOv3-tiny, YOLOv5S, and B-YOLOv5S (BiFPN-YOLOv5S; BV-YOLOv5S does not use the Improved Focal Loss function) models. Through the analysis and comparison of experimental results, it is proved that the proposed BV-YOLOv5S network model performs better and is more reliable in the detection of pavement defects and can meet the needs of road safety detection projects with high real-time and flexibility requirements. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
231. Chessboard Corner Detection Based on EDLines Algorithm.
- Author
-
Dan, Xizuo, Gong, Qicheng, Zhang, Mei, Li, Tao, Li, Guihua, and Wang, Yonghong
- Subjects
ALGORITHMS ,CAMERA calibration - Abstract
To improve the robustness and accuracy of the corner-detection algorithm, this paper proposes a camera-calibration method based on the EDLines algorithm for the automatic detection of chessboard corners. The EDLines algorithm is initially used to perform straight-line detection on the calibration image. The features of the broken straight lines at the corners are then used to filter the straight lines and remove the background straight lines outside the chessboard. The pixels in the rectangular area around the filtered straight line are sorted by the gray gradient. After using the sorted results to fit the straight line, the coordinates of the intersection of the straight lines are taken as the initial coordinates of the corners and perform subpixel optimization on them. Finally, the corner points are sorted by the conversion between pixel-coordinate systems. The camera exposure time changes and complex imaging-background experiments show that the algorithm has no missed detection and redundancy in corner detection. The average reprojection error is found to be less than 0.05 pixels, which can be used in actual calibration. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
232. Structural Health Monitoring of Dams Based on Acoustic Monitoring, Deep Neural Networks, Fuzzy Logic and a CUSUM Control Algorithm.
- Author
-
Ozelim, Luan Carlos de Sena Monteiro, Borges, Lucas Parreira de Faria, Cavalcante, André Luís Brasil, Albuquerque, Enzo Aldo Cunha, Diniz, Mariana dos Santos, Góis, Manuelle Santos, Costa, Katherin Rocio Cano Bezerra da, Sousa, Patrícia Figuereido de, Dantas, Ana Paola do Nascimento, Jorge, Rafael Mendes, Moreira, Gabriela Rodrigues, Barros, Matheus Lima de, and Aquino, Fernando Rodrigo de
- Subjects
STRUCTURAL health monitoring ,CUSUM technique ,DAM failures ,FUZZY logic ,EARTH dams ,DAMS ,ALGORITHMS - Abstract
Internal erosion is the most important failure mechanism of earth and rockfill dams. Since this type of erosion develops internally and silently, methodologies of data acquisition and processing for dam monitoring are crucial to guarantee a safe operation during the lifespan of these structures. In this context, artificial intelligence techniques show up as tools that can simplify the analysis and verification process not of the internal erosion itself, but of the effects that this pathology causes in the response of the dam to external stimuli. Therefore, within the scope of this paper, a methodological framework for monitoring internal erosion in the body of earth and rockfill dams will be proposed. For that, artificial intelligence methods, especially deep neural autoencoders, will be used to treat the acoustic data collected by geophones installed on a dam. The sensor data is processed to identify patterns and anomalies as well as to classify the dam's structural health status. In short, the acoustic dataset is preprocessed to reduce its dimensionality. In this process, for each second of acquired data, three parameters are calculated (Hjorth parameters). For each parameter, the data from all the available sensors are used to calibrate an autoencoder. Then, the reconstruction error of each autoencoder is used to monitor how far from the original (normal) state the acoustic signature of the dam is. The time series of reconstruction errors are combined with a cumulative sum (CUSUM) algorithm, which indicates changes in the sequential data collected. Additionally, the outputs of the CUSUM algorithms are treated by a fuzzy logic framework to predict the status of the structure. A scale model is built and monitored to check the effectiveness of the methodology hereby developed, showing that the existence of anomalies is promptly detected by the algorithm. The framework introduced in the present paper aims to detect internal erosion inside dams by combining different techniques in a novel context and methodological workflow. Therefore, this paper seeks to close gaps in prior studies, which mostly treated just parts of the data acquisition–processing workflow. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
233. Rapid Texture Optimization of Three-Dimensional Urban Model Based on Oblique Images.
- Author
-
Weilong Zhang, Ming Li, Bingxuan Guo, Deren Li, and Ge Guo
- Subjects
THREE-dimensional display systems ,ALGORITHMS ,MARKOV random fields ,GRAPHIC methods ,ENERGY function - Abstract
Seamless texture mapping is one of the key technologies for photorealistic 3D texture reconstruction. In this paper, a method of rapid texture optimization of 3D urban reconstruction based on oblique images is proposed aiming at the existence of texture fragments, seams, and inconsistency of color in urban 3D texture mapping based on low-altitude oblique images. First, we explore implementing radiation correction on the experimental images with a radiation procession algorithm. Then, an efficient occlusion detection algorithm based on OpenGL is proposed according to the mapping relation between the terrain triangular mesh surface and the images to implement the occlusion detection of the visible texture on the triangular facets as well as create a list of visible images. Finally, a texture clustering algorithm is put forward based on Markov Random Field utilizing the inherent attributes of the images and solve the energy function minimization by Graph-Cuts. The experimental results display that the method is capable of decreasing the existence of texture fragments, seams, and inconsistency of color in the 3D texture model reconstruction. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
234. Fast High-Resolution Phase Diversity Wavefront Sensing with L-BFGS Algorithm.
- Author
-
Zhang, Haoyuan, Ju, Guohao, Guo, Liang, Xu, Boqian, Bai, Xiaoquan, Jiang, Fengyi, and Xu, Shuyan
- Subjects
OPTIMIZATION algorithms ,ALGORITHMS ,SENSES - Abstract
The presence of manufacture error in large mirrors introduces high-order aberrations, which can severely influence the intensity distribution of point spread function. Therefore, high-resolution phase diversity wavefront sensing is usually needed. However, high-resolution phase diversity wavefront sensing is restricted with the problem of low efficiency and stagnation. This paper proposes a fast high-resolution phase diversity method with limited memory Broyden–Fletcher–Goldfarb–Shanno (L-BFGS) algorithm, which can accurately detect aberrations in the presence of high-order aberrations. An analytical gradient of the objective function for phase-diversity is integrated into the framework of the L-BFGS nonlinear optimization algorithm. L-BFGS algorithm is specifically suitable for high-resolution wavefront sensing where a large phase matrix is optimized. The performance of phase diversity with L-BFGS is compared to other iterative method through simulations and a real experiment. This work contributes to fast high-resolution image-based wavefront sensing with a high robustness. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
235. User QoS-Based Optimized Handover Algorithm for Wireless Networks.
- Author
-
Chu, Hung-Chi, Wong, Chia-En, Cheng, Wei-Min, and Lai, Hong-Cheng
- Subjects
ROAMING (Telecommunication) ,NETWORK performance ,STREAMING video & television ,ALGORITHMS ,PROBLEM solving - Abstract
Due to the development of wireless network technology, various applications relying on good network quality are widely used on mobile devices. Taking the commonly used video streaming service as an example, a network with high throughput and low packet loss rate can meet the service requirements. When the moving distance of the mobile device is greater than the signal coverage of the AP, it will trigger the handover process to connect to another AP, and cause the network to disconnect and reconnect instantaneously. However, frequently triggering the handover procedure will cause a significant drop in network performance and affect the operation of application services. In order to solve this problem, this paper proposes the OHA and OHAQR. The OHA considers whether the signal quality is good or bad, and uses the corresponding HM method to solve the problem of frequent handover procedures. The OHAQR integrates the QoS requirements of the throughput and packet loss rate into the OHA with the Q-handover score, to provide high-performance handover services with QoS. Our experimental results show that the OHA and OHAQR have 13 and 15 handovers in a high-density scenario, respectively, and are better than the other two methods. The actual throughput and packet loss rate of the OHAQR are 123 Mbps and 5%, respectively, and the network performance is better than that of other methods. The proposed method shows excellent performance in ensuring the network QoS requirements and reducing the number of handover procedures. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
236. Real-Time Hybrid Test Control Research Based on Improved Electro-Hydraulic Servo Displacement Algorithm.
- Author
-
Shen, Yaoyu, Guo, Ying-Qing, Zha, Xiumei, and Wang, Yina
- Subjects
ELECTROHYDRAULIC effect ,DIGITAL computer simulation ,ALGORITHMS ,DYNAMIC loads ,LEAD time (Supply chain management) ,DIGITAL divide - Abstract
Real-time hybrid testing (RTH) is a test method for dynamic loading performance evaluation of structures, which is divided into digital simulation and physical testing, but the integration of the two may lead to problems such as time lag, large errors, and slow response time. The electro-hydraulic servo displacement system, as the transmission system of the physical test structure, directly affects the operational performance of RTH. Improving the performance of the electro-hydraulic servo displacement control system has become the key to solving the problem of RTH. In this paper, the FF-PSO-PID algorithm is proposed to control the electro-hydraulic servo system in real-time hybrid testing (RTH), which uses the PSO algorithm to operate the optimized PID parameters and the feed-forward compensation algorithm to compensate the displacement. First, the mathematical model of the electro-hydraulic displacement servo system in RTH is presented and the actual parameters are determined. Then, the objective evaluation function of the PSO algorithm is proposed to optimize the PID parameters in the context of RTH operation, and a displacement feed-forward compensation algorithm is added for theoretical study. To verify the effectiveness of the method, joint simulations were performed in Matlab/Simulink to compare and test FF-PSO-PID, PSO-PID, and conventional PID (PID) under different input signals. The results show that the proposed FF-PSO-PID algorithm effectively improves the accuracy and response speed of the electro-hydraulic servo displacement system and solves the problems of RTH time lag, large error, and slow response. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
237. Comparison of Common Algorithms for Single-Pixel Imaging via Compressed Sensing.
- Author
-
Zhao, Wenjing, Gao, Lei, Zhai, Aiping, and Wang, Dong
- Subjects
COMPRESSED sensing ,PIXELS ,SAMPLING theorem ,SIGNAL processing ,ALGORITHMS ,SPATIAL resolution - Abstract
Single-pixel imaging (SPI) uses a single-pixel detector instead of a detector array with a lot of pixels in traditional imaging techniques to realize two-dimensional or even multi-dimensional imaging. For SPI using compressed sensing, the target to be imaged is illuminated by a series of patterns with spatial resolution, and then the reflected or transmitted intensity is compressively sampled by the single-pixel detector to reconstruct the target image while breaking the limitation of the Nyquist sampling theorem. Recently, in the area of signal processing using compressed sensing, many measurement matrices as well as reconstruction algorithms have been proposed. It is necessary to explore the application of these methods in SPI. Therefore, this paper reviews the concept of compressive sensing SPI and summarizes the main measurement matrices and reconstruction algorithms in compressive sensing. Further, the performance of their applications in SPI through simulations and experiments is explored in detail, and then their advantages and disadvantages are summarized. Finally, the prospect of compressive sensing with SPI is discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
238. Current Sensorless Based on PI MPPT Algorithms.
- Author
-
de Brito, Moacyr A. G., Martines, Guilherme M. S., Volpato, Anderson S., Godoy, Ruben B., and Batista, Edson A.
- Subjects
ALGORITHMS ,TRACKING algorithms ,VOLTAGE ,DETECTORS - Abstract
This paper presents novel current sensorless maximum-power point-tracking (MPPT) algorithms based on compensators/controllers and a single-input voltage sensor. The proposed MPPTs eliminate the expensive and noisy current sensor, which can significantly reduce the system cost and retain the advantages of the widely used MPPT algorithms, such as Incremental Conductance (IC) and Perturb and Observe (P&O) algorithms. Additionally, it is verified that the proposed algorithms, especially the proposed Current Sensorless V based on PI, can reach outstanding tracking factors (TFs) such as the IC and P&O based on PI algorithms. In this sense, the insertion of controllers inside the MPPT gives them adaptive characteristics, and the experimental TFs are in the remarkable range of more than 99%, with an average yield of 99.51% and a peak of 99.80%. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
239. An Accurate Millimeter-Wave Imaging Algorithm for Close-Range Monostatic System.
- Author
-
Nie, Xinyi, Lin, Chuan, Meng, Yang, Qing, Anyong, Sykulski, Jan K., and Robertson, Ian D.
- Subjects
SPHERICAL waves ,ELECTROMAGNETIC theory ,ALGORITHMS ,MATHEMATICAL models ,MICROWAVE imaging - Abstract
An efficient and more accurate millimeter-wave imaging algorithm, applied to a close-range monostatic personnel screening system, with consideration of dual path propagation loss, is presented in this paper. The algorithm is developed in accordance with a more rigorous physical model for the monostatic system. The physical model treats incident waves and scattered waves as spherical waves with a more rigorous amplitude term as per electromagnetic theory. As a result, the proposed method can achieve a better focusing effect for multiple targets in different range planes. Since the mathematical methods in classical algorithms, such as spherical wave decomposition and Weyl identity, cannot handle the corresponding mathematical model, the proposed algorithm is derived through the method of stationary phase (MSP). The algorithm has been validated by numerical simulations and laboratory experiments. Good performance in terms of computational efficiency and accuracy has been observed. The synthetic reconstruction results show that the proposed algorithm has significant advantages compared with the classical algorithms, and the reconstruction by using full-wave data generated by FEKO further verifies the validity of the proposed algorithm. Finally, the proposed algorithm performs as expected over real data acquired by our laboratory prototype. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
240. Enhancing Intrusion Detection Systems for IoT and Cloud Environments Using a Growth Optimizer Algorithm and Conventional Neural Networks.
- Author
-
Fatani, Abdulaziz, Dahou, Abdelghani, Abd Elaziz, Mohamed, Al-qaness, Mohammed A. A., Lu, Songfeng, Alfadhli, Saad Ali, and Alresheedi, Shayem Saleh
- Subjects
DEEP learning ,ALGORITHMS ,METAHEURISTIC algorithms ,OPTIMIZATION algorithms ,MACHINE learning ,FEATURE selection - Abstract
Intrusion detection systems (IDS) play a crucial role in securing networks and identifying malicious activity. This is a critical problem in cyber security. In recent years, metaheuristic optimization algorithms and deep learning techniques have been applied to IDS to improve their accuracy and efficiency. Generally, optimization algorithms can be used to boost the performance of IDS models. Deep learning methods, such as convolutional neural networks, have also been used to improve the ability of IDS to detect and classify intrusions. In this paper, we propose a new IDS model based on the combination of deep learning and optimization methods. First, a feature extraction method based on CNNs is developed. Then, a new feature selection method is used based on a modified version of Growth Optimizer (GO), called MGO. We use the Whale Optimization Algorithm (WOA) to boost the search process of the GO. Extensive evaluation and comparisons have been conducted to assess the quality of the suggested method using public datasets of cloud and Internet of Things (IoT) environments. The applied techniques have shown promising results in identifying previously unknown attacks with high accuracy rates. The MGO performed better than several previous methods in all experimental comparisons. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
241. Adaptive Optical Closed-Loop Control Based on the Single-Dimensional Perturbation Descent Algorithm.
- Author
-
Chen, Bo, Zhou, Yilin, Li, Zhaoyi, Jia, Jingjing, and Zhang, Yirui
- Subjects
OPTIMIZATION algorithms ,OPTICAL control ,ADAPTIVE optics ,MATHEMATICAL models ,ALGORITHMS ,WAVEFRONTS (Optics) ,COMPUTER simulation - Abstract
Modal-free optimization algorithms do not require specific mathematical models, and they, along with their other benefits, have great application potential in adaptive optics. In this study, two different algorithms, the single-dimensional perturbation descent algorithm (SDPD) and the second-order stochastic parallel gradient descent algorithm (2SPGD), are proposed for wavefront sensorless adaptive optics, and a theoretical analysis of the algorithms' convergence rates is presented. The results demonstrate that the single-dimensional perturbation descent algorithm outperforms the stochastic parallel gradient descent (SPGD) and 2SPGD algorithms in terms of convergence speed. Then, a 32-unit deformable mirror is constructed as the wavefront corrector, and the SPGD, single-dimensional perturbation descent, and 2SPSA algorithms are used in an adaptive optics numerical simulation model of the wavefront controller. Similarly, a 39-unit deformable mirror is constructed as the wavefront controller, and the SPGD and single-dimensional perturbation descent algorithms are used in an adaptive optics experimental verification device of the wavefront controller. The outcomes demonstrate that the convergence speed of the algorithm developed in this paper is more than twice as fast as that of the SPGD and 2SPGD algorithms, and the convergence accuracy of the algorithm is 4% better than that of the SPGD algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
242. Algorithms and Techniques for the Structural Health Monitoring of Bridges: Systematic Literature Review.
- Author
-
Sonbul, Omar S. and Rashid, Muhammad
- Subjects
STRUCTURAL health monitoring ,FEATURE extraction ,PATTERN recognition systems ,MACHINE learning ,SUPERVISED learning ,SIGNAL processing ,ALGORITHMS - Abstract
Structural health monitoring (SHM) systems are used to analyze the health of infrastructures such as bridges, using data from various types of sensors. While SHM systems consist of various stages, feature extraction and pattern recognition steps are the most important. Consequently, signal processing techniques in the feature extraction stage and machine learning algorithms in the pattern recognition stage play an effective role in analyzing the health of bridges. In other words, there exists a plethora of signal processing techniques and machine learning algorithms, and the selection of the appropriate technique/algorithm is guided by the limitations of each technique/algorithm. The selection also depends on the requirements of SHM in terms of damage identification level and operating conditions. This has provided the motivation to conduct a Systematic literature review (SLR) of feature extraction techniques and pattern recognition algorithms for the structural health monitoring of bridges. The existing literature reviews describe the current trends in the field with different focus aspects. However, a systematic literature review that presents an in-depth comparative study of different applications of machine learning algorithms in the field of SHM of bridges does not exist. Furthermore, there is a lack of analytical studies that investigate the SHM systems in terms of several design considerations including feature extraction techniques, analytical approaches (classification/ regression), operational functionality levels (diagnosis/prognosis) and system implementation techniques (data-driven/model-based). Consequently, this paper identifies 45 recent research practices (during 2016–2023), pertaining to feature extraction techniques and pattern recognition algorithms in SHM for bridges through an SLR process. First, the identified research studies are classified into three different categories: supervised learning algorithms, neural networks and a combination of both. Subsequently, an in-depth analysis of various machine learning algorithms is performed in each category. Moreover, the analysis of selected research studies (total = 45) in terms of feature extraction techniques is made, and 25 different techniques are identified. Furthermore, this article also explores other design considerations like analytical approaches in the pattern recognition process, operational functionality and system implementation. It is expected that the outcomes of this research may facilitate the researchers and practitioners of the domain during the selection of appropriate feature extraction techniques, machine learning algorithms and other design considerations according to the SHM system requirements. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
243. Detection of Chrysanthemums Inflorescence Based on Improved CR-YOLOv5s Algorithm.
- Author
-
Zhao, Wentao, Wu, Dasheng, and Zheng, Xinyu
- Subjects
CHRYSANTHEMUMS ,INFLORESCENCES ,ALGORITHMS ,FLOWERS ,FLUORESCENCE ,DECISION making - Abstract
Accurate recognition of the flowering stage is a prerequisite for flower yield estimation. In order to improve the recognition accuracy based on the complex image background, such as flowers partially covered by leaves and flowers with insignificant differences in various fluorescence, this paper proposed an improved CR-YOLOv5s to recognize flower buds and blooms for chrysanthemums by emphasizing feature representation through an attention mechanism. The coordinate attention mechanism module has been introduced to the backbone of the YOLOv5s so that the network can pay more attention to chrysanthemum flowers, thereby improving detection accuracy and robustness. Specifically, we replaced the convolution blocks in the backbone network of YOLOv5s with the convolution blocks from the RepVGG block structure to improve the feature representation ability of YOLOv5s through a multi-branch structure, further improving the accuracy and robustness of detection. The results showed that the average accuracy of the improved CR-YOLOv5s was as high as 93.9%, which is 4.5% better than that of normal YOLOv5s. This research provides the basis for the automatic picking and grading of flowers, as well as a decision-making basis for estimating flower yield. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
244. An Optimal Linear Fusion Estimation Algorithm of Reduced Dimension for T -Proper Systems with Multiple Packet Dropouts.
- Author
-
Fernández-Alcalá, Rosa M., Jiménez-López, José D., Le Bihan, Nicolas, and Cheong Took, Clive
- Subjects
ALGORITHMS ,RANDOM variables ,KALMAN filtering ,SIGNAL processing - Abstract
This paper analyses the centralized fusion linear estimation problem in multi-sensor systems with multiple packet dropouts and correlated noises. Packet dropouts are modeled by independent Bernoulli distributed random variables. This problem is addressed in the tessarine domain under conditions of T 1 and T 2 -properness, which entails a reduction in the dimension of the problem and, consequently, computational savings. The methodology proposed enables us to provide an optimal (in the least-mean-squares sense) linear fusion filtering algorithm for estimating the tessarine state with a lower computational cost than the conventional one devised in the real field. Simulation results illustrate the performance and advantages of the solution proposed in different settings. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
245. Implementing Dual Base Stations within an IoT Network for Sustaining the Fault Tolerance of an IoT Network through an Efficient Path Finding Algorithm.
- Author
-
Sastry, J. K. R., Ch, Bhupati, and Budaraju, Raja Rao
- Subjects
FAULT tolerance (Engineering) ,FAULT-tolerant computing ,INTERNET of things ,ALGORITHMS ,MICROCONTROLLERS ,NETWORK performance - Abstract
The IoT networks for implementing mission-critical applications need a layer to effect remote communication between the cluster heads and the microcontrollers. Remote communication is affected through base stations using cellular technologies. Using a single base station in this layer is risky as the fault tolerance level of the network will be zero when the base stations break down. Generally, the cluster heads are within the base station spectrum, making seamless integration possible. Implementing a dual base station to cater for a breakdown of the first base station creates huge remoteness as the cluster heads are not within the spectrum of the second base station. Furthermore, using the remote base station involves huge latency affecting the performance of the IoT network. In this paper, a relay-based network is presented with intelligence to fetch the shortest path for communicating to reduce latency and sustain the fault tolerance capability of the IoT network. The results demonstrate that the technique improved the fault tolerance of the IoT network by 14.23%. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
246. Structural Health Monitoring of Composite Pipelines Utilizing Fiber Optic Sensors and an AI-Based Algorithm—A Comprehensive Numerical Study.
- Author
-
Altabey, Wael A., Wu, Zhishen, Noori, Mohammad, and Fathnejat, Hamed
- Subjects
STRUCTURAL health monitoring ,DEEP learning ,OPTICAL fiber detectors ,CONVOLUTIONAL neural networks ,ARTIFICIAL intelligence ,FIBER Bragg gratings ,ALGORITHMS - Abstract
In this paper, a structural health monitoring (SHM) system is proposed to provide automatic early warning for detecting damage and its location in composite pipelines at an early stage. The study considers a basalt fiber reinforced polymer (BFRP) pipeline with an embedded Fiber Bragg grating (FBG) sensory system and first discusses the shortcomings and challenges with incorporating FBG sensors for accurate detection of damage information in pipelines. The novelty and the main focus of this study is, however, a proposed approach that relies on designing an integrated sensing-diagnostic SHM system that has the capability to detect damage in composite pipelines at an early stage via implementation of an artificial intelligence (AI)-based algorithm combining deep learning and other efficient machine learning methods using an Enhanced Convolutional Neural Network (ECNN) without retraining the model. The proposed architecture replaces the softmax layer by a k-Nearest Neighbor (k-NN) algorithm for inference. Finite element models are developed and calibrated by the results of pipe measurements under damage tests. The models are then used to assess the patterns of the strain distributions of the pipeline under internal pressure loading and under pressure changes due to bursts, and to find the relationship of strains at different locations axially and circumferentially. A prediction algorithm for pipe damage mechanisms using distributed strain patterns is also developed. The ECNN is designed and trained to identify the condition of pipe deterioration so the initiation of damage can be detected. The strain results from the current method and the available experimental results in the literature show excellent agreement. The average error between the ECNN data and FBG sensor data is 0.093%, thus confirming the reliability and accuracy of the proposed method. The proposed ECNN achieves high performance with 93.33 % accuracy (P%), 91.18 % regression rate (R%) and a 90.54 % F1-score (F%). [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
247. TRD-YOLO: A Real-Time, High-Performance Small Traffic Sign Detection Algorithm.
- Author
-
Chu, Jinqi, Zhang, Chuang, Yan, Mengmeng, Zhang, Haichao, and Ge, Tao
- Subjects
TRAFFIC monitoring ,DEEP learning ,TRAFFIC signs & signals ,ALGORITHMS ,FEATURE extraction ,CONVOLUTIONAL neural networks - Abstract
Traffic sign detection is an important part of environment-aware technology and has great potential in the field of intelligent transportation. In recent years, deep learning has been widely used in the field of traffic sign detection, achieving excellent performance. Due to the complex traffic environment, recognizing and detecting traffic signs is still a challenging project. In this paper, a model with global feature extraction capabilities and a multi-branch lightweight detection head is proposed to increase the detection accuracy of small traffic signs. First, a global feature extraction module is proposed to enhance the ability of extracting features and capturing the correlation within the features through self-attention mechanism. Second, a new, lightweight parallel decoupled detection head is proposed to suppress redundant features and separate the output of the regression task from the classification task. Finally, we employ a series of data enhancements to enrich the context of the dataset and improve the robustness of the network. We conducted a large number of experiments to verify the effectiveness of the proposed algorithm. The accuracy of the proposed algorithm is 86.3%, the recall is 82.1%, the mAP@0.5 is 86.5% and the mAP@0.5:0.95 is 65.6% in TT100K dataset, while the number of frames transmitted per second is stable at 73, which meets the requirement of real-time detection. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
248. CSMOT: Make One-Shot Multi-Object Tracking in Crowded Scenes Great Again †.
- Author
-
Hou, Haoxiong, Shen, Chao, Zhang, Ximing, and Gao, Wei
- Subjects
TRACKING algorithms ,TRACKING radar ,INFORMATION design ,ALGORITHMS - Abstract
The current popular one-shot multi-object tracking (MOT) algorithms are dominated by the joint detection and embedding paradigm, which have high inference speeds and accuracy, but their tracking performance is unstable in crowded scenes. Not only does the detection branch have difficulty in obtaining the accurate object position, but the ambiguous appearance of features extracted by the re-identification (re-ID) branch also leads to identity switches. Focusing on the above problems, this paper proposes a more robust MOT algorithm, named CSMOT, based on FairMOT. First, on the basis of the encoder–decoder network, a coordinate attention module is designed to enhance the information interaction between channels (horizontal and vertical coordinates), which improves its object-detection abilities. Then, an angle-center loss that effectively maximizes intra-class similarity is proposed to optimize the re-ID branch, and the extracted re-ID features are made more discriminative. We further redesign the re-ID feature dimension to balance the detection and re-ID tasks. Finally, a simple and effective data association mechanism is introduced, which associates each detection instead of just the high-score detections during the tracking process. The experimental results show that our one-shot MOT algorithm achieves excellent tracking performance on multiple public datasets and can be effectively applied to crowded scenes. In particular, CSMOT decreases the number of ID switches by 11.8% and 33.8% on the MOT16 and MOT17 test datasets, respectively, compared to the baseline. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
249. DV-Hop Algorithm Based on Multi-Objective Salp Swarm Algorithm Optimization.
- Author
-
Liu, Weimin, Li, Jinhang, Zheng, Aiyun, Zheng, Zhi, Jiang, Xinyu, and Zhang, Shaoning
- Subjects
PARTICLE swarm optimization ,WIRELESS sensor networks ,SENSOR placement ,ALGORITHMS - Abstract
The localization of sensor nodes is an important problem in wireless sensor networks. The DV-Hop algorithm is a typical range-free algorithm, but the localization accuracy is not high. To further improve the localization accuracy, this paper designs a DV-Hop algorithm based on multi-objective salp swarm optimization. Firstly, hop counts in the DV-Hop algorithm are subdivided, and the average hop distance is corrected based on the minimum mean-square error criterion and weighting. Secondly, the traditional single-objective optimization model is transformed into a multi-objective optimization model. Then, in the third stage of DV-Hop, the improved multi-objective salp swarm algorithm is used to estimate the node coordinates. Finally, the proposed algorithm is compared with three improved DV-Hop algorithms in two topologies. Compared with DV-Hop, The localization errors of the proposed algorithm are reduced by 50.79% and 56.79% in the two topology environments with different communication radii. The localization errors of different node numbers are decreased by 38.27% and 56.79%. The maximum reductions in localization errors are 38.44% and 56.79% for different anchor node numbers. Based on different regions, the maximum reductions in localization errors are 56.75% and 56.79%. The simulation results show that the accuracy of the proposed algorithm is better than that of DV-Hop, GWO-DV-Hop, SSA-DV-Hop, and ISSA-DV-Hop algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
250. Improved Optimization Strategy Based on Region Division for Collaborative Multi-Agent Coverage Path Planning.
- Author
-
Qin, Yijie, Fu, Lei, He, Dingxin, and Liu, Zhiwei
- Subjects
OPTIMIZATION algorithms ,GEODESIC distance ,EULERIAN graphs ,GEODESICS ,MULTIAGENT systems ,ALGORITHMS - Abstract
In this paper, we investigate the algorithms for traversal exploration and path coverage of target regions using multiple agents, enabling the efficient deployment of a set of agents to cover a complex region. First, the original multi-agent path planning problem (mCPP) is transformed into several single-agent sub-problems, by dividing the target region into multiple balanced sub-regions, which reduces the explosive combinatorial complexity; subsequently, closed-loop paths are planned in each sub-region by the rapidly exploring random trees (RRT) algorithm to ensure continuous exploration and repeated visits to each node of the target region. On this basis, we also propose two improvements: for the corner case of narrow regions, the use of geodesic distance is proposed to replace the Eulerian distance in Voronoi partitioning, and the iterations for balanced partitioning can be reduced by more than one order of magnitude; the Dijkstra algorithm is introduced to assign a smaller weight to the path cost when the geodesic direction changes, which makes the region division more "cohesive", thus greatly reducing the number of turns in the path and making it more robust. The final optimization algorithm ensures the following characteristics: complete coverage of the target area, wide applicability of multiple area shapes, reasonable distribution of exploration tasks, minimum average waiting time, and sustainable exploration without any preparation phase. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.