Single-Source Multi-Target A* Algorithm for POI Queries on Road Network

2012 ◽  
pp. 51-62 ◽  
Author(s):  
Htoo Htoo ◽  
Yutaka Ohsawa ◽  
Noboru Sonehara
Keyword(s):  
Road Network ◽  
Single Source ◽  
A Algorithm

scholarly journals Incremental Single-Source Multi-Target A* Algorithm for LBS Based on Road Network Distance

2013 ◽  
Vol E96.D (5) ◽  
pp. 1043-1052 ◽  
Author(s):  
Htoo HTOO ◽  
Yutaka OHSAWA ◽  
Noboru SONEHARA ◽  
Masao SAKAUCHI
Keyword(s):  
Road Network ◽  
Single Source ◽  
A Algorithm ◽  
Network Distance

scholarly journals A hybrid technique for single-source shortest path-based on A* algorithm and ant colony optimization

2020 ◽  
Vol 9 (2) ◽  
pp. 356
Author(s):  
Sameer Alani ◽  
Atheer Baseel ◽  
Mustafa Maad Hamdi ◽  
Sami Abduljabbar Rashid
Keyword(s):  
Ant Colony Optimization ◽  
Shortest Path ◽  
Shortest Paths ◽  
Ant Colony ◽  
Fast Time ◽  
Hybrid Technique ◽  
Single Source ◽  
A Algorithm ◽  
A New Technique

<span lang="EN-US">In the single-source shortest path (SSSP) problem, the shortest paths from a source vertex v to all other vertices in a graph should be executed in the best way. A common algorithm to solve the (SSSP) is the A* and Ant colony optimization (ACO). However, the traditional A* is fast but not accurate because it doesn’t calculate all node's distance of the graph. Moreover, it is slow in path computation. In this paper, we propose a new technique that consists of a hybridizing of A* algorithm and ant colony optimization (ACO). This solution depends on applying the optimization on the best path. For justification, the proposed algorithm has been applied to the parking system as a case study to validate the proposed algorithm performance. First, A*algorithm generates the shortest path in fast time processing. ACO will optimize this path and output the best path. The result showed that the proposed solution provides an average decreasing time performance is 13.5%.</span>

An Efficient Constrained Shortest Path Algorithm for Traffic Navigation

2011 ◽  
Vol 356-360 ◽  
pp. 2880-2885
Author(s):  
Zong Hui Wang ◽  
Shu Su Shi ◽  
Li Cheng Yu ◽  
Wen Zhi Chen
Keyword(s):  
Shortest Path ◽  
Navigation System ◽  
Road Network ◽  
Prototype System ◽  
Dijkstra Algorithm ◽  
Shortest Path Algorithm ◽  
A Algorithm ◽  
The Road ◽  
Low Efficiency ◽  
Key Techniques

FCD-based traffic navigation system is getting more and more attention from countries all over the world. Shortest path algorithm is one of the key techniques of a traffic navigation system. Since classical Dijkstra algorithm and heuristic A* algorithm cannot support some constrained conditions in practice, and existing algorithms supporting constraints require the road network to be modified ahead and have low efficiency. The paper studies the model of road network, and analyzes two types of constraints, one-way street and intersection turning prohibitions, then proposes the constrained A* algorithm and gives the Heuristic function. Finally, the paper tests and analyzes the algorithm, and evaluation performance of the prototype system which employs it. The result shows that the algorithm’s efficiency is fairly good.

scholarly journals RESEARCH ON THE LAYERING A* ALGORITHM FOR REAL-TIME NAVIGATION

2015 ◽  
Vol XL-4/W5 ◽  
pp. 243-246
Author(s):  
X. Tan
Keyword(s):  
Real Time ◽  
Road Network ◽  
Search Strategy ◽  
Storage Space ◽  
Large Area ◽  
A Algorithm ◽  
Existing Problems ◽  
Hierarchical Search ◽  
Path Computation ◽  
Turn Restrictions

According to the existing problems in the applications of embedded navigation, this paper designs the hierarchical search A*algorithm, based on the transferring road network, to meet the need of real-time navigation. In the algorithm, a hierarchical search strategy is applied to route programming of large area, yet the duplicate searching A* algorithm, based on the transferring road network, is applied to the path computation, which is able to handle intersection turn restrictions and node weight, with little storage space but fast searching speed. Practically, the algorithm is proved to meet the technological need of real-time navigation both in computing speed and route rationality.

scholarly journals Network Reconfiguration with Orientation-Dependent Transit Times

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Hari Nandan Nath ◽  
Urmila Pyakurel ◽  
Tanka Nath Dhamala
Keyword(s):  
Transit Time ◽  
Polynomial Time ◽  
Time Complexity ◽  
Road Network ◽  
Computational Experiment ◽  
Network Reconfiguration ◽  
Single Source ◽  
Network Construction ◽  
Polynomial Time Algorithms ◽  
Transit Times

Motivated by applications in evacuation planning, we consider a problem of optimizing flow with arc reversals in which the transit time depends on the orientation of the arc. In the considered problems, the transit time on an arc may change when it is reversed, contrary to the problems considered in the existing literature. Extending the existing idea of auxiliary network construction to allow asymmetric transit time on arcs, we present strongly polynomial time algorithms for solving single-source-single-sink maximum dynamic contraflow problem and quickest contraflow problem. The results are substantiated by a computational experiment in a Kathmandu road network. An algorithm to solve the corresponding earliest arrival contraflow problem with a pseudo-polynomial-time complexity is also presented. The partial contraflow approach for the corresponding problems has also been discussed.

Growth of InN whiskers from single source precursor

2001 ◽  
Vol 11 (PR3) ◽  
pp. Pr3-577-Pr3-584 ◽  
Author(s):  
A. Devi ◽  
H. Parala ◽  
W. Rogge ◽  
A. Wohlfart ◽  
A. Birkner ◽  
...  
Keyword(s):  
Single Source ◽  
Single Source Precursor

Single-Source Dual-Energy Computed Tomography Detects Disk Injury in Patients with Vertebral Fractures

2019 ◽  
Author(s):  
Torsten Diekhoff ◽  
Michael Fuchs ◽  
Nils Engelhard ◽  
Kay-Geert Hermann ◽  
Michael Putzier ◽  
...  
Keyword(s):  
Computed Tomography ◽  
Vertebral Fractures ◽  
Dual Energy ◽  
Single Source ◽  
Dual Energy Computed Tomography
Sign in / Sign up

Export Citation Format

Share Document