Finding Risk-Averse Shortest Path with Time-dependent Stochastic Costs
In this paper, we tackle the problem of risk-averse route planning in a transportation network with time-dependent and stochastic costs. To solve this problem, we propose an adaptation of the A* algorithm that accommodates any risk measure or decision criterion that is monotonic with first-order stochastic dominance. We also present a case study of our algorithm on the Manhattan, NYC, transportation network.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Risk-Averse Stochastic Shortest Path Planning
We consider the stochastic shortest path planning problem in MDPs, i.e., the problem of designing policies that ensure reaching a goal state from a given initial state with minimum accrued cost. In order to account for r…
Learning Shortest Paths with Generative Flow Networks
In this paper, we present a novel learning framework for finding shortest paths in graphs utilizing Generative Flow Networks (GFlowNets). First, we examine theoretical properties of GFlowNets in non-acyclic environments …
On the Emergence of Shortest Paths by Reinforced Random Walks
The co-evolution between network structure and functional performance is a fundamental and challenging problem whose complexity emerges from the intrinsic interdependent nature of structure and function. Within this cont…
An Optimized Hybrid Approach for Path Finding
Path finding algorithm addresses problem of finding shortest path from source to destination avoiding obstacles. There exist various search algorithms namely A*, Dijkstra's and ant colony optimization. Unlike most path f…
Predictive Collision Management for Time and Risk Dependent Path Planning
Autonomous agents such as self-driving cars or parcel robots need to recognize and avoid possible collisions with obstacles in order to move successfully in their environment. Humans, however, have learned to predict mov…
Collision AvoidanceManagementSelf-Driving Cars