针对无迹卡尔曼滤波(unscented Kalman filter,UKF)算法估计锂电池荷电状态(state of charge,SOC)时精度低、稳定性差、产生的sigma点过多导致计算难度大等不足,提出一种基于自适应球形不敏变换方式的无迹卡尔曼滤波(unscented Kalman f...针对无迹卡尔曼滤波(unscented Kalman filter,UKF)算法估计锂电池荷电状态(state of charge,SOC)时精度低、稳定性差、产生的sigma点过多导致计算难度大等不足,提出一种基于自适应球形不敏变换方式的无迹卡尔曼滤波(unscented Kalman filter based on adaptive spherical insensitive transformation,ASIT-UKF)算法。该算法通过使用球形不敏变换方式选择权系数以及初始化一元向量对sigma点的产生进行选取。与UKF算法相比,ASIT-UKF算法产生的sigma点减少近50%,使得算法的计算复杂度大大降低。同时,将产生的所有sigma点进行单位球形面上的归一化处理,提高了数值的稳定性。考虑到实际运行中锂电池系统噪声干扰带来的不确定性,加入Sage-Husa自适应滤波器对不确定性噪声的干扰进行实时更新和修正,以达到提高在线锂电池SOC估计精度的目的。最后,将均方根误差和最大绝对误差计算公式引入到性能估计指标中。实验结果表明,ASIT-UKF算法在准确度、鲁棒性和收敛性方面具有优越的性能。展开更多
This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent ...This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.展开更多
文摘针对无迹卡尔曼滤波(unscented Kalman filter,UKF)算法估计锂电池荷电状态(state of charge,SOC)时精度低、稳定性差、产生的sigma点过多导致计算难度大等不足,提出一种基于自适应球形不敏变换方式的无迹卡尔曼滤波(unscented Kalman filter based on adaptive spherical insensitive transformation,ASIT-UKF)算法。该算法通过使用球形不敏变换方式选择权系数以及初始化一元向量对sigma点的产生进行选取。与UKF算法相比,ASIT-UKF算法产生的sigma点减少近50%,使得算法的计算复杂度大大降低。同时,将产生的所有sigma点进行单位球形面上的归一化处理,提高了数值的稳定性。考虑到实际运行中锂电池系统噪声干扰带来的不确定性,加入Sage-Husa自适应滤波器对不确定性噪声的干扰进行实时更新和修正,以达到提高在线锂电池SOC估计精度的目的。最后,将均方根误差和最大绝对误差计算公式引入到性能估计指标中。实验结果表明,ASIT-UKF算法在准确度、鲁棒性和收敛性方面具有优越的性能。
基金supported by the National Natural Science Foundationof China(No.61079001)
文摘This paper proposes a new method for dynamic airspace configuration based on a weighted graph model. The method begins with the construction of an undirected graph for the given airspace, where the vertices represent those key points such as airports, waypoints, and the edges represent those air routes. Those vertices are used as the sites of Voronoi diagram, which divides the airspace into units called as cells. Then, aircraft counts of both each cell and of each air-route are computed. Thus, by assigning both the vertices and the edges with those aircraft counts, a weighted graph model comes into being. Accordingly the airspace configuration problem is described as a weighted graph partitioning problem. Then, the problem is solved by a graph partitioning algorithm, which is a mixture of general weighted graph cuts algorithm, an optimal dynamic load balancing algorithm and a heuristic algorithm. After the cuts algorithm partitions the model into sub-graphs, the load balancing algorithm together with the heuristic algorithm transfers aircraft counts to balance workload among sub-graphs. Lastly, airspace configuration is completed by determining the sector boundaries. The simulation result shows that the designed sectors satisfy not only workload balancing condition, but also the constraints such as convexity, connectivity, as well as minimum distance constraint.
