Improved adaptive genetic algorithm based RFID positioning

The existing active tag-based radio frequency identi-fication(RFID)localization techniques show low accuracy in practical applications.To address such problems,we propose a chaotic adaptive genetic algorithm to align the passive tag ar-rays.We use chaotic sequences to generate the intersection points,the weakest single point intersection is used to ensure the convergence accuracy of the algorithm while avoiding the optimization jitter problem.Meanwhile,to avoid the problem of slow convergence and immature convergence of the algorithm caused by the weakening of individual competition at a later stage,we use adaptive rate of change to improve the optimiza-tion efficiency.In addition,to remove signal noise and outliers,we preprocess the data using Gaussian filtering.Experimental results demonstrate that the proposed algorithm achieves high-er localization accuracy and improves the convergence speed.

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.

Optimization of MAC algorithm based on IEEE 802.15.4 in indoor positioning system

The mobility of the targets asks for high requirements of the locating speed in indoor positioning systems.The standard medium access control(MAC)algorithm will often cause lots of packet conflicts and high transmission delay if multiple users communicate with one beacon at the same time,which will severely limit the speed of the system.Therefore,an optimized MAC algorithm is proposed based on channel reservation to enable users to reserve beacons.A frame threshold is set to ensure the users with shorter data frames do not depend on the reservation mechanism,and multiple users can achieve packets switching with relative beacon in a fixed sequence by using frequency division multiplexing technology.The simulation results show that the optimized MAC algorithm proposed in this paper can improve the positioning speed significantly while maintaining the positioning accuracy.Moreover,the positioning accuracy can be increased to a certain extent if more channel resources can be obtained,so as to provide effective technical support for the location and tracking applications of indoor moving targets.

Optimized parameters of downhole all-metal PDM based on genetic algorithm

Currently,deep drilling operates under extreme conditions of high temperature and high pressure,demanding more from subterranean power motors.The all-metal positive displacement motor,known for its robust performance,is a critical choice for such drilling.The dimensions of the PDM are crucial for its performance output.To enhance this,optimization of the motor's profile using a genetic algorithm has been undertaken.The design process begins with the computation of the initial stator and rotor curves based on the equations for a screw cycloid.These curves are then refined using the least squares method for a precise fit.Following this,the PDM's mathematical model is optimized,and motor friction is assessed.The genetic algorithm process involves encoding variations and managing crossovers to optimize objective functions,including the isometric radius coefficient,eccentricity distance parameter,overflow area,and maximum slip speed.This optimization yields the ideal profile parameters that enhance the motor's output.Comparative analyses of the initial and optimized output characteristics were conducted,focusing on the effects of the isometric radius coefficient and overflow area on the motor's performance.Results indicate that the optimized motor's overflow area increased by 6.9%,while its rotational speed reduced by 6.58%.The torque,as tested by Infocus,saw substantial improvements of38.8%.This optimization provides a theoretical foundation for improving the output characteristics of allmetal PDMs and supports the ongoing development and research of PDM technology.

An improved initial rotor position estimation method using high-frequency pulsating voltage injection for PMSM

High frequency pulsating voltage injection method is a good candidate for detecting the initial rotor position of permanent magnet synchronous motor.However,traditional methods require a large number of filters,which leads to the deterioration of system stability and dynamic performance.In order to solve these problems,a new signal demodulation method is proposed in this paper.The proposed new method can directly obtain the amplitude of high-frequency current,thus eliminating the use of filters,improving system stability and dynamic performance and saving the work of adjusting filter parameters.In addition,a new magnetic polarity detection method is proposed,which is robust to current measurement noise.Finally,experiments verify the effectiveness of the method.

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.

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.

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.

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.

Key technology of mine underground mobile positioning based on LiDAR and coded sequence pattern

Technologies of underground mobile positioning were proposed based on LiDAR data and coded sequence pattern landmarks for mine shafts and tunnels environment to meet the needs of fast and accurate positioning and navigation of equipments in the mine underground without satellite navigation signals. A coded sequence pattern was employed for automatic matching of 3D scans. The methods of SIFT feature, Otsu segmentation and fast hough transformation were described for the identification, positioning and interpretation of the coded sequence patterns, respectively. The POSIT model was presented for speeding up computation of the translation and rotation parameters of LiDAR point data, so as to achieve automatic 3D mapping of mine shafts and tunnels. The moving positioning experiment was applied to evaluating the accuracy of proposed pose estimation method from LiDAR scans and coded sequence pattern landmarks acquired in an indoor environment. The performance was evaluated using ground truth data of the indoor setting so as to measure derivations with six degrees of freedom.

Position Vectors Based Efcient Indoor Positioning System

With the advent and advancements in the wireless technologies,Wi-Fi ngerprinting-based Indoor Positioning System(IPS)has become one of the most promising solutions for localization in indoor environments.Unlike the outdoor environment,the lack of line-of-sight propagation in an indoor environment keeps the interest of the researchers to develop efcient and precise positioning systems that can later be incorporated in numerous applications involving Internet of Things(IoTs)and green computing.In this paper,we have proposed a technique that combines the capabilities of multiple algorithms to overcome the complexities experienced indoors.Initially,in the database development phase,Motley Kennan propagation model is used with Hough transformation to classify,detect,and assign different attenuation factors related to the types of walls.Furthermore,important parameters for system accuracy,such as,placement and geometry of Access Points(APs)in the coverage area are also considered.New algorithm for deployment of an additional AP to an already existing infrastructure is proposed by using Genetic Algorithm(GA)coupled with Enhanced Dilution of Precision(EDOP).Moreover,classication algorithm based on k-Nearest Neighbors(k-NN)is used to nd the position of a stationary or mobile user inside the given coverage area.For k-NN to provide low localization error and reduced space dimensionality,three APs are required to be selected optimally.In this paper,we have suggested an idea to select APs based on Position Vectors(PV)as an input to the localization algorithm.Deducing from our comprehensive investigations,it is revealed that the accuracy of indoor positioning system using the proposed technique unblemished the existing solutions with signicant improvements.

Novel indoor positioning system based on ultra-wide bandwidth

To tackle challenges such as interference and poor accuracy of indoor positioning systems,a novel scheme based on ultra-wide bandwidth(UWB)technology is proposed.First,we illustrate a distance measuring method between two UWB devices.Then,a Taylor series expansion algorithm is developed to detect coordinates of the mobile node using the location of anchor nodes and the distance between them.Simulation results show that the observation error under our strategy is within 15 cm,which is superior to existing algorithms.The final experimental data in the hardware system mainly composed of STM32 and DW1000 also confirms the performance of the proposed scheme.

An indoor positioning system for mobile target tracking based on VLC and IMU fusion

An indoor positioning system( IPS) is designed to realize positioning and tracking of mobile targets,by taking advantages of both the visible light communication( VLC) and inertial measurement unit( IMU). The platform of the IPS is designed,which consists of the light-emitting diode( LED)based transmitter,the receiver and the positioning server. To reduce the impact caused by measurement errors,both inertial sensing data and the received signal strength( RSS) from the VLC are calibrated. Then,a practical propagation model is established to obtain the distance between the transmitter and the receiver from the RSS measurements. Furthermore,a hybrid positioning algorithm is proposed by using the adaptive Kalman filter( AKF) and the weighted least squares( WLS)trilateration to estimate the positions of the mobile targets.Experimental results show that the developed IPS using the proposed hybrid positioning algorithm can extend the localization area of VLC,mitigate the IMU drifts and improve the positioning accuracy of mobile targets.

Two Structure-Preserving-Doubling Like Algorithms to Solve the Positive Definite Solution of the Equation X-A^(H)X^(-1)A=Q

In this paper,we study the nonlinear matrix equation X-A^(H)X^(-1)A=Q,where A,Q∈C^(n×n),Q is a Hermitian positive definite matrix and X∈C^(n×n)is an unknown matrix.We prove that the equation always has a unique Hermitian positive definite solution.We present two structure-preserving-doubling like algorithms to find the Hermitian positive definite solution of the equation,and the convergence theories are established.Finally,we show the effectiveness of the algorithms by numerical experiments.

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.

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.

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.

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.