200 citations · 228 across the 18 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.CG2022★ 3 cited
Multi-Target Search in Euclidean Space with Ray Shooting (Full Version)
Ryan Hechenberger, Daniel Harabor, Muhammad Aamir Cheema +2
The Euclidean shortest path problem (ESPP) is a well studied problem with many practical applications. Recently a new efficient online approach to this problem, RayScan, has been d…
cs.AI2022★ 3 cited
Enhanced Methods for the Weight Constrained Shortest Path Problem
Saman Ahmadi, Guido Tack, Daniel Harabor +2
The classic problem of constrained pathfinding is a well-studied, yet challenging, topic in AI with a broad range of applications in various areas such as communication and transpo…