scholarly journals Selection of optimal path finding algorithm for data transmition in distributed systems

2018 ◽  
Vol 1 (905) ◽  
pp. 42-49
Author(s):  
E. Vavruk ◽  
◽  
Z. Mozil
Keyword(s):  
Distributed Systems ◽  
Optimal Path ◽  
Path Finding ◽  
Selection Of

Simulation of public art communication in colleges based on smart cloud platform and artificial intelligence algorithm

2020 ◽  
pp. 1-11
Author(s):  
Zhang Yingying
Keyword(s):  
Artificial Intelligence ◽  
Public Art ◽  
Optimal Path ◽  
Colleges And Universities ◽  
Cloud Platform ◽  
Current Transmission ◽  
Artificial Intelligence Algorithm ◽  
Offset Coefficient ◽  
Network Status ◽  
Selection Of

Public art communication in colleges and universities needs to be launched with the support of artificial intelligence systems. According to the current situation of public art communication in colleges and universities, this paper builds a smart cloud platform for public art communication in colleges and universities with the support of artificial intelligence algorithms. Moreover, this paper introduces the bandwidth offset coefficient to judge the change of network throughput, introduces the slice download rate difference to first judge the consistency change trend of bandwidth, and then further proposes the calculation method of bandwidth prediction value by situation. In addition, this paper proposes a flexible transmission mechanism based on smart collaborative networks. Through in-depth perception of network status and component behavior, this mechanism implements the selection of the optimal path in the network according to the current network status and user service requirements to complete the transmission of service resources. If the current transmission path fails, the mechanism should ensure the continuity and reliability of the service. The research results show that the system constructed in this paper has good performance and can be applied to practice.

Optimal Path Finding using Iterative SARSA

2021 ◽  
Author(s):  
Prajval Mohan ◽  
Lakshya Sharma ◽  
Pranav Narayan
Keyword(s):  
Optimal Path ◽  
Path Finding

scholarly journals Design for Additive Manufacturing: Optimization of Piping Network in Compact System With Enhanced Path-Finding Approach

2018 ◽  
Vol 140 (8) ◽  
Author(s):  
Pei Cao ◽  
Zhaoyan Fan ◽  
Robert X. Gao ◽  
J. Tang
Keyword(s):  
Additive Manufacturing ◽  
Video Game ◽  
Optimal Path ◽  
Computational Cost ◽  
Design Tool ◽  
Computational Time ◽  
Path Finding ◽  
Network Systems ◽  
Efficient Manner ◽  
Visibility Graphs

This research aims at unleashing the potential of additive manufacturing technology in industrial design that can produce structures/devices with irregular component geometries to reduce sizes/weights. We explore, by means of path-finding, the length minimization of freeform hydraulic piping network in compact space under given constraints. Previous studies on path-finding have mainly focused on enhancing computational efficiency due to the need to produce rapid results in such as navigation and video-game applications. In this research, we develop a new Focal Any-Angle A* approach that combines the merits of grid-based method and visibility graph-based method. Specifically, we formulate pruned visibility graphs preserving only the useful portion of the vertices and then find the optimal path based on the candidate vertices using A*. The reduced visibility graphs enable us to outperform approximations and maintain the optimality of exact algorithms in a more efficient manner. The algorithm proposed is compared to the traditional A* on Grids, Theta* and A* on visibility graphs in terms of path length, number of nodes evaluated, as well as computational time. As demonstrated and validated through case studies, the proposed method is capable of finding the shortest path with tractable computational cost, which provides a viable design tool for the additive manufacturing of piping network systems.

Optimal Design of Computational Grids Topology

2019 ◽  
Vol 16 (9) ◽  
pp. 3754-3758
Author(s):  
Debashreet Das ◽  
Chitta Ranjan Tripathy ◽  
Pradyumna Kumar Tripathy ◽  
Manas Ranjan Kabat ◽  
Avinash Sharma
Keyword(s):  
Distributed Systems ◽  
Optimal Design ◽  
Heterogeneous Network ◽  
Computational Grids ◽  
Network Simulator ◽  
The Past ◽  
Selection Of

The selection of a proper heterogeneous network contributes to the design of various distributed systems such as grids for making an effective layout. However, the level of accuracy of such networks has not been addressed in the past. Hence, this article suggests a new topology which is more accurate and addresses the scalability problem. The experiments are conducted in Matlab and the suggested layout is generated using Network Simulator 2.3. The suggested layout is found to be more effective compared to the traditional layouts for interlinking the systems.

scholarly journals Development of the tree-based link labeling algorithm for optimal path-finding in urban transportation networks

1998 ◽  
Vol 27 (9-11) ◽  
pp. 51-65 ◽  
Author(s):  
S. Namkoong ◽  
J.-H. Rho ◽  
J.-U. Choi
Keyword(s):  
Transportation Networks ◽  
Urban Transportation ◽  
Optimal Path ◽  
Path Finding ◽  
Labeling Algorithm

scholarly journals The Global Optimal Algorithm of Reliable Path Finding Problem Based on Backtracking Method

2017 ◽  
Vol 2017 ◽  
pp. 1-10
Author(s):  
Liang Shen ◽  
Hu Shao ◽  
Long Zhang ◽  
Jian Zhao
Keyword(s):  
Travel Time ◽  
Risk Taking ◽  
Optimal Algorithm ◽  
Optimal Path ◽  
Global Optimum ◽  
Path Finding ◽  
Shortest Path Algorithm ◽  
Global Optimal ◽  
Risk Taking Behaviors ◽  
Reliable Path

There is a growing interest in finding a global optimal path in transportation networks particularly when the network suffers from unexpected disturbance. This paper studies the problem of finding a global optimal path to guarantee a given probability of arriving on time in a network with uncertainty, in which the travel time is stochastic instead of deterministic. Traditional path finding methods based on least expected travel time cannot capture the network user’s risk-taking behaviors in path finding. To overcome such limitation, the reliable path finding algorithms have been proposed but the convergence of global optimum is seldom addressed in the literature. This paper integrates the K-shortest path algorithm into Backtracking method to propose a new path finding algorithm under uncertainty. The global optimum of the proposed method can be guaranteed. Numerical examples are conducted to demonstrate the correctness and efficiency of the proposed algorithm.

An optimal path finding strategy in networks based on random walk

2016 ◽  
Vol 19 (4) ◽  
pp. 2179-2188 ◽  
Author(s):  
Bin Hu ◽  
Huan-yan Qian ◽  
Yi Shen ◽  
Jia-xing Yan
Keyword(s):  
Random Walk ◽  
Optimal Path ◽  
Path Finding
Sign in / Sign up

Export Citation Format

Share Document