This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapi...This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.展开更多
针对联锁系统进路搜索效率低下的问题,分析了广度优先、A*等搜索算法的局限性,提出了一种带有约束条件的深度优先搜索(DFS)进路搜索算法,搭建站场型拓扑网络,动态创建二叉树模型,设计改进DFS进路搜索算法的程序流程。从教学角度提出软...针对联锁系统进路搜索效率低下的问题,分析了广度优先、A*等搜索算法的局限性,提出了一种带有约束条件的深度优先搜索(DFS)进路搜索算法,搭建站场型拓扑网络,动态创建二叉树模型,设计改进DFS进路搜索算法的程序流程。从教学角度提出软件设计方案,以Visual Studio 2010为平台进行软件开发,实现CTCS-3级列控系统中的联锁仿真教学系统,该系统不但具备良好的可操作性,还集成故障设置、通信数据包查询等功能。展开更多
Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes ...Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes up 90% time-consuming in typical motion estimation-based depth-map generation algorithms. In order to reduce the computational complexity, in this paper a new fast depth-map generation algorithm based on motion search is developed, in which a fast diamond search algorithm is adopted to decide whether a 16x16 or 4x4 block size is used based on Sobel operator in the motion search module to obtain a sub-depth-map. Then the sub-depth-map will be fused with the sub-depth-maps gotten from depth from color component Cr and depth from linear perspective modules to compensate and refine detail of the depth-map, finally obtain a better depth-map. The simulation results demonstrate that the new approach can greatly reduce over 50% computational complexity compared to other existing methods.展开更多
提出一种基于深度优先贪婪搜索(Depth First Greedy Search Partitioning,DFGSP)的分像素插值任务划分映射方法,采用任务并行的方式,按深度优先搜索节点的方式减少子任务之间的通信量。对分像素插值算法的数据流图划分后设计合理并行方...提出一种基于深度优先贪婪搜索(Depth First Greedy Search Partitioning,DFGSP)的分像素插值任务划分映射方法,采用任务并行的方式,按深度优先搜索节点的方式减少子任务之间的通信量。对分像素插值算法的数据流图划分后设计合理并行方案,以极大限度利用处理元为原则进行贪婪搜索,并在项目组前期研究的阵列处理器(DPR-CODEC)上加速实现。实验表明,该方法执行时间远低于两步搜索方案,与未优化的原始HEVC插值滤波器相比,硬件资源占用减少72%。展开更多
To reduce the computational complexity and storage cost caused by wedge segmentation algorithm,a scheme of simplifying wedge matching is proposed.It takes advantage of the correlation of the wedge separation line of d...To reduce the computational complexity and storage cost caused by wedge segmentation algorithm,a scheme of simplifying wedge matching is proposed.It takes advantage of the correlation of the wedge separation line of depth map and the direction of intra-prediction for 3D high-efficiency video coding(3D-HEVC).According to the difference of wedge segmentation between adjacent edge and opposite edge,a set only including 104×4 wedgelet templates is given.By expanding of the wedge wave of a certain minimum unit,a simple separation line acquisition method for different size of depth block is put forward.Furthermore,based on the array processor(DPR-CODEC)developed by project team,an efficient parallel scheme of the improved wedge segmentation mode prediction is introduced.By the scheme,prediction unit(PU)size can be changed randomly from 4×4 to 8×8,16×16,and 32×32,which is more in line with the needs of the HEVC standard.Veri-fied with test sequence in HTM16.1 and the Xilinx virtex-6 field programmable gate array(FPGA)respectively,the experiment results show that the proposed methods save 99.2%of the storage space and 63.94%of the encoding time,the serial/parallel acceleration ratio of each template reaches 1.84 in average.The coding performance,storage and resource consumption are considered for both.展开更多
This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and ...This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and BFS（Breadth First Search） algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.展开更多
随着电力系统中多类型直流线路占比的逐步提升,调度系统与异构平台间的潮流数据交换需求明显增大,亟需研究新形态下交直流混联系统的潮流计算数据生成问题。该文从拓扑转换、网络拓扑分析、设备建模以及数据生成策略4个主要步骤,实现含...随着电力系统中多类型直流线路占比的逐步提升,调度系统与异构平台间的潮流数据交换需求明显增大,亟需研究新形态下交直流混联系统的潮流计算数据生成问题。该文从拓扑转换、网络拓扑分析、设备建模以及数据生成策略4个主要步骤,实现含交直流系统的基于可扩展标记语言的通用信息模型(common information model/extensible markup language,CIM/XML)数据到潮流计算输入数据的转换。首先,该文从设备间开关拓扑的角度,进行深度优先算法(depth first search,DFS)搜索和设备拓扑拼接,实现开关/节点模型到母线/支路模型的转换;其次,在筛选出活拓扑岛、剔除不带电设备后,着重分析了CIM/XML中换流器建模对交直流节点选取的影响,进而提出了直流节点选取规则和具备普适性的直流数据生成策略。最后,以某地调度500kV及以上交直流网络导出的CIM/XML数据为算例,潮流计算结果与数据采集与监视控制系统(supervisory control and data acquisition,SCADA)量测数据比对验证所提策略的有效性。展开更多
基金the National Natural Science Foundation of China(Grant No.42274119)the Liaoning Revitalization Talents Program(Grant No.XLYC2002082)+1 种基金National Key Research and Development Plan Key Special Projects of Science and Technology Military Civil Integration(Grant No.2022YFF1400500)the Key Project of Science and Technology Commission of the Central Military Commission.
文摘This study focuses on the improvement of path planning efficiency for underwater gravity-aided navigation.Firstly,a Depth Sorting Fast Search(DSFS)algorithm was proposed to improve the planning speed of the Quick Rapidly-exploring Random Trees*(Q-RRT*)algorithm.A cost inequality relationship between an ancestor and its descendants was derived,and the ancestors were filtered accordingly.Secondly,the underwater gravity-aided navigation path planning system was designed based on the DSFS algorithm,taking into account the fitness,safety,and asymptotic optimality of the routes,according to the gravity suitability distribution of the navigation space.Finally,experimental comparisons of the computing performance of the ChooseParent procedure,the Rewire procedure,and the combination of the two procedures for Q-RRT*and DSFS were conducted under the same planning environment and parameter conditions,respectively.The results showed that the computational efficiency of the DSFS algorithm was improved by about 1.2 times compared with the Q-RRT*algorithm while ensuring correct computational results.
文摘针对联锁系统进路搜索效率低下的问题,分析了广度优先、A*等搜索算法的局限性,提出了一种带有约束条件的深度优先搜索(DFS)进路搜索算法,搭建站场型拓扑网络,动态创建二叉树模型,设计改进DFS进路搜索算法的程序流程。从教学角度提出软件设计方案,以Visual Studio 2010为平台进行软件开发,实现CTCS-3级列控系统中的联锁仿真教学系统,该系统不但具备良好的可操作性,还集成故障设置、通信数据包查询等功能。
文摘Generation of a depth-map from 2D video is the kernel of DIBR (Depth Image Based Rendering) in 2D-3D video conversion systems. However it occupies over most of the system resource where the motion search module takes up 90% time-consuming in typical motion estimation-based depth-map generation algorithms. In order to reduce the computational complexity, in this paper a new fast depth-map generation algorithm based on motion search is developed, in which a fast diamond search algorithm is adopted to decide whether a 16x16 or 4x4 block size is used based on Sobel operator in the motion search module to obtain a sub-depth-map. Then the sub-depth-map will be fused with the sub-depth-maps gotten from depth from color component Cr and depth from linear perspective modules to compensate and refine detail of the depth-map, finally obtain a better depth-map. The simulation results demonstrate that the new approach can greatly reduce over 50% computational complexity compared to other existing methods.
文摘提出一种基于深度优先贪婪搜索(Depth First Greedy Search Partitioning,DFGSP)的分像素插值任务划分映射方法,采用任务并行的方式,按深度优先搜索节点的方式减少子任务之间的通信量。对分像素插值算法的数据流图划分后设计合理并行方案,以极大限度利用处理元为原则进行贪婪搜索,并在项目组前期研究的阵列处理器(DPR-CODEC)上加速实现。实验表明,该方法执行时间远低于两步搜索方案,与未优化的原始HEVC插值滤波器相比,硬件资源占用减少72%。
基金the National Natural Science Foundation of China(No.61834005,61772417,61802304,61602377,61874087,61634004)Shaanxi International Science and Technology Cooperation Program(No.2018KW-006).
文摘To reduce the computational complexity and storage cost caused by wedge segmentation algorithm,a scheme of simplifying wedge matching is proposed.It takes advantage of the correlation of the wedge separation line of depth map and the direction of intra-prediction for 3D high-efficiency video coding(3D-HEVC).According to the difference of wedge segmentation between adjacent edge and opposite edge,a set only including 104×4 wedgelet templates is given.By expanding of the wedge wave of a certain minimum unit,a simple separation line acquisition method for different size of depth block is put forward.Furthermore,based on the array processor(DPR-CODEC)developed by project team,an efficient parallel scheme of the improved wedge segmentation mode prediction is introduced.By the scheme,prediction unit(PU)size can be changed randomly from 4×4 to 8×8,16×16,and 32×32,which is more in line with the needs of the HEVC standard.Veri-fied with test sequence in HTM16.1 and the Xilinx virtex-6 field programmable gate array(FPGA)respectively,the experiment results show that the proposed methods save 99.2%of the storage space and 63.94%of the encoding time,the serial/parallel acceleration ratio of each template reaches 1.84 in average.The coding performance,storage and resource consumption are considered for both.
文摘This paper introduces the general process of the search algorithm Structure through the knight problem. According to the characteristics of the problem, we detailed discuss the DFS（Depth First Search） algorithm and BFS（Breadth First Search） algorithm, and combine the two algorithms together to solve the knights coverage problem. This article has a good reference for the mixed-use scenarios which requires a variety of search algorithms.
文摘随着电力系统中多类型直流线路占比的逐步提升,调度系统与异构平台间的潮流数据交换需求明显增大,亟需研究新形态下交直流混联系统的潮流计算数据生成问题。该文从拓扑转换、网络拓扑分析、设备建模以及数据生成策略4个主要步骤,实现含交直流系统的基于可扩展标记语言的通用信息模型(common information model/extensible markup language,CIM/XML)数据到潮流计算输入数据的转换。首先,该文从设备间开关拓扑的角度,进行深度优先算法(depth first search,DFS)搜索和设备拓扑拼接,实现开关/节点模型到母线/支路模型的转换;其次,在筛选出活拓扑岛、剔除不带电设备后,着重分析了CIM/XML中换流器建模对交直流节点选取的影响,进而提出了直流节点选取规则和具备普适性的直流数据生成策略。最后,以某地调度500kV及以上交直流网络导出的CIM/XML数据为算例,潮流计算结果与数据采集与监视控制系统(supervisory control and data acquisition,SCADA)量测数据比对验证所提策略的有效性。
