A risk-aware online routing planner for truck-assisted drone delivery adds wind uncertainty margins and return-feasibility checks, improving simulated mission success rates under replayed wind logs.
Dynamic Shortest Path and Transitive Closure Algorithms: A Survey
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
Algorithms which compute properties over graphs have always been of interest in computer science, with some of the fundamental algorithms, such as Dijkstra's algorithm, dating back to the 50s. Since the 70s there as been interest in computing over graphs which are constantly changing, in a way which is more efficient than simple recomputing after each time the graph changes. In this paper we provide a survey of both the foundational, and the state of the art, algorithms which solve either shortest path or transitive closure problems in either fully or partially dynamic graphs. We balance this with the known conditional lowerbounds.
fields
eess.SY 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Energy-Aware Wind-Resilient Routing for Truck-Assisted Multi-UAV Delivery under Wind Uncertainty
A risk-aware online routing planner for truck-assisted drone delivery adds wind uncertainty margins and return-feasibility checks, improving simulated mission success rates under replayed wind logs.