Optimizing Grey Wolf Optimization: A Novel Agents’ Positions Updating Technique for Enhanced Efficiency and Performance

Grey Wolf Optimization (GWO) is a nature-inspired metaheuristic algorithm that has gained popularity for solving optimization problems. In GWO, the success of the algorithm heavily relies on the efficient updating of the agents’ positions relative to the leader wolves. In this paper, we provide a brief overview of the Grey Wolf Optimization technique and its significance in solving complex optimization problems. Building upon the foundation of GWO, we introduce a novel technique for updating agents’ positions, which aims to enhance the algorithm’s effectiveness and efficiency. To evaluate the performance of our proposed approach, we conduct comprehensive experiments and compare the results with the original Grey Wolf Optimization technique. Our comparative analysis demonstrates that the proposed technique achieves superior optimization outcomes. These findings underscore the potential of our approach in addressing optimization challenges effectively and efficiently, making it a valuable contribution to the field of optimization algorithms.

A Dual-Satellite GNSS Positioning Algorithm of High Accuracy in Incomplete Condition

Global navigation satellite system could provide accurate positioning results in signal complete condition. However, the performance is severe when signal denied, especially for the single-mode Bei Dou receiver. This paper proposes a dual-satellite positioning algorithm to promote the positioning performance in the satellite signal gap. The new algorithm utilizes the previous positioning data stored in complete condition to simplify the positioning equations. As the clock bias persists for a short period, this proposed method could work out accurate positioning results by only two visible satellites, without the need of computing the clock bias. Also, the Kalman filtering algorithm is used to smooth the trajectories, and improve the positioning results. During the incomplete period, only two satellites for 30 seconds and three satellites for 60 seconds, the preliminary experiment result shows that, the presented method could provide almost the same positioning results as in complete condition.

A POSITIVE INTERIOR-POINT ALGORITHM FOR NONLINEAR COMPLEMENTARITY PROBLEMS

A new iterative method,which is called positive interior-point algorithm,is presented for solving the nonlinear complementarity problems.This method is of the desirable feature of robustness.And the convergence theorems of the algorithm is established.In addition,some numerical results are reported.

Analysis and Design of Surgical Instrument Localization Algorithm

With the help of surgical navigation system,doctors can operate on patients more intuitively and accurately.The positioning accuracy and real-time performance of surgical instruments are very important to the whole system.In this paper,we analyze and design the detection algorithm of surgical instrument location mark,and estimate the posture of surgical instrument.In addition,we optimized the pose by remapping.Finally,the algorithm of location mark detection proposed in this paper and the posture analysis data of surgical instruments are verified and analyzed through experiments.The final result shows a high accuracy.

Heuristic Reduction Algorithm Based on Pairwise Positive Region

To guarantee the optimal reduct set, a heuristic reduction algorithm is proposed, which considers the distinguishing information between the members of each pair decision classes. Firstly the pairwise positive region is defined, based on which the pairwise significance measure is calculated between the members of each pair classes. Finally the weighted pairwise significance of attribute is used as the attribute reduction criterion, which indicates the necessity of attributes very well. By introducing the noise tolerance factor, the new algorithm can tolerate noise to some extent. Experimental results show the advantages of our novel heuristic reduction algorithm over the traditional attribute dependency based algorithm.

An Application of Genetic Algorithm in Positioning Bricks

This note deals with how to position bricks so that m aximizing the numbers of whole brick in a given area. A method by genetic algori thm is given to solve this problem. By this method, the numbers of whole brick a nd their position are gained when given areas are convex polygon and brick is re ctangular, and you can easily design a CAD soft to optimize the scheme of positi oning bricks. It is huge advantage by this method when given areas are nonregula r. Some rules of parameter’s influence to algorithm are pointed out by computer simulation. The first section states the problem and the math model of problem is given out. The second section gives out the solution by genetic algorithm, in cluding description of genetic algorithm and steps of algorithm about proble m of positioning bricks. The third section gives a computer simulation example. The last section is some discussions about this algorithm, including the influen ce of parameter to algorithm and optimizing parameter. Some rule is gained.

Improved Disk Scheduling Algorithms Based on Rotational Position

As increase of disk access speed has far lagged the speed of processors and main memory, disk-scheduling performance, although less significant for personal users with dedicated storage, is crucial for internet-based intensive data processing. For modern disks, increase of disk rotation rate makes overhead of disk access to data transfer heavier. Therefore, it seems more important to improve both parallel processing capability of disk I/O and disk-scheduling performance at the same time. For disk-scheduling algorithms based on both disk arm and rotational positions, their time-resolving powers are more precise in comparison with those for disk-scheduling algorithms based only on disk arm position. Algorithms of this sort are studied in this paper. Several improved algorithms based on rotational position are proposed, and simulation results of their performances demonstrate.

New Distributed Positioning Algorithm Based on Centroid of Circular Belt for Wireless Sensor Networks

This paper presents a new distributed positioning algorithm for unknown nodes in a wireless sensor network. The algorithm is based exclusively on connectivity. First, assuming that the positions of the anchor nodes are already known, a circular belt containing an unknown node is obtained using information about the anchor nodes that are in radio range of the unknown node, based on the geometric relationships and communication constraints among the unknown node and the anchor nodes. Then, the centroid of the circular belt is taken to be the estimated position of the unknown node. Since the algorithm is very simple and since the only communication needed is between the anchor nodes and the unknown node, the communication and computational loads are very small. Furthermore, the algorithm is robust because neither the failure of old unknown nodes nor the addition of new unknown nodes influences the positioning of unknown nodes to be located. A theoretical analysis and simulation results show that the algorithm does not produce any cumulative error and is insensitive to range error, and that a change in the number of sensor nodes does not affect the communication or computational load. These features make this algorithm suitable for all sizes of low-power wireless sensor networks.

Coordinate correction algorithm for WLAN indoor positioning

In the fingerprint matching-based wireless local area network(WLAN) indoor positioning system,Kalman filter(KF) is usually applied after fingerprint matching algorithms to make positioning results more accurate and consecutive.But this method,like most methods in WLAN indoor positioning field,fails to consider and make use of users' moving speed information.In order to make the positioning results more accurate through using the users' moving speed information,a coordinate correction algorithm(CCA) is proposed in this paper.It predicts a reasonable range for positioning coordinates by using the moving speed information.If the real positioning coordinates are not in the predicted range,it means that the positioning coordinates are not reasonable to a moving user in indoor environment,so the proposed CCA is used to correct this kind of positioning coordinates.The simulation results prove that the positioning results by the CCA are more accurate than those calculated by the KF and the CCA is effective to improve the positioning performance.

一种基于SO-CNN模型的可见光室内定位优化方法

针对基于机器学习的可见光室内定位方法存在的手工调参、定位精度低等问题,结合蛇优化(Snake Optimization,SO)算法的寻优能力与卷积神经网络(Convolutional Neural Network,CNN)处理复杂非线性问题的能力,提出了一种基于SO-CNN模型的可见光室内定位优化方法。在考虑多径效应影响的情况下,采集每个位置点处的信噪比和对应位置坐标构建指纹数据库,对SO-CNN模型进行训练和测试,以得到最佳定位模型。实验结果表明,在5 m×5 m×3 m的房间中,与未经优化的CNN相比,该方法的平均定位误差降低了35.13%;与反向传播神经网络(Back Propagation Neural Network,BPNN)、多层感知器(Multilayer Perceptron,MLP)、SO-MLP相比,该方法的平均定位误差分别降低了54.75%,48.08%,37.01%。

积极伦理观下算法歧视治理模式的革新

算法技术已借助大数据技术被广泛应用,成为影响人们日常生活的重要角色,其也因技术中立性不断遭受现实挑战而呈现出事实上的歧视性。重新审视算法歧视及其治理路径是发挥算法积极作用、避免算法消极影响的重要前提。传统伦理观念影响下的算法歧视治理模式存在价值观念偏航、治理结构失衡及技术治理落后的问题,影响算法歧视治理实效。社会发展促进了伦理观念的革新,积极伦理观的树立可以为算法技术向善的实现提供理论指引。算法治理结构的优化及反歧视技术水平的提高是纠正算法歧视的重要前提,理念、制度及技术三维措施的综合运用方可在算法领域实现科技向善的伦理目标。

共形天线表面微小焊盘视觉定位算法设计

共形天线是一种特殊形态的新型雷达天线,具有低剖面性以及低散射面积,是未来雷达天线发展的重要趋势之一。当前,共形天线的装配方式正由人工装配转向自动化装配以提升生产效率和批产一致性,但共形天线表面的焊盘尺寸小,数量多且分布在复杂曲面上,现有视觉定位算法难以满足实际使用需求。为此,文中提出了一种多目标亚像素定位算法。该算法结合了模板匹配和亚像素定位算法,可以同时给出多个焊盘的精准位置信息。由仿真分析与实验验证可知,该算法的视觉定位精度可达5μm,有效提升了共形天线的装配质量。

基于射频技术的典型无人机定位算法研究

为提高机场运行的安全性,解决各类“黑飞”现象,以射频定位技术得到的信息数据作为基础,通过相关算法进行计算,得出目标位置,并分析多地面射频侦测站布局对无人机定位精度的影响,确定协同算法的定位精度大于单一定位的精度,基站数量越多定位越精确。

基于贝叶斯神经网络的船用惯导定位修正方法

船用惯性导航系统(inertial navigation system, INS)通常采用与全球卫星导航系统(global navigation satellite system, GNSS)组合导航的方式提高其长时间工作的定位精度。当GNSS失效时,其定位误差将随时间迅速发散。针对这一问题,设计了采用反向传播神经网络(back propagate neural network, BPNN)、根据INS原始输出数据拟合修正经纬度的定位修正方案,提出了基于Bayesian算法更新网络权重系数的方法,结合理论分析和试验研究确定了神经元个数与训练数据集的分配方案。实船试验结果表明,当GNSS失效时,在后续2 h,通过24 h历史数据训练得到的神经网络修正INS位置,相比INS独立工作时的定位误差,修正后误差均值下降了63%,误差最大值下降约50%,最小值下降至0。

USING TLS ALGORITHM TO IMPROVE GPS POSITIONING PRECISION WITH ALTITUDE HOLD MODE

This paper presents a new method of improving Global Positioning System(GPS)positioning precision. Based on the altitude hold mode, the method does not need any other equipment. Under this constraint condition, the Total Least Squares(TLS) algorithm is used to prove that the method is effective. Theoretical analysis shows that the algorithm can significantly improve the GPS positioning precision.

基于改进LANDMARC定位算法的人员定位技术研究

在万物互联时代,通过定位系统完成人员定位监督成为了可能,同时该项技术也日益完善。当前,基于RFID无线视频技术的局域网人员定位被广泛应用于智慧园区员工管控、重点人员监管等方面。提出了一种基于RFID的局域网人员定位算法,通过优化LANDMARC算法,对采集到的信号分别引入高斯平滑滤波器和卡尔曼滤波器,去除影响信号强度的噪声,提升定位算法的稳定性;针对LANDMARC定位算法定位精度受K值影响较大的问题,引入Logistic回归模型,以提升算法定位的准确度,有效解决了RFID在有金属、水等障碍物情况下定位精度误差大的问题,降低了外界干扰,可为人员的精准定位提供技术手段。

基于云平台的新能源汽车通信网络定位技术

现行技术在新能源汽车通信网络定位中的应用效果不佳,定位偏移率较高,因此提出基于云平台的新能源汽车通信网络定位技术。利用云平台传输和存储新能源汽车全球定位系统(Global Positioning System,GPS)数据,通过地图匹配新能源汽车定位,采用差分定位算法确定新能源汽车位置,并通过地图可视化展示定位结果,以此实现基于云平台的新能源汽车通信网络定位。实验结果表明,所设计的技术定位偏移率在1%以内,在新能源汽车发展中具有较好的通信网络定位效果。