APULSE: A Scalable Hybrid Algorithm for the RCSPP on Large-Scale Dense Graphs
Nuno Soares, Ant\'onio Grilo

TL;DR
APULSE is a hybrid algorithm that significantly improves scalability and efficiency in solving the resource-constrained shortest path problem on large, dense graphs, with applications in autonomous vehicle planning.
Contribution
The paper introduces APULSE, a novel hybrid label-setting algorithm combining A* heuristics and Pulse pruning for large-scale RCSPP instances.
Findings
APULSE finds near-optimal solutions faster than existing methods.
APULSE is more robust on large, dense graphs.
It enables real-time decision support in complex environments.
Abstract
The resource-constrained shortest path problem (RCSPP) is a fundamental NP-hard optimization challenge with broad applications, from network routing to autonomous navigation. This problem involves finding a path that minimizes a primary cost subject to a budget on a secondary resource. While various RCSPP solvers exist, they often face critical scalability limitations when applied to the large, dense graphs characteristic of complex, real-world scenarios, making them impractical for time-critical planning. This challenge is particularly acute in domains like mission planning for unmanned ground vehicles (UGVs), which demand solutions on large-scale terrain graphs. This paper introduces APULSE, a hybrid label-setting algorithm designed to efficiently solve the RCSPP on such challenging graphs. APULSE integrates a best-first search guided by an A* heuristic with aggressive, Pulse-style…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Vehicle Routing Optimization Methods · Data Management and Algorithms
