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

A q-learning approach for enhanced routing in dynamic LEO satellite networks

EGYPTIAN JOURNAL OF REMOTE SENSING AND SPACE SCIENCES 2025年第2期28卷 272-279页

作者： Riyad, Ahmed E. Mokhtar, Medhat Belal, Mohamed A. Bahloul, Mahmoud Mohamed El Obour Inst Dept Informat Syst Cairo Egypt Natl Author Remote Sensing & Space Sci Cairo Egypt 6 October Technol Univ Helwan Univ Fac Comp & Artificial Intelligence Comp Sci Cairo Egypt Helwan Univ Fac Commerce & Business Adm Business Informat Syst Dept Business Informat Syst Cairo Egypt

As global communication demand rises, Low Earth Orbit (LEO) satellite systems offer high-speed data transmission and extensive coverage options but face routing challenges due to dynamic topologies. This paper introduces a Q-Learning-based routing approach that converts dynamic networks into virtually static topologies at different snapshot intervals. Simulation results on a 66-satellite Starlink constellation demonstrate that QLearning outperforms dijkstra's algorithm, achieving faster convergence and reduced latency. These findings highlight the potential for Q-Learning in enhancing efficient, cost-effective satellite communications.

关键词： Q-learning LEO satellite constellation Optical ISLs Machine learning Satellite routing algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

4PL routing problem using hybrid beetle swarm optimization

引用

SOFT COMPUTING 2023年第22期27卷 17011-17024页

作者： Lu, Fuqiang Chen, Weidong Feng, Wenjing Bi, Hualing Yanshan Univ Sch Econ & Management Qinhuangdao 066004 Peoples R China Northeastern Univ Fac Informat Sci & Engn Shenyang 810819 Peoples R China Northeastern Univ Qinhuangdao 066004 Peoples R China

From the view of comprehensive consideration, this considers the uncertainty of transportation time and cost due to seasonality and human factors, and a multi-objective chance constrained programming model with minimum transportation time and cost was established. Due to the complexity of the problem, traditional algorithms are not enough, and more efficient optimization algorithms are still needed. According to the characteristics of the problem, the beetle antennae search (BAS) with one beetle is changed into multiple beetles, and dijkstra algorithm is embedded, a hybrid beetle swarm optimization algorithm (HBSO) is designed to solve the problem, and the case analysis and algorithm analysis are made for three different examples;the datasets are referenced in literature (Lu et al. in Computer Integrated Manufacturing Systems 5:10-14, 2020). Under the three examples, the influence of the customer on the time and cost is different. The confidence level and weight of cost and time have great influence on the decision results. 4PL provider will not affect the choice of transportation route, but will change the choice of 3PL supplier and transportation mode. HBSO is an effective method to solve this problem. It is proved on efficiency, effectiveness and reliability in experiments by comparing with GA, PSO and BAS.

关键词： Fourth party logistics Routing problem Chance constrained programming Beetle swarm algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

SITE selection and optimization for urban epidemic prevention material distribution points 7

SITE selection and optimization for urban epidemic preventio...

引用

7th International Conference on Traffic Engineering and Transportation System (ICTETS)

作者： Gao, Renjie Wei, Zhexue Shandong Normal Univ Sch Business Jinan Peoples R China

ISBN: (纸本)9781510674479

During a large-scale epidemic outbreak, the strategic planning of storage and distribution locations for essential life supplies becomes of paramount importance. This article focuses on the scientific supply of epidemic-related goods, taking the case of Changchun city as an example. It considered the human resource costs involved in the supply chain and constructed an organized network diagram for the supply of essential life supplies to residents. The results indicate that through the analysis of the shortest paths, we derive the optimal number of distribution points for essential life supplies in various administrative regions and outlines detailed plans for the provision of these supplies to residents. This article establishes a solid theoretical and practical foundation for future emergency management strategies.

关键词： Epidemic Prevention site selection material transportation k-means plus plus algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

QS-dijkstra: A Safety-Enhanced Routing algorithm on SDN Framework 2021

QS-Dijkstra: A Safety-Enhanced Routing Algorithm on SDN Fram...

引用

2021 10th International Conference on Internet Computing for Science and Engineering

作者： Jinjing Zhao Ling Pang Zibin Wang Wenjing Zhong Qin Xin National Key Laboratory of Science and Technology on Information System Security China China Electro-Mechanical Engineering Xidian University China and National Key Laboratory of Science and Technology on Information System Security China China Faculty of Science and Technology University of the Faroe Islands Denmark

ISBN: (纸本)9781450384957

We consider the security problems in dijkstra caused by routing on the vulnerable communication links. This work employs a SDN framework to mitigate the vulnerable links while maintaining satisfactory QoS request. SDN is able to maintain an overall network awareness, through which a controller is capable of optimizing routing based on metrics of safety interest. A lot of useful link information, like link type, link ownership, interface bandwidth, transition delay and historical record, can be collected and computed by the SDN controller to enable more safe, reliable and efficient paths. In this way, we can consider the varying delay status of the communication network along with other network security parameters and get a presence of a passive/active adversary in the network routing area. The implement and experiment indicate that QS-dijkstra algorithm is able to minimize traffic routing through vulnerable links while satisfying the QoS constraints of the network.

关键词： routing protocol QoS network security dijkstra algorithm SDN

来源：评论

学校读者我要写书评

暂无评论

Research on tool axis vector optimization when face milling complex surfaces

引用

INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY 2023年第11-12期128卷 5081-5099页

作者： Zhao, Pengrui Liu, Zhifeng Li, Zhixiong Cao, Zirui Beijing Univ Technol Inst Adv Mfg & Intelligent Technol Beijing 100124 Peoples R China Beijing Univ Technol Beijing Key Lab Adv Mfg Technol Beijing 100124 Peoples R China Beijing Univ Technol Mech Ind Key Lab Heavy Machine Tool Digital Desig Beijing 100124 Peoples R China Jilin Univ Sch Mech & Aerosp Engn Minist Educ Key Lab CNC Equipment Reliabil Changchun 130015 Peoples R China

In 5-axis machining, the existing tool's axis vector optimization methods are limited since they only consider the global collision between the tool and the workpiece while aiming at the ball-nosed cutter. A multi-factor vector optimization method for the face milling cutter shaft is proposed to solve this problem. This method comprehensively considers machining global collision, cutting force, the angular displacement of a rotating shaft, and angular speed. An improved global collision detection method of cutter axis vector based on the NURBS surface principle is developed, and a global collision detection algorithm is employed to determine the cutter machining global collision. The relationship model between the end-milling cutter axis vector and cutting force variation is established to optimize the cutting force. In addition, an optimization model of angular displacement and velocity of the machine tool's rotating axis is proposed based on dijkstra optimal path algorithm. The CAM software simulation and experimental validation are conducted using a large propeller with a complex surface. The tool's axis vector optimization algorithm is applied to the propeller results. Comparing the tool's axis vector optimization results to those obtained without optimization, it is discovered that the surface workpiece's machining quality has significantly increased.

关键词： Tool axis vector optimization Cutting force modeling Spatial global collision detection algorithm dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Timebase Dynamic Weight for dijkstra algorithm Implementation in Route Planning Software

Timebase Dynamic Weight for Dijkstra Algorithm Implementatio...

引用

1st International Conference on Intelligent Green Building and Smart Grid (IGBSG)

作者： Rosyidi, Lukman Pradityo, Hening Pram Gunawan, Dedi Sari, Riri Fitri Univ Indonesia Dept Elect Engn Depok Indonesia

ISBN: (纸本)9781467361217

This paper reviews dijkstra algorithm implementation in finding the shortest path for route planning. The regular shortest path algorithms do not consider the timebase dynamic traffic condition of road network, i.e the hourly changing of traffic density. Timebase dynamic weight for dijkstra algorithm compute the most efficient time and minimum fuel consumption based on the real condition of the traffic profiles of the road network. The traffic profiles describe the time needed to pass the road based on time which also differs for workdays and weekend. Simulation shows the implementation of Timebase Dynamic Weight for dijkstra algorithm can give better cost efficiency compared with the common Shortest Distance calculation and Traffic Avoidance calculation.

关键词： route planning shortest path timebase base dynamic traffic dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Path Optimization Study for Vehicles Evacuation Based on dijkstra algorithm

Path Optimization Study for Vehicles Evacuation Based on Dij...

引用

International Conference on Performance-Based Fire and Fire Protection Engineering (ICPFFPE)

作者： Chen, Yi-zhou Shen, Shi-fei Chen, Tao Yang, Rui Tsinghua Univ Dept Engn Phys Beijing 100084 Peoples R China

Emergency events, such as earthquakes, hurricanes, fires, chemical accidents, nuclear accidents, terror attacks and other events may led to injured or endanger the life and the health of human beings, and the large scale crowds have to evacuate from a danger area to a safe area by vehicles. In this paper, through observing real-time road network and analyzing three different emergency evacuation cases and the nodes, intersections delay and velocity of vehicles evacuation in the morning peak, common and evening peak. A dynamic road network model is built for vehicles evacuation based on dijkstra algorithm. The optimal evacuation path is proposed in three different cases. The obtained outcomes provide well predictive method and theoretical basis for optimal emergency evacuation path selection and emergency rescue decision in public places, especially for those with high population density. So it seems very meaningful for us to cope with emergency situation or to prevent and mitigate disasters from the crisis events. (C) 2014 Published by Elsevier Ltd.

关键词： dijkstra algorithm emergency event evacuation path optimization

来源：评论

学校读者我要写书评

暂无评论

Optical Ray Tracing Based on dijkstra algorithm in Inhomogeneous Medium 9

Optical Ray Tracing Based on Dijkstra Algorithm in Inhomogen...

引用

International Conference on Broadband and Wireless Computing, Communication and Applications (BWCCA)

作者： Uchida, Kazunori Fukuoka Inst Technol Dept Commun & Informat Engn Fukuoka 8110295 Japan

ISBN: (纸本)9781479978731

This paper is concerned with proposing a numerical method to predict the wavefront movement of optical rays based on the dijkstra algorithm. Data for refractive index of the medium through which optical rays propagate are assigned to all nodes of rectangular meshes and its values apart from the mesh nodes can be approximated in terms of linear interpolation. The velocity of the wavefront of an optical ray can be calculated by the refractive index assigned to each node and it varies from one node to another due to the medium inhomogeneity. Since the wavefront movement of any waves is governed by the Fermat principle, it can be easily estimated based on the dijkstra algorithm. In this paper we discuss the dijkstra algorithm relevant to optical rays propagating through the inhomogeneous media such as Luneburg lens and Maxwell's fish-eye lens. We also show some numerical examples to demonstrate the effectiveness of the proposed method for analyzing ray front movement and ray tracing.

关键词： dijkstra algorithm Fermat Principle Optical Ray Luneburg Lens Maxwell's Fish-Eye Lens

来源：评论

学校读者我要写书评

暂无评论

Tsunami Simulation Based on dijkstra algorithm 17

Tsunami Simulation Based on Dijkstra Algorithm

引用

International Conference on Network-Based Information Systems (NBiS)

作者： Uchida, Kazunori Nogami, Shinsuke Takematsu, Masafumi Honda, Junichi Fukuoka Inst Technol Dept Commun & Informat Engn Fukuoka 8110295 Japan Elect Nav Res Inst Tokyo Japan

ISBN: (纸本)9781479942244

This paper is concerned with the proposal of a numerical method to predict the movement of tsunami wavefront by use of dijkstra algorithm. Data for sea depth and land height are assigned to the nodes of rectangular meshes and the data values at the points except for these node points are approximated by linear interpolation. The velocity of tsunami wavefront at any point is calculated in terms of the corresponding sea depth and thus its time distance from one node to another can be computed by using the geographic data at the nodes. Since the movement of any waves is governed by the Fermat principle, the movement of tsunami wavefront can be estimated based on the dijkstra algorithm. Some numerical examples are shown to demonstrate the effectiveness of the proposed simulation method for the movement of tsunami wavefront in complicated sea and land areas like a ria coast.

关键词： Tsunami Wavefront Prediction Ria Coast dijkstra algorithm Fermat Principle

来源：评论

学校读者我要写书评

暂无评论

Indoor optimal path planning based on dijkstra algorithm

Indoor optimal path planning based on Dijkstra Algorithm

引用

2015 International Conference on Materials Engineering and Information Technology Applications(MEITA 2015)

作者： Yicheng Xu Zhigang Wen Xiaoying Zhang School of Electronic Engineering Beijing University of Posts and Telecommunications Institute of Sensing Technology and Business BUPT

ISBN: (纸本)9781510812055

Providing optimal path information and the personal navigation path is the open issue for the pedestrian guided system. In order to solve the problems existing in the pedestrian guided system nowadays, such as the jagged paths which probable exist in the shortest path, and the lack of the considerations of different users' preferences, this paper firstly proposed a shortest path planning scheme for pedestrian, which is based on dijkstra algorithm. Then some measures have been done which can be used to smooth the jagged paths on the basis of shortest path. At last, considering the users' preferences generated by collecting and analyzing users' behavioral information, we optimize the paths in advance. Above all, this paper mainly comes up with an indoor personalized pedestrian guidance method with path smoothing function.

关键词： pedestrian guidance dijkstra algorithm path smoothing user preferences

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：