Route Planning in Transportation Networks · HackerPapers discussions

Route Planning in Transportation Networks — HN submission

Sun, 20 Oct 2024 11:34:47 GMT

Route Planning in Transportation Networks (2015)

27 points; 3 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Route Planning in Transportation Networks — mentioned by joe_the_user

Fri, 22 Mar 2024 17:25:45 GMT

The problem of finding the shortest path on a map (a la google maps etc) is often solved with approaches like "hub networks" and "contraction hierarchies" rather than simple spatial networks. Things like dijkstra's algorithm are only efficient if you're input is the raw graph and point and you only want one path once. See just for a start: https://arxiv.org/abs/1504.05140

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — mentioned by payasr

Wed, 03 Jan 2024 08:30:47 GMT

Those seem a little outdated, there has been a ton of work since then :) A bit more updated reference is https://arxiv.org/pdf/1504.05140.pdf, and http://www.sommer.jp/spq-survey.pdf is great! There are also Prof. Hannah Bast's lectures (https://ad-wiki.informatik.uni-freiburg.de/teaching/Efficien...) and her talk at ICAPS (https://www.youtube.com/watch?v=B3wKfJAVRkg), both excellent :)

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — mentioned by amitp

Tue, 02 Jan 2024 19:58:36 GMT

There are lots of variants of A* that depend on what you can assume about your graph, whether you can preprocess, how often the graph changes, etc. Contraction hierarchies, subgoals, bidirectional A*, hierarchical search, all-pairs compression, moving obstacles, group movement, coordinated movement, landmarks, labeling algorithms, transit nodes, arc flags, cluster distances, vertex separators, reach, highway hiearchies, etc. Differential heuristics are my favorite for "bang for the buck", as they are fairly low effort (maybe <20 lines of code) for good speedup (3-5X on my game map tests [1]).…

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — mentioned by payasr

Sat, 19 Oct 2019 05:43:27 GMT

There's a _lot_ of work on hierarchical route planning in games. I don't mean to put down the developers or anything, and I'm so glad all of this works, but there are plenty of ideas in the academic-world that I think developers should know more about. Botea, Adi, Martin Müller, and Jonathan Schaeffer. 2004. “Near Optimal Hierarchical Path-Finding.” In Journal of Game Development. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112..... Rahmani, Vahid, and Nuria Pelechano. 2017. “Improvements to Hierarchical Pathfinding for Navigation Meshes.” In Proceedings of the Tenth International…

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — mentioned by lorenzhs

Sun, 18 Mar 2018 19:42:05 GMT

There’s a great recent-ish survey paper at https://arxiv.org/pdf/1504.05140.pdf which will give you pointers to papers in all directions :)

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — mentioned by karussell

Mon, 20 Feb 2017 20:43:54 GMT

Contraction Hierarchy (CH) is also at least 100x faster as A* . CH has nice properties of having good memory efficiency, optimality, any graph etc. And I am very sure JPS is not that generic applicable like CH. Still all 'fast' routing algorithms have their own drawbacks of engineering complexity, pre-processing time and memory requirements, potential lack for time dependent support etc. If you want to have the best summary of routing algorithms currently available then read 'Route Planning in Transportation Networks' (2014) https://arxiv.org/abs/1504.05140 And if you want fast…

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — mentioned by danpat

Wed, 05 Oct 2016 04:44:22 GMT

I'm one of the OSRM devs. To expand on this comment a bit - OSRM still uses Dijkstra, so if you understand that, you already basically understand what OSRM does. What OSRM does in order to speed things up is optimize the graph structure - we still use Dijkstra, but the search completes in a handful of steps, rather than hundreds of thousands. There are quite a few techniques like this. OSRM implements an approach called Contraction Hierarchies. We scan over the graph, inserting "shortcuts" that skip over nodes. As long as you follow a few basic rules, you can repeatably insert shortcuts all…

Paper and discussion history. A mention is not an endorsement.

Route Planning in Transportation Networks — HN submission

Sun, 03 Apr 2016 03:33:07 GMT

Route Planning in Transportation Networks

3 points; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Route Planning in Transportation Networks — mentioned by csom

Tue, 21 Apr 2015 14:13:53 GMT

Route Planning in Transportation Networks http://arxiv.org/abs/1504.05140 Shortest-Path Queries in Static Networks http://www.sommer.jp/spq-survey.pdf

Paper and discussion history. A mention is not an endorsement.