For the navigation algorithm of the strapdown inertial navigation system, by comparing to the equations of the dual quaternion and quaternion, the superiority of the attitude algorithm based on dual quaternion over th...For the navigation algorithm of the strapdown inertial navigation system, by comparing to the equations of the dual quaternion and quaternion, the superiority of the attitude algorithm based on dual quaternion over the ones based on rotation vector in accuracy is analyzed in the case of the rotation of navigation frame. By comparing the update algorithm of the gravitational velocity in dual quaternion solution with the compensation algorithm of the harmful acceleration in traditional velocity solution, the accuracy advantage of the gravitational velocity based on dual quaternion is addressed. In view of the idea of the attitude and velocity algorithm based on dual quaternion, an improved navigation algorithm is proposed, which is as much as the rotation vector algorithm in computational complexity. According to this method, the attitude quaternion does not require compensating as the navigation frame rotates. In order to verify the correctness of the theoretical analysis, simulations are carried out utilizing the software, and the simulation results show that the accuracy of the improved algorithm is approximately equal to the dual quaternion algorithm.展开更多
Coordinating multiple unmanned aerial vehicles(multi-UAVs)is a challenging technique in highly dynamic and sophisticated environments.Based on digital pheromones as well as current mainstream unmanned system controlli...Coordinating multiple unmanned aerial vehicles(multi-UAVs)is a challenging technique in highly dynamic and sophisticated environments.Based on digital pheromones as well as current mainstream unmanned system controlling algorithms,we propose a strategy for multi-UAVs to acquire targets with limited prior knowledge.In particular,we put forward a more reasonable and effective pheromone update mechanism,by improving digital pheromone fusion algorithms for different semantic pheromones and planning individuals’probabilistic behavioral decision-making schemes.Also,inspired by the flocking model in nature,considering the limitations of some individuals in perception and communication,we design a navigation algorithm model on top of Olfati-Saber’s algorithm for flocking control,by further replacing the pheromone scalar to a vector.Simulation results show that the proposed algorithm can yield superior performance in terms of coverage,detection and revisit efficiency,and the capability of obstacle avoidance.展开更多
A new method is illustrated for processing the output of a set of triad orthogonal rate gyros and accelerometers to reconstruct vehicle navigation parameters(attitude, velocity, and position). The paper introduces two...A new method is illustrated for processing the output of a set of triad orthogonal rate gyros and accelerometers to reconstruct vehicle navigation parameters(attitude, velocity, and position). The paper introduces two vectors with dimensions 4×1 as velocity and position quaternions.The navigation equations for strapdown systems are nonlinear but after using these parameters, the navigation equations are converted into a pseudo-linear system. The new set of navigation equations has an analytical solution and the state transition matrix is used to solve the linear timevarying differential equations through time series. The navigation parameters are updated using the new formulation for strapdown navigation equations. Finally, the quaternions of velocity and position are converted into the original position and velocity vectors. The combination of the coning motion and a translational oscillatory trajectory is used to evaluate the accuracy of the proposed algorithm. The simulations show significant improvement in the accuracy of the inertial navigation system, which is achieved through the mentioned algorithm.展开更多
The use of dead reckoning and fngerprint matching for navigation is a widespread technical method.However,fngerprint mismatching and low fusion accuracy are prevalent issues in indoor navigation systems.This work pres...The use of dead reckoning and fngerprint matching for navigation is a widespread technical method.However,fngerprint mismatching and low fusion accuracy are prevalent issues in indoor navigation systems.This work presents an improved dynamic time warping and a chicken particle flter to handle these two challenges.To generate the Horizontal and Vertical(HV)fngerprint,the pitch and roll are employed instead of the original fngerprint intensity to extract the horizontal and vertical components of the magnetic feld fngerprint.Derivative dynamic time warping employs the HV fngerprint in its derivative form,which receives higher-level features because of the consideration of fngerprint shape information.Chicken Swarm Optimization(CSO)is used to enhance particle weights,which minimizes position error to tackle the particle impoverishment problem for a fusion navigation system.The results of the experiments suggest that the enhanced algorithm can improve indoor navigation accuracy signifcantly.展开更多
Purpose: This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift...Purpose: This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach: Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features:(1) the ancestors should be more representative than the descendants,(2) the semantic meaning along the ancestor-descendant paths needs to be coherent,(3) the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and(4) tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings: The proposed algorithm has been compared with a well-established solution Heymann Tag Tree(HTT). The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project(ODP) classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations: A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications: The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value: Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold:(1) an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and(2) the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.展开更多
A land vehicle tracking and monitoring system based on the integration of differential global position system (DGPS), dead-reckoning (DR), and map matched technology is studied. In this paper, from the economic point ...A land vehicle tracking and monitoring system based on the integration of differential global position system (DGPS), dead-reckoning (DR), and map matched technology is studied. In this paper, from the economic point of view, a new scheme using the one-way directional communication link, is presented. Moreover, 8-state Kalman filter is proposed for integrated DGPS/DR system. When field tests are carried out using two C/A code GARMIN GPS receiver, the positioning accuracy less than 5 m (1σ) is achieved.展开更多
Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tre...Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tree-based networks. Due to link ad- ditions, characteristic path lengths reduce rapidly and clustering coefficients increase greatly. A tree abstract, Cayley tree, is con- sidered for the study of the navigation algorithm, which runs auto- matically in the small worlds of tree-based networks. In the further study, epidemics in the small worlds of tree-based wireless sen- sor networks on the large scale are studied, and the percolation threshold is calculated, at which the outbreak of the epidemic takes place. Compared with Cayley tree, there is a smaller percolation threshold suffering from the epidemic.展开更多
Hybrid metaheuristic algorithms play a prominent role in improving algorithms' searchability by combining each algorithm's advantages and minimizing any substantial shortcomings. The Quantum-based Avian Naviga...Hybrid metaheuristic algorithms play a prominent role in improving algorithms' searchability by combining each algorithm's advantages and minimizing any substantial shortcomings. The Quantum-based Avian Navigation Optimizer Algorithm (QANA) is a recent metaheuristic algorithm inspired by the navigation behavior of migratory birds. Different experimental results show that QANA is a competitive and applicable algorithm in different optimization fields. However, it suffers from shortcomings such as low solution quality and premature convergence when tackling some complex problems. Therefore, instead of proposing a new algorithm to solve these weaknesses, we use the advantages of the bonobo optimizer to improve global search capability and mitigate premature convergence of the original QANA. The effectiveness of the proposed Hybrid Quantum-based Avian Navigation Optimizer Algorithm (HQANA) is assessed on 29 test functions of the CEC 2018 benchmark test suite with different dimensions, 30, 50, and 100. The results are then statistically investigated by the Friedman test and compared with the results of eight well-known optimization algorithms, including PSO, KH, GWO, WOA, CSA, HOA, BO, and QANA. Ultimately, five constrained engineering optimization problems from the latest test suite, CEC 2020 are used to assess the applicability of HQANA to solve complex real-world engineering optimization problems. The experimental and statistical findings prove that the proposed HQANA algorithm is superior to the comparative algorithms.展开更多
基金supported by the National Natural Science Foundation of China (No. 61174126)
文摘For the navigation algorithm of the strapdown inertial navigation system, by comparing to the equations of the dual quaternion and quaternion, the superiority of the attitude algorithm based on dual quaternion over the ones based on rotation vector in accuracy is analyzed in the case of the rotation of navigation frame. By comparing the update algorithm of the gravitational velocity in dual quaternion solution with the compensation algorithm of the harmful acceleration in traditional velocity solution, the accuracy advantage of the gravitational velocity based on dual quaternion is addressed. In view of the idea of the attitude and velocity algorithm based on dual quaternion, an improved navigation algorithm is proposed, which is as much as the rotation vector algorithm in computational complexity. According to this method, the attitude quaternion does not require compensating as the navigation frame rotates. In order to verify the correctness of the theoretical analysis, simulations are carried out utilizing the software, and the simulation results show that the accuracy of the improved algorithm is approximately equal to the dual quaternion algorithm.
基金Project supported by the National Key R&D Program of China(No.2017YFB1301003)the National Natural Science Foundation of China(Nos.61701439 and 61731002)+2 种基金the Zhejiang Key Research and Development Plan(Nos.2019C01002and 2019C03131)the Pro ject sponsored by Zhejiang Lab(No.2019LC0AB01)the Zhejiang Provincial Natural Science Foundation of China(No.LY20F010016)。
文摘Coordinating multiple unmanned aerial vehicles(multi-UAVs)is a challenging technique in highly dynamic and sophisticated environments.Based on digital pheromones as well as current mainstream unmanned system controlling algorithms,we propose a strategy for multi-UAVs to acquire targets with limited prior knowledge.In particular,we put forward a more reasonable and effective pheromone update mechanism,by improving digital pheromone fusion algorithms for different semantic pheromones and planning individuals’probabilistic behavioral decision-making schemes.Also,inspired by the flocking model in nature,considering the limitations of some individuals in perception and communication,we design a navigation algorithm model on top of Olfati-Saber’s algorithm for flocking control,by further replacing the pheromone scalar to a vector.Simulation results show that the proposed algorithm can yield superior performance in terms of coverage,detection and revisit efficiency,and the capability of obstacle avoidance.
文摘A new method is illustrated for processing the output of a set of triad orthogonal rate gyros and accelerometers to reconstruct vehicle navigation parameters(attitude, velocity, and position). The paper introduces two vectors with dimensions 4×1 as velocity and position quaternions.The navigation equations for strapdown systems are nonlinear but after using these parameters, the navigation equations are converted into a pseudo-linear system. The new set of navigation equations has an analytical solution and the state transition matrix is used to solve the linear timevarying differential equations through time series. The navigation parameters are updated using the new formulation for strapdown navigation equations. Finally, the quaternions of velocity and position are converted into the original position and velocity vectors. The combination of the coning motion and a translational oscillatory trajectory is used to evaluate the accuracy of the proposed algorithm. The simulations show significant improvement in the accuracy of the inertial navigation system, which is achieved through the mentioned algorithm.
基金supported by Grant EGD21QD15,the Research project of Shanghai Polytechnic University。
文摘The use of dead reckoning and fngerprint matching for navigation is a widespread technical method.However,fngerprint mismatching and low fusion accuracy are prevalent issues in indoor navigation systems.This work presents an improved dynamic time warping and a chicken particle flter to handle these two challenges.To generate the Horizontal and Vertical(HV)fngerprint,the pitch and roll are employed instead of the original fngerprint intensity to extract the horizontal and vertical components of the magnetic feld fngerprint.Derivative dynamic time warping employs the HV fngerprint in its derivative form,which receives higher-level features because of the consideration of fngerprint shape information.Chicken Swarm Optimization(CSO)is used to enhance particle weights,which minimizes position error to tackle the particle impoverishment problem for a fusion navigation system.The results of the experiments suggest that the enhanced algorithm can improve indoor navigation accuracy signifcantly.
基金funded by the National Natural Science Foundation of China(Grand No.:70903008)supported by COGS Lab in School of Government,Beijing Normal University
文摘Purpose: This study introduces an algorithm to construct tag trees that can be used as a userfriendly navigation tool for knowledge sharing and retrieval by solving two issues of previous studies, i.e. semantic drift and structural skew.Design/methodology/approach: Inspired by the generality based methods, this study builds tag trees from a co-occurrence tag network and uses the h-degree as a node generality metric. The proposed algorithm is characterized by the following four features:(1) the ancestors should be more representative than the descendants,(2) the semantic meaning along the ancestor-descendant paths needs to be coherent,(3) the children of one parent are collectively exhaustive and mutually exclusive in describing their parent, and(4) tags are roughly evenly distributed to their upper-level parents to avoid structural skew. Findings: The proposed algorithm has been compared with a well-established solution Heymann Tag Tree(HTT). The experimental results using a social tag dataset showed that the proposed algorithm with its default condition outperformed HTT in precision based on Open Directory Project(ODP) classification. It has been verified that h-degree can be applied as a better node generality metric compared with degree centrality.Research limitations: A thorough investigation into the evaluation methodology is needed, including user studies and a set of metrics for evaluating semantic coherence and navigation performance.Practical implications: The algorithm will benefit the use of digital resources by generating a flexible domain knowledge structure that is easy to navigate. It could be used to manage multiple resource collections even without social annotations since tags can be keywords created by authors or experts, as well as automatically extracted from text.Originality/value: Few previous studies paid attention to the issue of whether the tagging systems are easy to navigate for users. The contributions of this study are twofold:(1) an algorithm was developed to construct tag trees with consideration given to both semanticcoherence and structural balance and(2) the effectiveness of a node generality metric, h-degree, was investigated in a tag co-occurrence network.
文摘A land vehicle tracking and monitoring system based on the integration of differential global position system (DGPS), dead-reckoning (DR), and map matched technology is studied. In this paper, from the economic point of view, a new scheme using the one-way directional communication link, is presented. Moreover, 8-state Kalman filter is proposed for integrated DGPS/DR system. When field tests are carried out using two C/A code GARMIN GPS receiver, the positioning accuracy less than 5 m (1σ) is achieved.
基金supported by the National Natural Science Foundation of China (61104086) the National Defense Advanced Research Project of China (40405020401)
文摘Tree topologies, which construct spatial graphs with large characteristic path lengths and small clustering coefficients, are ubiquitous in deployments of wireless sensor networks. Small worlds are investigated in tree-based networks. Due to link ad- ditions, characteristic path lengths reduce rapidly and clustering coefficients increase greatly. A tree abstract, Cayley tree, is con- sidered for the study of the navigation algorithm, which runs auto- matically in the small worlds of tree-based networks. In the further study, epidemics in the small worlds of tree-based wireless sen- sor networks on the large scale are studied, and the percolation threshold is calculated, at which the outbreak of the epidemic takes place. Compared with Cayley tree, there is a smaller percolation threshold suffering from the epidemic.
文摘Hybrid metaheuristic algorithms play a prominent role in improving algorithms' searchability by combining each algorithm's advantages and minimizing any substantial shortcomings. The Quantum-based Avian Navigation Optimizer Algorithm (QANA) is a recent metaheuristic algorithm inspired by the navigation behavior of migratory birds. Different experimental results show that QANA is a competitive and applicable algorithm in different optimization fields. However, it suffers from shortcomings such as low solution quality and premature convergence when tackling some complex problems. Therefore, instead of proposing a new algorithm to solve these weaknesses, we use the advantages of the bonobo optimizer to improve global search capability and mitigate premature convergence of the original QANA. The effectiveness of the proposed Hybrid Quantum-based Avian Navigation Optimizer Algorithm (HQANA) is assessed on 29 test functions of the CEC 2018 benchmark test suite with different dimensions, 30, 50, and 100. The results are then statistically investigated by the Friedman test and compared with the results of eight well-known optimization algorithms, including PSO, KH, GWO, WOA, CSA, HOA, BO, and QANA. Ultimately, five constrained engineering optimization problems from the latest test suite, CEC 2020 are used to assess the applicability of HQANA to solve complex real-world engineering optimization problems. The experimental and statistical findings prove that the proposed HQANA algorithm is superior to the comparative algorithms.