Open AccessPosted Content
Yet another bidirectional algorithm for shortest paths
Wim Pijls,Henk Post +1 more
- 16 Jun 2009
- pp 1-9
TL;DR: A generalized version of bidirectional A* is proposed, where the heuristic estimate does not need to be balanced, and this new version turns out to be faster than the one with the balanced heuristic.
read more
Abstract: For flnding a shortest path in a network the bidirectional A* algorithm is a widely known algorithm. An A* instance requires a heuristic estimate, a real-valued function on the set of nodes. The version of bidirectional A* that is considered the most appropriate in literature hitherto, uses so-called balanced heuristic estimates. This means that the two estimates of the two directions are in balance, i.e., their sum is a constant value. In this paper, we do not restrict ourselves any longer to balanced heuristics. A generalized version of bidirectional A* is proposed, where the heuristic estimate does not need to be balanced. This new version turns out to be faster than the one with the balanced heuristic.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Building, composing and experimenting complex spatial models with the GAMA platform
Patrick Taillandier,Benoit Gaudou,Benoit Gaudou,Arnaud Grignard,Quang-Nghi Huynh,Nicolas Marilleau,Philippe Caillou,Damien Philippon,Alexis Drogoul +8 more
TL;DR: This paper presents GAMA 1.8, the latest revision to date of the platform, with a focus on its modeling language and its capabilities to manage the spatial dimension of models.
Optimized A-Star algorithm in hexagon-based environment using parallel bidirectional search
Pratyaksa Ocsa Nugraha Saian,Suyoto,Pranowo +2 more
- 01 Oct 2016
TL;DR: The result of this paper is PBS A-Star can be accelerating classics A- star algorithm by 68.8% faster in hexagon-based environment.
A Multi-modal Urban Traffic Agent-Based Framework to Study Individual Response to Catastrophic Events
Kevin Chapuis,Patrick Taillandier,Benoit Gaudou,Alexis Drogoul,Eric Daudé +4 more
- 29 Oct 2018
TL;DR: An agent-based framework implemented with the GAMA modeling platform that aims at overcoming the lack of a simple way to model multi-modal trajectories of urban traffic and an application for the study of flood crisis in a district of Hanoi (Vietnam).
Note on “A new bidirectional algorithm for shortest paths”
Wim Pijls,Henk Post +1 more
TL;DR: The new version of the bidirectional algorithm for finding the shortest path in a network is presented and a considerably simpler proof is enabled.
9
•Posted Content
Heuristic estimates in shortest path algorithms
Wim Pijls
- 16 Sep 2006
TL;DR: This paper studies shortest path algorithms that exploit heuristic estimates that are put into one framework and presents an interesting application of binary numbers in the shortest path theory.
7
References
On The Optimality Of A
TL;DR: Examples are used to show: (1) that the value of (hn) may be a function of the state of the search as well as the available heuristic information and (2) that there exist admissible search algorithms which can not be simulated by any A ∗ algorithm.
Better landmarks within reach
Andrew V. Goldberg,Haim Kaplan,Renato F. Werneck +2 more
- 06 Jun 2007
TL;DR: A practical algorithm for the point-to-point shortest path problem on road networks that combines A* search, landmark-based lower bounds, and reach-based pruning is presented, which makes preprocessing and queries faster while reducing the overall space requirements.