期刊文献+
共找到6篇文章
< 1 >
每页显示 20 50 100
Optimal search path planning of UUV in battlefeld ambush scene
1
作者 Wei Feng Yan Ma +3 位作者 Heng Li Haixiao Liu Xiangyao Meng Mo Zhou 《Defence Technology(防务技术)》 SCIE EI CAS CSCD 2024年第2期541-552,共12页
Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical ... Aiming at the practical application of Unmanned Underwater Vehicle(UUV)in underwater combat,this paper proposes a battlefield ambush scene with UUV considering ocean current.Firstly,by establishing these mathematical models of ocean current environment,target movement,and sonar detection,the probability calculation methods of single UUV searching target and multiple UUV cooperatively searching target are given respectively.Then,based on the Hybrid Quantum-behaved Particle Swarm Optimization(HQPSO)algorithm,the path with the highest target search probability is found.Finally,through simulation calculations,the influence of different UUV parameters and target parameters on the target search probability is analyzed,and the minimum number of UUVs that need to be deployed to complete the ambush task is demonstrated,and the optimal search path scheme is obtained.The method proposed in this paper provides a theoretical basis for the practical application of UUV in the future combat. 展开更多
关键词 Battlefield ambush Optimal search path planning UUV path Planning Probability of cooperative search
下载PDF
Automatic wiring method for switchgear design 被引量:1
2
作者 Shi Kanle Gao Ying +2 位作者 Wu Zijian Zhang Hui Yong Junhai 《Computer Aided Drafting,Design and Manufacturing》 2017年第2期32-38,共7页
An automatic 3D wiring method for switchgear design is proposed in this paper. First, wiring constraints are created, and a corresponding evaluation model is proposed. Then, based on the structure of the cabinet, we p... An automatic 3D wiring method for switchgear design is proposed in this paper. First, wiring constraints are created, and a corresponding evaluation model is proposed. Then, based on the structure of the cabinet, we propose a contour expansion scheme to construct rough paths. Different wiring features of the switchgear are used to connect rough local paths. All the paths are represented in a uniform data structure and forma path network. Finally, an improved A* algorithm is used to search the wiring path between the components in the routing network; the evaluation model is considered as heuristic rules for path searching. The result can satisfy the practical requirements of switchgear design. Experimental results are also provided. 展开更多
关键词 wiring method path searching contour expansion switchgear design A* algorithm
下载PDF
Rectangle expansion A* pathfinding for grid maps 被引量:10
3
作者 Zhang An Li Chong Bi Wenhao 《Chinese Journal of Aeronautics》 SCIE EI CAS CSCD 2016年第5期1385-1396,共12页
Search speed, quality of resulting paths and the cost of pre-processing are the principle evaluation metrics of a pathfinding algorithm. In this paper, a new algorithm for grid-based maps, rectangle expansion A* (RE... Search speed, quality of resulting paths and the cost of pre-processing are the principle evaluation metrics of a pathfinding algorithm. In this paper, a new algorithm for grid-based maps, rectangle expansion A* (REA*), is presented that improves the performance of A* significantly. REA* explores maps in units of unblocked rectangles. All unnecessary points inside the rectangles are pruned and boundaries of the rectangles (instead of individual points within those boundaries) are used as search nodes. This makes the algorithm plot fewer points and have a much shorter open list than A*. REA* returns jump and grid-optimal path points, but since the line of sight between jump points is protected by the unblocked rectangles, the resulting path of REA" is usually better than grid-optimal. The algorithm is entirely online and requires no offline pre-processing. Experimental results for typical benchmark problem sets show that REA* can speed up a highly optimized A* by an order of magnitude and more while preserving completeness and optimality. This new algorithm is competitive with other highly successful variants of A*. 展开更多
关键词 Breaking path symmetries Grid Heuristic algorithms path search Variant of A*
原文传递
Dispatching Fuel-cell Hybrid Electric Vehicles Toward Transportation and Energy Systems Integration 被引量:1
4
作者 Dejie Zhao Ming Zhou +3 位作者 Jianxiao Wang Tiance Zhang Gengyin Li Honghui Zhang 《CSEE Journal of Power and Energy Systems》 SCIE EI CSCD 2023年第4期1540-1550,共11页
With the increasing integration of traditional elec-tric vehicles(EVs),the ensuing congestion and overloading issues have threatened the reliability of power grid operations.Hydrogen has been advocated as a promising ... With the increasing integration of traditional elec-tric vehicles(EVs),the ensuing congestion and overloading issues have threatened the reliability of power grid operations.Hydrogen has been advocated as a promising energy carrier to achieve low-carbon transportation and energy(trans-energy)systems,which can support the popularization of fuel-cell hybrid EVs(FCHEVs)while enhancing the flexibility of power grids.In this paper,we propose an optimal scheduling framework for trans-energy systems that evaluates the merits of the hydrogen supply chain from water electrolysis,compressed storage and transportation to FCHEV utilization.A detailed FCHEV model is established,and mileage is modeled as a function of the stored electricity and hydrogen mass.A stochastic programming-based scheduling model is formulated,which minimizes the total cost of unit commitment and the hydrogen supply chain.The Dijkstra algorithm is adopted to search the shortest path for hydrogen transportation.Case studies demonstrate that FCHEVs can reduce the operational costs of tran-energy systems and facilitate the accommodation of renewable energy when compared to traditional EVs.Index Terms-Fuel-cell hybrid electric vehicle,hydrogen,mileage model,shortest path search,trans-energy systems. 展开更多
关键词 Fuel-cell hybrid electric vehicle hydrogen mileage model shortest path search trans-energy systems.
原文传递
Novel Positive Multi-Layer Graph Based Method for Collaborative Filtering Recommender Systems
5
作者 Bushra Alhijawi Ghazi AL-Naymat 《Journal of Computer Science & Technology》 SCIE EI CSCD 2022年第4期975-990,共16页
Recommender systems play an increasingly important role in a wide variety of applications to help users find favorite products. Collaborative filtering has remarkable success in terms of accuracy and becomes one of th... Recommender systems play an increasingly important role in a wide variety of applications to help users find favorite products. Collaborative filtering has remarkable success in terms of accuracy and becomes one of the most popular recommendation methods. However, these methods have shown unpretentious performance in terms of novelty, diversity, and coverage. We propose a novel graph-based collaborative filtering method, namely Positive Multi-Layer Graph-Based Recommender System (PMLG-RS). PMLG-RS involves a positive multi-layer graph and a path search algorithm to generate recommendations. The positive multi-layer graph consists of two connected layers: the user and item layers. PMLG-RS requires developing a new path search method that finds the shortest path with the highest cost from a source node to every other node. A set of experiments are conducted to compare the PMLG-RS with well-known recommendation methods based on three benchmark datasets, MovieLens-100K, MovieLens-Last, and Film Trust. The results demonstrate the superiority of PMLG-RS and its high capability in making relevant, novel, and diverse recommendations for users. 展开更多
关键词 recommender system collaborative filtering graph theory path search NOVELTY COVERAGE DIVERSITY
原文传递
Network-Based Multiple UAVs Search Planning for Disaster Relief
6
作者 Hozumi Morohosi 《Journal of the Operations Research Society of China》 EI CSCD 2020年第4期669-679,共11页
This paper studies the use of multiple unmanned aerial vehicles(UAVs)for searching a victim of disaster.We propose a network-based optimization model for planning the search path of multiple UAVs in a disaster-stricke... This paper studies the use of multiple unmanned aerial vehicles(UAVs)for searching a victim of disaster.We propose a network-based optimization model for planning the search path of multiple UAVs in a disaster-stricken area and estimating the number of UAVs necessary for search.A heuristic algorithm is devised to solve the optimization model and applied to the problem instances taken from potential hazard areas in Japan.Our computational result shows relatively small number of UAVs is enough to cover the area in most of cases.We also give an investigation on the relation between search area and the number of UAVs necessary for search via regression methods. 展开更多
关键词 DRONES Search path Network model
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部