Constrained pathfinding is a well-studied, yet challenging network optimisation problem that can be seen in a broad range of real-world applications. Pathfinding with multiple resource limits, which is known as the Resource Constrained Shortest Path Problem (RCSP), aims to plan a cost-optimum path subject to limited usage of resources. Given the recent advances in constrained and multi-criteria search with A*, this paper introduces a new resource constrained search framework on the basis of A* to tackle RCSP in large networks, even in the presence of negative cost and negative resources. We empirically evaluate our new algorithm on a set of large instances and show up to two orders of magnitude faster performance compared to state-of-the-art RCSP algorithms in the literature.
View on arXiv@article{ahmadi2025_2503.11037,
title={ Resource Constrained Pathfinding with A* and Negative Weights },
author={ Saman Ahmadi and Andrea Raith and Mahdi Jalili },
journal={arXiv preprint arXiv:2503.11037},
year={ 2025 }
}