Resource Constrained Pathfinding with Enhanced Bidirectional A* Search

Autor:	Ahmadi, Saman, Raith, Andrea, Tack, Guido, Jalili, Mahdi
Rok vydání:	2024
Předmět:	Computer Science - Artificial Intelligence
Druh dokumentu:	Working Paper
Popis:	The classic Resource Constrained Shortest Path (RCSP) problem aims to find a cost optimal path between a pair of nodes in a network such that the resources used in the path are within a given limit. Having been studied for over a decade, RCSP has seen recent solutions that utilize heuristic-guided search to solve the constrained problem faster. Building upon the bidirectional A* search paradigm, this research introduces a novel constrained search framework that uses efficient pruning strategies to allow for accelerated and effective RCSP search in large-scale networks. Results show that, compared to the state of the art, our enhanced framework can significantly reduce the constrained search time, achieving speed-ups of over to two orders of magnitude. Comment: 9 pages, 3 figures, 2 tables, The 39th Annual AAAI Conference on Artificial Intelligence
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2412.13888 Zobrazit plný text záznamu View this record from Arxiv