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

An Efficient algorithm for Vehicle Guidance Combining dijkstra and A* algorithm with Fuzzy Inference Theory

JOURNAL OF INTERNET TECHNOLOGY 2015年第2期16卷 189-200页

作者： Chang, Jieh-Ren Jheng, Yow-Hao Chang, Chia-Hui Lo, Chi-Hsiang Natl Ilan Univ Dept Elect Engn Yilan City Yilan County Taiwan Natl Cent Univ Dept Comp Sci Taoyuan Taiwan

Most of the studies on vehicle navigation are based on the use of an existing path-searching algorithm. However, finding the optimum path requires a lot of computation, which is quite limited on mobile devices. To improve the efficiency of vehicle navigation systems, we need to develop a suboptimum path-searching technique to save on computation for car navigation systems. In this study, fuzzy theory is applied to the path-searching algorithm. The drivers' collected expertise is collected into the fuzzy rule base system. Combining fuzzy inference theory with dijkstra's algorithm and A* algorithm significantly reduces path computation time, and the result is more similar to drivers' actual driving habits. In the simulation in the northern area of Taiwan, the results of our experiments show our proposed method is either more efficient or has a shorter path than dijkstra algorithm, A* algorithm and other algorithms.

关键词： Fuzzy theory Fuzzy rule base dijkstra algorithm A* algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel heuristic pathfinding algorithm for 3D security modeling and vulnerability assessment

引用

Nuclear Science and Techniques 2025年第5期36卷 152-166页

作者： Jun Yang Yue-Ming Hong Yu-Ming Lv Hao-Ming Ma Wen-Lin Wang School of Electric Power Engineering South China University of Technology381 Wushan RoadGuangzhou 510640China Sino-German College of Intelligent Manufacturing Shenzhen Technology UniversityShenzhen 518118China

Vulnerability assessment is a systematic process to identify security gaps in the design and evaluation of physical protection *** path planning is a widely used method for identifying potential vulnerabilities and threats to the security and resilience of critical ***,achieving efficient path optimization in complex large-scale three-dimensional(3D)scenes remains a significant challenge for vulnerability *** paper introduces a novel A^(*)-algorithmic framework for 3D security modeling and vulnerability *** this framework,the 3D facility models were first developed in 3ds Max and then incorporated into Unity for A^(*)heuristic *** A^(*)-heuristic pathfinding algorithm was implemented with a geometric probability model to refine the detection and distance fields and achieve a rational approximation of the cost to reach the *** admissible heuristic is ensured by incorporating the minimum probability of detection(P_(D)^(min))and diagonal distance to estimate the heuristic *** 3D A^(*)heuristic search was demonstrated using a hypothetical laboratory facility,where a comparison was also carried out between the A^(*)and dijkstra algorithms for optimal path *** results indicate that the proposed A^(*)-heuristic algorithm effectively identifies the most vulnerable adversarial pathfinding with high ***,the paper discusses hidden phenomena and open issues in efficient 3D pathfinding for security applications.

关键词： Physical protection system 3D modeling and simulation Vulnerability assessment A^(*)Heuristic Pathfinding dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Searching Optimum Route With Variable Travel Time

引用

IEEE ACCESS 2025年 13卷 10884-10897页

作者： Shuki, Yamauchi Junpei, Tokunaga Hiroyuki, Ebara Naonori, Ueda Kansai Univ Grad Sch Sci & Engn Suita Osaka 5648680 Japan Kansai Univ Fac Engn Sci Suita Osaka 5648680 Japan RIKEN Ctr Adv Intelligence Project Chuo Ku Tokyo 1030027 Japan

In the near future, in a society where connected and autonomous vehicles (connected automated vehicles) enable the transmission and sharing of traffic information, the demand for navigation systems is expected to increase;based on this background, this study proposes a shortest route search method using a time-expansion network. Assuming that the travel time to the destination can be accurately predicted, the proposed Method 1 finds a route that can reach the destination in the shortest possible travel time. This results in more realistic and accurate travel times than those provided by the current method. The proposed Method 2 facilitates vehicle dispersion by allowing drivers to set arrival times at their destinations in advance. We believe that this will alleviate the total level of congestion on the road by distributing routes according to the arrival time established by the *** are convinced that if more vehicles were to use our proposed methods, energy consumption would be reduced in society as a whole.

关键词： Time-expansion-network car-navigation searching-route dijkstra algorithm network-flow Time-expansion-network car-navigation searching-route dijkstra algorithm network-flow

来源：评论

学校读者我要写书评

暂无评论

Real-Time Path Planning for Unmanned Aerial Vehicles Based on Compensated Voronoi Diagram

引用

INTERNATIONAL JOURNAL OF AERONAUTICAL AND SPACE SCIENCES 2025年第1期26卷 235-244页

作者： Kim, Moon-Jung Kang, Tae Young Ryoo, Chang-Kyung Inha Univ Dept Aerosp Engn Incheon South Korea LIG Nex1 Performance Anal Team Seongnam South Korea

This paper proposes a real-time path-planning algorithm for unmanned aerial vehicles (UAVs) operating in hostile environments, such as disaster areas and battlefields. The key idea of the algorithm is to compensate Voronoi diagram to quickly yield the paths with maximum survivability against abrupt environmental changes or pop-up threats. We suggest a compensated Voronoi diagram which considers the weighted strengths of various threats, whereas the original Voronoi diagram is constructed via Delaunay triangulation with the same strength of whole threats. Then, dijkstra algorithm is adopted to find the path connecting the vertices to maximize survivability. This algorithm is simple to implement, requires a short computation time, and can effectively consider the strengths of various threats. Numerical simulations are performed to compare the performance of the proposed method with that of the original Voronoi diagram, the improved Voronoi diagram, and the original Voronoi diagram with optimization. Results show that the proposed path-planning method provides suboptimal solutions in survivability and works in a real-time manner.

关键词： Path planning Survivability Voronoi diagram Delaunay triangulation dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Topological Structure Evolution of Polymer Network Based on Star-shaped Multi-armed Precursors

引用

CHINESE JOURNAL OF POLYMER SCIENCE 2025年 1-13页

作者： Li, Hui Xue, Zi-Jian Xue, Yao-Hong Li, Yingxiang Liu, Hong Lanzhou Univ Technol Sch Mat Sci & Engn Lanzhou 730050 Peoples R China South China Normal Univ Sch Environm Key Lab Theoret Chem Environm Minist Educ Guangzhou 510006 Peoples R China Guangdong Univ Finance & Econ Informat Sci Sch Guangzhou 510320 Peoples R China

The performance of polymer networks is directly determined by their structure. Understanding the network structure offers insights into optimizing material performance, such as elasticity, toughness, and swelling behavior. Herein, in this study we introduce the dijkstra algorithm from graph theory to characterize polymer networks based on star-shaped multi-armed precursors by employing coarse-grained molecular dynamics simulations coupled with stochastic reaction model. Our research focuses on the structure characteristics of the generated networks, including the number and size of loops, as well as network dispersity characterized by loops. Tracking the number of loops during network generation allows for the identification of the gel point. The size distribution of loops in the network is primarily related to the functionality of the precursors, and the system with fewer precursor arms exhibiting larger average loop sizes. Strain-stress curves indicate that materials with identical functionality and precursor arm lengths generally exhibit superior performance. This method of characterizing network structures helps to refine microscopic structural analysis and contributes to the enhancement and optimization of material properties.

关键词： Polymer network Topological structure dijkstra algorithm Molecular dynamics

来源：评论

学校读者我要写书评

暂无评论

Distributed dijkstra sparse placement routing algorithm for translucent optical networks

引用

PHOTONIC NETWORK COMMUNICATIONS 2009年第1期18卷 55-64页

作者： Tintor, Vladica Radunovic, Jovan Univ Belgrade Dept Opt Commun Fac Elect Engn Belgrade 11000 Serbia

In this paper we study translucent optical networks as an alternative to fully transparent and fully opaque optical networks. In the former networks, a technique called sparse placement is used to overcome the lightpath blocking caused by the signal quality degradation, using much less regenerators, which must strategically be placed, in contrast to a fully opaque network. In this paper we propose a sparse placement algorithm based on two requirements. The first one is signal regeneration necessary to re-amplify, reshape, and retime the optical signals after some predefined transparent distance in order to successfully receive the signals at the destination node. The other is load balance of the traffic in the network aimed at efficient usage of the network capacity resources. We apply a distributed dijkstra routing algorithm which dynamically changes weights of links during the process of locating regeneration capable nodes. We compare the performance of the proposed algorithm with commonly used sparse placement algorithms through simulation experiments. The benefits are such that load balancing of the network traffic is fully utilized, and with technological development it will be sufficient to equip up to 30% of nodes in the network with electronic regenerations in order to have the same performance as in an opaque network.

关键词： Translucent optical networks Routing assignment dijkstra algorithm Wavelength division multiplex Sparse regeneration problem

来源：评论

学校读者我要写书评

暂无评论

Research on Path Planning and Safety Control of Intelligent Connected Vehicles

Research on Path Planning and Safety Control of Intelligent ...

引用

作者： Zhang, Yan Yu, Bo Hao, Bin CATARC Intelligent and Connected Technology Co. LTd. Tianjin China

Multimodal transportation systems play a pivotal role in enabling the flow of goods across different regions. Traditional models used in the prediction of route selection often overlook cost factors, leading to elevated costs of multimodal transportation route selection. This research examines a multimodal transportation route selection model that takes into account the optimization of transportation costs. In order to ascertain the practicability of the model, we put it to the test using a set of example problems. The process of tackling these problems not only allowed us to verify the model’s effectiveness but also highlighted its potential in real-world applications. Our analysis revealed that the model could indeed identify the most cost-effective routes for multimodal transportation. In conclusion, this study underscores the importance of considering transportation costs when selecting routes in multimodal transportation. It further proposes ways to optimize these costs, such as the fortification of logistics systems, the application of information technology, and the strengthening of standard systems. Our findings can significantly contribute to improving the efficiency of multimodal transportation. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： dijkstra algorithm Efficiency optimization Multimodal transportation Network graph theory Transportation costs

来源：评论

学校读者我要写书评

暂无评论

Multi-Resolution dijkstra Method Based on Multi-Agent Simulation and its Application to Genetic algorithm for Classroom Optimization

引用

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2014年第2期18卷 113-120页

作者： Maekawa, Kotaro Sawase, Kazuhito Nobuhara, Hajime Univ Tsukuba Dept Intelligent Interact Technol 1-1-1 Tennodai Tsukuba Ibaraki 3050033 Japan

The combinatorial optimization problem of university classroom schedule assignments is formulated using multiagent simulation and genetic algorithms in the evaluation and optimization process. The method we propose consists of global and local multiagent planning. Conventional global planning requires setting subgoals manually, which became a bottleneck in optimization. To solve this problem, a multi-resolution dijkstra method for selected autonomously, assuming eight classrooms as a real University of Tsukuba building and 250 agents, we confirmed the effectiveness of the proposed multi-resolution dijkstra's algorithm as for both global and local route selections, compared to the uniform dijkstra's method.

关键词： genetic algorithm multi-agent dijkstra algorithm optimization problem university courses problem

来源：评论

学校读者我要写书评

暂无评论

Link Failure Emulation with dijkstra and Bellman-Ford algorithm in Software Defined Network Architecture (Case Study: Telkom University Topology) 6

Link Failure Emulation with Dijkstra and Bellman-Ford Algori...

引用

6th International Conference on Information and Communication Technology (ICoICT)

作者： Nastiti, Anggie Rakhmatsyah, Andrian Nugroho, Muhammad Arief Telkom Univ Sch Informat Engn Informat Engn Bandung Indonesia

ISBN: (纸本)9781538645727

In Telkom University, the topology used does not have backup link for campus internal network in case of link failure because the topology is still based on interVLAN where each switch only has one path to switch core. Data packets cannot be delivered from source to destination if there is a link failure on the path. Based on the problem, it is proposed a new architecture which is Software Defined Network (SDN) that can overcome the link failure by configuring the controller in order to move to alternative links that have been provided with OpenFlow. This architecture separates the control plane and data plane, so it is centralized and programmable. To look for alternative links when a link failure occurs, the shortest path algorithm is dijkstra and Bellman-Ford algorithms. The test parameters performed in this research are functionality to determine whether the two algorithms can determine the path or not, and convergence time to find out how long it takes to form the path from source to destination. Scenario of the test is done before and after the link failure occurs by using Ryu as controller and Mininet as emulator. Based on the results of the tests conducted, it was found that dijkstra and Bellman-Ford algorithm can be applied well on link failure emulation in accordance with the scenario and topology used in the test. In addition to convergence time parameters obtained that dijkstra algorithm is superior compared to Bellman-Ford algorithm. The difference gained in both scenarios has a value that is not so great the difference.

关键词： Software Defined Network dijkstra algorithm Bellman-Ford algorithm Link Failure

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Discrete Evidence Fusion Based on dijkstra Shortest Path algorithm 32

A Novel Method for Discrete Evidence Fusion Based on Dijkstr...

引用

32nd Chinese Control And Decision Conference (CCDC)

作者： Liu, Bo Yang, Yang Deng, Xinyang Sci & Technol Avion Integrat Lab Shanghai 200233 Peoples R China Northwestern Polytech Univ Sch Elect & Informat Xian 710072 Peoples R China

ISBN: (纸本)9781728158556

Discrete evidence generally exists in the fields of expert systems, pattern recognition, and decision processing. How to solve the fusion of discrete evidence is an open question. In order to solve the problem that the number of calculations increases exponentially with the increase of the number of discrete evidences, a method for calculating the shortest path based on dijkstra is proposed. First, the normalized discrete evidence is decomposed into the exact value of the evidence as far as possible, and then the Jousselme distance between the two pairs of evidence between the evidence groups is calculated. The Jousselme distance is designed to measure the conflict between the evidence. Then the dijkstra shortest path algorithm is used to find the path with the largest and smallest Jousselme distance. The path here indicates the discrete evidence group with the largest fusion distance and smallest fusion distance. Then use Dempster combination to fuse the evidence after weighted average and give the interval value of BPA. Finally, two groups discrete evidence are given for verification to illustrate the rationality and effectiveness of the method.

关键词： Discrete evidence dijkstra algorithm Jousselme distance Dempster combination

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：