检索结果-内蒙古大学图书馆

A safe route planning method for aircraft carriers based on improved dijkstra algorithm

PROCEEDINGS OF THE INSTITUTION OF MECHANICAL ENGINEERS PART M-JOURNAL OF ENGINEERING FOR THE MARITIME ENVIRONMENT 2025年

作者： Zhen, Chong Qu, Xiaolei Zhou, Yangyu Dong, Bohao Shenyang Aircraft Design & Res Inst Shenyang Peoples R China Northwestern Polytech Univ Sch Automat Xian Peoples R China Dalian Univ Technol State Key Lab Coastal & Offshore Engn Dalian Peoples R China Beihang Univ Sch Aeronaut Sci & Engn Beijing Peoples R China

A novel method for safe route planning has been developed to enhance the safety of aircraft carrier navigation and carrier-based aircraft landings. This method considers critical factors such as water depth, islands, wind, and wave conditions that affect carrier navigation safety. The adaptability of carrier-based aircraft landings to dynamic marine environments has been systematically analyzed. Then a framework has been proposed for detecting suitable landing areas for carrier-based aircraft. A dynamic ocean environmental field was constructed to support route planning by integrating numerical ocean models and reanalysis data. An improved dijkstra algorithm was employed to generate safe navigation routes, further refined using B & eacute;zier curve smoothing techniques. The proposed method was validated through simulations of an aircraft carrier's route planning task in the northwest Pacific during a typhoon event. The results demonstrate that the method ensures safe navigation for the aircraft carrier while meeting the operational requirements for carrier-based aircraft landings. These findings provide valuable support for enhancing the safety and reliability of aircraft carrier operations.

关键词： Ship safety security carrier-based aircraft landing ocean environment dijkstra algorithm B & eacute zier curve

来源：评论

学校读者我要写书评

暂无评论

dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system

引用

WIRELESS NETWORKS 2024年第3期30卷 1201-1219页

作者： Zhang, Jing Bai, Jingpan HuangHuai Univ Sch Int Educ Zhumadian 463000 Peoples R China Yangtze Univ Sch Comp Sci Jingzhou 430023 Peoples R China

Recently, the unmanned aerial vehicle (UAV)-assisted edge computing is proposed to improve the quality of service in some scenarios within sparse or unavailable base stations (BSs). Meanwhile, the caching technology is adopted to reduce the wireless traffic load and the data transmission delay. However, due to the limited storage capacity of edge nodes, the edge nodes cannot store all of the contents required by user equipment (UE). So, how to select the reasonable contents for caching on edge nodes to reduce the content delivery delay becomes a challenge in the UAV-assisted edge computing environment. In this paper, the dijkstra algorithm based cooperative caching strategy for UAV-assisted edge computing system is proposed. Specially, the content transmission delay between two nodes is computed. Then, for each requested content, the weighted edge-undirected graph (WEUG), in which one vertex represents one node, is built. Furthermore, dijkstra algorithm is adopted to achieve the minimal content transmission delay from the edge node caching the requested content to UE. Finally, the optimization problem of content caching is built, and the corresponding cache strategy is achieved by solving the optimization problem. The experimental results imply that the proposed cooperative caching algorithm can achieve better performance on the average content transmission delay, the average cache hit rate, and the total of hops, respectively, comparing with the benchmark algorithms.

关键词： Cooperative caching dijkstra algorithm UAVs Edge computing

来源：评论

学校读者我要写书评

暂无评论

dijkstra algorithm for shortest path problem under interval-valued Pythagorean fuzzy environment

引用

COMPLEX & INTELLIGENT SYSTEMS 2019年第2期5卷 93-100页

作者： Enayattabar, Mohammad Ebrahimnejad, Ali Motameni, Homayun Islamic Azad Univ Babol Branch Dept Comp Engn Babol Sar Iran Islamic Azad Univ Dept Math Qaemshahr Branch Qaemshahr Iran Islamic Azad Univ Dept Comp Engn Sari Branch Sari Iran

Pythagorean fuzzy set as an extension of fuzzy set has been presented to handle the uncertainty in real-world decision-making problems. In this work, we formulate a shortest path (SP) problem in an interval-valued Pythagorean fuzzy environment. Here, the costs related to arcs are taken in the form of interval-valued Pythagorean fuzzy numbers (IVPFNs). The main contributions of this paper are fourfold: (1) the interval-valued Pythagorean fuzzy optimality conditions in directed networks are described to design of solution algorithm. (2) To do this, an improved score function is used to compare the costs between different paths with their arc costs represented by IVPFNs. (3) Based on these optimality conditions and the improved score function, the traditional dijkstra algorithm is extended to find the cost of interval-valued Pythagorean fuzzy SP (IVPFSP) and corresponding IVPFSP. (4) Finally, a small sized telecommunication network is provided to illustrate the potential application of the proposed method.

关键词： Shortest path problem Pythagorean fuzzy numbers Score function dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

dijkstra algorithm Based Building Evacuation Edge Computing and IoT System Design and Implementation 8

Dijkstra Algorithm Based Building Evacuation Edge Computing ...

引用

IEEE International Conference on Progress in Informatics and Computing (IEEE PIC)

作者： Ji, Yanping Wang, Wensi Chen, Wangxin Zhang, Liting Yang, Mengyu Wang, Xiaowen Beijing Univ Technol Fac Informat Technol Beijing Peoples R China

ISBN: (纸本)9781665426558

Large and complex buildings built in China in recent years, such as Olympic venues, airports, and large hospitals, have brought new fire evacuation problems. Many designs are using Internet of Things (IOT) technology to enhance buildings' perception of flames and smoke. In this paper, in addition to using IoT to improve the fire-awareness of buildings, a set of algorithms based on the dijkstra' s shortest path method is designed to operate on the local FPGA edge computing terminal to determine the current optimal evacuation path. An IoT system with an evacuation lighting system provides an optimal route indication for people in the *** with the traditional Internet of Things and cloud computing technology, this design uses FPGA near the data terminal to process and analyze the collected data in real time, which effectively improves the speed of data response and Reduced bandwidth congestion caused by massive *** power consumption of *** system was tested in the office building of Beijing University of Technology, which can effectively indicate the path under different fire *** the event of a fire, the evacuation algorithm can be updated every 10 seconds, and the emergency lights are updated every 5 seconds and indicate an emergency route.

关键词： dijkstra algorithm building evacuation internet of things edge computing

来源：评论

学校读者我要写书评

暂无评论

dijkstra algorithm Based Ray Tracing: A Case Study for Tunnel Structures 32

Dijkstra Algorithm Based Ray Tracing: A Case Study for Tunne...

引用

32nd IEEE International Conference on Advanced Information Networking and Applications (IEEE AINA)

作者： Uchida, Kazunori Barolli, Leonard Fukuoka Inst Technol Fukuoka 8110295 Japan

ISBN: (纸本)9781538653951

This paper deals with ray tracing in a closed space such as tunnel or underground by using the numerical method based on dijkstra algorithm (DA). The essence of the method is to modify the DA based proximity matrix in terms of three procedures, that is, path selection, path linearization and line of sight (LOS) check. This method has successively been applied to ray tracing in an open space such as a random rough surface. When we treat a closed space, however, more detailed discussions are required than in the case of an open space, because we must take account of the effects of floor, ceiling and side walls at the same time. In this paper we propose procedures for LOS check to solve this difficult situation. Numerical examples are shown for the traced rays and cost distributions in sinusoidal and cross type tunnels.

关键词： dijkstra algorithm Discrete Ray Tracing LOS Check Tunnel Propagation

来源：评论

学校读者我要写书评

暂无评论

Estimation of longitudinal profile of road surface from stereo disparity using dijkstra algorithm

引用

INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2014年第4期12卷 895-903页

作者： Lee, Ki-Yong Park, Jeong-Min Lee, Joon-Woong Samsung Elect Gwnagju South Korea Chonnam Natl Univ Dept Ind Engn Kwangju 500757 South Korea

A novel algorithm capable of estimating the profile of the road surface along the cameraviewing direction is proposed. When a disparity map from stereo matching is given, the algorithm estimates the profile precisely by applying the dijkstra algorithm to a v-disparity representation. Although the road surface is very changeable, many algorithms of road scene analysis have relied on flatroad assumption or have estimated the profile roughly. The combination of the dijkstra algorithm and a v-disparity representation contributes to eliminating such assumption and limit. We demonstrated the validity of the proposed algorithm by performing experiments with many road images.

关键词： dijkstra algorithm longitudinal profile of road surface stereo vision v-disparity representation

来源：评论

学校读者我要写书评

暂无评论

Fuzzy dijkstra algorithm for shortest path problem under uncertain environment

引用

APPLIED SOFT COMPUTING 2012年第3期12卷 1231-1237页

作者： Deng, Yong Chen, Yuxin Zhang, Yajuan Mahadevan, Sankaran Southwest Univ Sch Comp & Informat Sci Chongqing 400715 Peoples R China Shanghai Jiao Tong Univ Sch Elect & Informat Technol Shanghai 200240 Peoples R China Vanderbilt Univ Sch Engn Nashville TN 37235 USA

A common algorithm to solve the shortest path problem (SPP) is the dijkstra algorithm. In this paper, a generalized dijkstra algorithm is proposed to handle SPP in an uncertain environment. Two key issues need to be addressed in SPP with fuzzy parameters. One is how to determine the addition of two edges. The other is how to compare the distance between two different paths with their edge lengths represented by fuzzy numbers. To solve these problems, the graded mean integration representation of fuzzy numbers is adopted to improve the classical dijkstra algorithm. A numerical example of a transportation network is used to illustrate the efficiency of the proposed method. (C) 2011 Elsevier B.V. All rights reserved.

关键词： Shortest path problem dijkstra algorithm Fuzzy numbers Graded mean representation

来源：评论

学校读者我要写书评

暂无评论

An optimization study based on dijkstra algorithm for a network with trapezoidal picture fuzzy numbers

引用

NEURAL COMPUTING & APPLICATIONS 2021年第4期33卷 1329-1342页

作者： Akram, Muhammad Habib, Amna Alcantud, Jose Carlos R. Univ Punjab Dept Math New Campus Lahore Pakistan Univ Salamanca BORDA Res Unit Salamanca 37007 Spain Univ Salamanca IME Salamanca 37007 Spain

Path finding models attempt to provide efficient approaches for finding shortest paths in networks. A well-known shortest path algorithm is the dijkstra algorithm. This paper redesigns it in order to tackle situations in which the parameters of the networks may be uncertain. To be precise, we allow that the parameters take the form of special picture fuzzy numbers. We use this concept so that it can flexibly fit the vague character of subjective decisions. The main contributions of this article are fourfold: (i) The trapezoidal picture fuzzy number along with its graphical representation and operational laws is defined. (ii) The comparison of trapezoidal picture fuzzy numbers on the basis of their expected values is proposed in terms of their score and accuracy functions. (iii) Based on these elements, we put forward an adapted form of the dijkstra algorithm that works out a picture fuzzy shortest path problem, where the costs associated with the arcs are captured by trapezoidal picture fuzzy numbers. Also, a pseudocode for the application of our solution is provided. (iv) The proposed algorithm is numerically evaluated on a transmission network to prove its practicality and efficiency. Finally, a comparative analysis of our proposed method with the fuzzy dijkstra algorithm is presented to support its cogency.

关键词： Picture fuzzy number Trapezoidal picture fuzzy number Score function Shortest path problem dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fire Escape Simulation System Based on the dijkstra algorithm

引用

Computer Systems Science & Engineering 2021年第12期39卷 365-372页

作者： Haolong Yang Chunqiang Hu Guwei Li Jingchun Fan ChongQing University ChongQing400000China Zhejiang Dongfang Polytechnic WenZhou325000China Compugen Ltd TorontoM2J 4A6Canada

Despite the support of all kinds of fire prevention measures and high-tech fire prevention equipment,fires still occur frequently because of both anthro-pogenic factors and natural *** issue has drawn the attention of schools,all levels of government,and other *** types of organi-zations carry out fire drills throughout the *** this kind of drill cannot anticipate the specific circumstances of each fire,which are generally far more complicated than drills,most people cannot correctly choose the optimal escape route from real ***,a fire-scene virtual simulation system based on the dijkstra algorithm is here proposed to address such problems as casualties caused by frequent fires and the inability of most people to correctly choose a fire escape *** virtual fire escape simulation system uses Maya to carry out 3D recon-struction of the fire scene,the Unity engine to conduct interactive function design,and the dijkstra algorithm to calculate the best escape *** results of the example indicate that the simulation system solves the problems of the traditional simulation system,such as stiffness,lack of intelligence,and poor simulation.

关键词： dijkstra algorithm virtual fire escape simulation system fire

来源：评论

学校读者我要写书评

暂无评论

Web Service Composition Using The Bidirectional dijkstra algorithm

引用

IEEE LATIN AMERICA TRANSACTIONS 2016年第5期14卷 2522-2528页

作者： Moo, F. Hernandez, R. Uc, V. Madera, F. Univ Autonoma Yucatan Comp Sci Merida Yucatan Mexico Univ Autonoma Yucatan Merida Yucatan Mexico Univ Autonoma Yucatan Fac Matemat Merida Yucatan Mexico

Web services are not always able to fulfill customer requirements on their own, so in those cases it can choose to make a composition of web services. However, this is a complex problem since it must take into account the large number of available services, performance requirements, and other factors related to quality of service (QoS). Representing the problem of web service composition as a graph, some methods were used that do not ensure optimum solution. In this work the bidirectional dijkstra algorithm is proposed to solve the problem of web services composition. Experimental results show that, as the number of web service classes increases, proposed algorithm performance improves.

关键词： web service composition dijkstra algorithm bidirectional search dynamic programming

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：