The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,wh...The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.展开更多
An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorith...An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.展开更多
Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The alg...Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.展开更多
Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process ...Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process more complex.The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM.As a consequence of high complexity,the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder,leading inevitably to buffer overflows and information erasures.In this paper,we propose a bidirectional Viterbi algorithm(BVA)based on the bidirectional sequence decoding for OvTDM.With the BVA,the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis.The simulation results show that compared with Viterbi algorithm(VA),the decoding time of BVA can be reduced by about half.And the memory space of two decoders in BVA are about half of that in VA,which means that the BVA has lower memory requirements for decoder.And the decoding performance of BVA is almost the same as VA.展开更多
The multiple classifier system （MCS）, composed of multiple diverse classifiers or feed-forward neural networks, can significantly improve the classification or generalization ability of a single classifier. Enlighte...The multiple classifier system （MCS）, composed of multiple diverse classifiers or feed-forward neural networks, can significantly improve the classification or generalization ability of a single classifier. Enlightened by the fundamental idea of MCS, the ensemble is introduced into the quick learning for bidirectional associative memory （QLBAM） to construct a BAM ensemble, for improving the storage capacity and the error-correction capability without destroying the simple structure of the component BAM. Simulations show that, with an appropriate ＂overproduce and choose＂ strategy or ＂thinning＂ algorithm, the proposed BAM ensemble significantly outperforms the single QLBAM in both storage capacity and noise-tolerance capability.展开更多
In this study, the bidirectional reflectance distribution function （BRDF） of a one-dimensional conducting rough surface and a dielectric rough surface are calculated with different frequencies and roughness values i...In this study, the bidirectional reflectance distribution function （BRDF） of a one-dimensional conducting rough surface and a dielectric rough surface are calculated with different frequencies and roughness values in the microwave band by using the method of moments, and the relationship between the bistatic scattering coefficient and the BRDF of a rough surface is expressed. From the theory of the parameters of the rough surface BRDF, the parameters of the BRDF are obtained using a genetic algorithm. The BRDF of a rough surface is calculated using the obtained parameter values. Further, the fitting values and theoretical calculations of the BRDF are compared, and the optimization results are in agreement with the theoretical calculation results. Finally, a reference for BRDF modeling of a Gaussian rough surface in the microwave band is provided by the proposed method.展开更多
滚动轴承作为机械设备的重要部件,对其进行剩余使用寿命预测在企业的生产过程中变得越来越重要。目前,虽然主流的卷积神经网络(convolutional neural network, CNN)可以自动地从轴承的振动信号中提取特征,却不能给特征分配不同的权重来...滚动轴承作为机械设备的重要部件,对其进行剩余使用寿命预测在企业的生产过程中变得越来越重要。目前,虽然主流的卷积神经网络(convolutional neural network, CNN)可以自动地从轴承的振动信号中提取特征,却不能给特征分配不同的权重来提高模型对重要特征的关注程度,对于长时间序列容易丢失重要信息。另外,神经网络中隐藏层神经元个数、学习率以及正则化参数等超参数还需要依靠人工经验设置。为了解决上述问题,提出基于灰狼优化(grey wolf optimizer, GWO)算法、优化集合CNN、双向长短期记忆(bidirectional long short term memory, BiLSTM)网络和注意力机制(Attention)轴承剩余使用寿命预测方法。首先,从原始振动信号中提取时域、频域以及时频域特征指标构建可选特征集;然后,通过构建考虑特征相关性、鲁棒性和单调性的综合评价指标筛选出高于设定阈值的轴承退化敏感特征集,作为预测模型的输入;最后,将预测值和真实值的均方误差作为GWO算法的适应度函数,优化预测模型获得最优隐藏层神经元个数、学习率和正则化参数,利用优化后模型进行剩余使用寿命预测,并在公开数据集上进行验证。结果表明,所提方法可在非经验指导下获得最优的超参数组合,优化后的预测模型与未进行优化模型相比,平均绝对误差与均方根误差分别降低了28.8%和24.3%。展开更多
基金Supported by the EDD of China(No.80912020104)the Science and Technology Commission of Shanghai Municipality(No.22ZR1427700 and No.23692106900).
文摘The traditional A^(*)algorithm exhibits a low efficiency in the path planning of unmanned surface vehicles(USVs).In addition,the path planned presents numerous redundant inflection waypoints,and the security is low,which is not conducive to the control of USV and also affects navigation safety.In this paper,these problems were addressed through the following improvements.First,the path search angle and security were comprehensively considered,and a security expansion strategy of nodes based on the 5×5 neighborhood was proposed.The A^(*)algorithm search neighborhood was expanded from 3×3 to 5×5,and safe nodes were screened out for extension via the node security expansion strategy.This algorithm can also optimize path search angles while improving path security.Second,the distance from the current node to the target node was introduced into the heuristic function.The efficiency of the A^(*)algorithm was improved,and the path was smoothed using the Floyd algorithm.For the dynamic adjustment of the weight to improve the efficiency of DWA,the distance from the USV to the target point was introduced into the evaluation function of the dynamic-window approach(DWA)algorithm.Finally,combined with the local target point selection strategy,the optimized DWA algorithm was performed for local path planning.The experimental results show the smooth and safe path planned by the fusion algorithm,which can successfully avoid dynamic obstacles and is effective and feasible in path planning for USVs.
基金Supported by the Tianjin University of Technology Graduate R esearch Innovation Project(YJ2281).
文摘An improved version of the sparse A^(*)algorithm is proposed to address the common issue of excessive expansion of nodes and failure to consider current ship status and parameters in traditional path planning algorithms.This algorithm considers factors such as initial position and orientation of the ship,safety range,and ship draft to determine the optimal obstacle-avoiding route from the current to the destination point for ship planning.A coordinate transformation algorithm is also applied to convert commonly used latitude and longitude coordinates of ship travel paths to easily utilized and analyzed Cartesian coordinates.The algorithm incorporates a hierarchical chart processing algorithm to handle multilayered chart data.Furthermore,the algorithm considers the impact of ship length on grid size and density when implementing chart gridification,adjusting the grid size and density accordingly based on ship length.Simulation results show that compared to traditional path planning algorithms,the sparse A^(*)algorithm reduces the average number of path points by 25%,decreases the average maximum storage node number by 17%,and raises the average path turning angle by approximately 10°,effectively improving the safety of ship planning paths.
文摘Bidirectional Dijkstra algorithm whose time complexity is 8O(n~2) is proposed. The theory foundation is that the classical Dijkstra algorithm has not any directional feature during searching the shortest path. The algorithm takes advantage of the adjacent link and the mechanism of bidirectional search, that is, the algorithm processes the positive search from start point to destination point and the negative search from destination point to start point at the same time. Finally, combining with the practical application of route-planning algorithm in embedded real-time vehicle navigation system (ERTVNS), one example of its practical applications is given, analysis in theory and the experimental results show that compared with the Dijkstra algorithm, the new algorithm can reduce time complexity, and guarantee the searching precision, it satisfies the needs of ERTVNS.
文摘Overlapped time domain multiplexing(OvTDM)is an innovative encoding scheme that can obtain high spectral efficiency.However,the intentional inter-symbol interference(ISI)caused by OvTDM will make the decoding process more complex.The computational complexity of maximum likelihood sequence detection increases exponentially with the growth of spectral efficiency in OvTDM.As a consequence of high complexity,the decoding effort for a given spectral efficiency may occasionally exceed the physical limitations of the decoder,leading inevitably to buffer overflows and information erasures.In this paper,we propose a bidirectional Viterbi algorithm(BVA)based on the bidirectional sequence decoding for OvTDM.With the BVA,the decoding operation starts simultaneously from the both ends of the corresponding trellis and stops at the middle of trellis.The simulation results show that compared with Viterbi algorithm(VA),the decoding time of BVA can be reduced by about half.And the memory space of two decoders in BVA are about half of that in VA,which means that the BVA has lower memory requirements for decoder.And the decoding performance of BVA is almost the same as VA.
文摘The multiple classifier system （MCS）, composed of multiple diverse classifiers or feed-forward neural networks, can significantly improve the classification or generalization ability of a single classifier. Enlightened by the fundamental idea of MCS, the ensemble is introduced into the quick learning for bidirectional associative memory （QLBAM） to construct a BAM ensemble, for improving the storage capacity and the error-correction capability without destroying the simple structure of the component BAM. Simulations show that, with an appropriate ＂overproduce and choose＂ strategy or ＂thinning＂ algorithm, the proposed BAM ensemble significantly outperforms the single QLBAM in both storage capacity and noise-tolerance capability.
基金Project supported by the National Natural Science Foundation for Distinguished Young Scholars of China （Grant No. 61225002）, the Aeronautical Science Fund and Aviation Key Laboratory of Science and Technology on Avionics Integrated Sensor System Simulation, China （Grant No. 20132081015）, and the Fundamental Research Funds for the Central Universities, China （Grant No. SPSZ031403）
文摘In this study, the bidirectional reflectance distribution function （BRDF） of a one-dimensional conducting rough surface and a dielectric rough surface are calculated with different frequencies and roughness values in the microwave band by using the method of moments, and the relationship between the bistatic scattering coefficient and the BRDF of a rough surface is expressed. From the theory of the parameters of the rough surface BRDF, the parameters of the BRDF are obtained using a genetic algorithm. The BRDF of a rough surface is calculated using the obtained parameter values. Further, the fitting values and theoretical calculations of the BRDF are compared, and the optimization results are in agreement with the theoretical calculation results. Finally, a reference for BRDF modeling of a Gaussian rough surface in the microwave band is provided by the proposed method.
文摘滚动轴承作为机械设备的重要部件,对其进行剩余使用寿命预测在企业的生产过程中变得越来越重要。目前,虽然主流的卷积神经网络(convolutional neural network, CNN)可以自动地从轴承的振动信号中提取特征,却不能给特征分配不同的权重来提高模型对重要特征的关注程度,对于长时间序列容易丢失重要信息。另外,神经网络中隐藏层神经元个数、学习率以及正则化参数等超参数还需要依靠人工经验设置。为了解决上述问题,提出基于灰狼优化(grey wolf optimizer, GWO)算法、优化集合CNN、双向长短期记忆(bidirectional long short term memory, BiLSTM)网络和注意力机制(Attention)轴承剩余使用寿命预测方法。首先,从原始振动信号中提取时域、频域以及时频域特征指标构建可选特征集;然后,通过构建考虑特征相关性、鲁棒性和单调性的综合评价指标筛选出高于设定阈值的轴承退化敏感特征集,作为预测模型的输入;最后,将预测值和真实值的均方误差作为GWO算法的适应度函数,优化预测模型获得最优隐藏层神经元个数、学习率和正则化参数,利用优化后模型进行剩余使用寿命预测,并在公开数据集上进行验证。结果表明,所提方法可在非经验指导下获得最优的超参数组合,优化后的预测模型与未进行优化模型相比,平均绝对误差与均方根误差分别降低了28.8%和24.3%。
