A dynamic hierarchical quotient topology model based optimal path finding algorithm in complex networks

2016 ◽  
Author(s):  
Ping Qi ◽  
Long-Shu Li ◽  
Fu-Cheng Wang
Keyword(s):  
Complex Networks ◽  
Optimal Path ◽  
Path Finding ◽  
Quotient Topology ◽  
Model Based ◽  
Topology Model

A New Algorithm for Optimal Path Finding in Complex Networks Based on the Quotient Space

2009 ◽  
Vol 93 (4) ◽  
pp. 459-469 ◽  
Author(s):  
Ling Zhang ◽  
Fu-gui He ◽  
Yan-ping Zhang ◽  
Shu Zhao
Keyword(s):  
Complex Networks ◽  
Quotient Space ◽  
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.

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.

scholarly journals Synchronization in a Novel Local-World Dynamical Network Model

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Jianeng Tang ◽  
Peizhong Liu
Keyword(s):  
Complex Networks ◽  
Complex Network ◽  
Network Model ◽  
Optimal Growth ◽  
Dynamical Networks ◽  
Dynamical Network ◽  
Network Research ◽  
Topology Model ◽  
The Relationship ◽  
Random Failures

Advances in complex network research have recently stimulated increasing interests in understanding the relationship between the topology and dynamics of complex networks. In the paper, we study the synchronizability of a class of local-world dynamical networks. Then, we have proposed a local-world synchronization-optimal growth topology model. Compared with the local-world evolving network model, it exhibits a stronger synchronizability. We also investigate the robustness of the synchronizability with respect to random failures and the fragility of the synchronizability with specific removal of nodes.

Sign in / Sign up

Export Citation Format

Share Document