we give an algorithm, called t*, for finding the k shortest simplepaths connecting a certain pair of nodes, s and t, in a acyclic digraph.first the nodes of the graph are labeled according to the topologicalordering. then for node i an ordered list of simple s − i paths iscreated. the length of the list is at most k and it is created by usingtournament trees. we prove the correctness of t* and ...

Shortest Path Stochastic Control for Hybrid Electric Vehicles Ed Tate, J.W. Grizzle, Huei Peng Abstract: When a Hybrid Electric Vehicle (HEV) is certified for emissions and fuel economy, its power management system must be charge sustaining over the drive cycle, meaning that the battery state of charge (SOC) must be at least as high at the end of the test as it was at the beginning of the test....

Previous work on planning as active inference addresses finite horizon problems and solutions valid for online planning. We propose solving the general Stochastic Shortest-Path Markov Decision Process (SSP MDP) probabilistic inference. Furthermore, we discuss offline methods under uncertainty. In an SSP MDP, is indefinite unknown a priori. MDPs generalize infinite are widely used in artificial ...

By applying shortest path analysis in stochastic networks, we introduce a new approach to obtain the reliability function of time-dependent systems with standby redundancy. We assume that not all elements of the system are set to function from the beginning. Upon the failure of each element of the active path in the reliability graph, the system switches to the next path. Then, the correspondin...

In this paper, we present a linear dynamic stochastic optimization model for Air Traffic Flow Management (ATFM) that accounts for uncertainty in both airport and en route airspace capacity. Rather than analyzing this problem in its full generality, we focus on the case in which there is a single destination airport and a small number of arrival fixes subject to blockage or reduced capacity as a...

The shortest hyperpath problem is an extension of the classical shortest path problem and has applications in many different areas. Recently, algorithms for finding the K shortest hyperpaths in a directed hypergraph have been developed by Andersen, Nielsen and Pretolani. In this paper we improve the worst-case computational complexity of an algorithm for finding the K shortest hyperpaths in an ...

Stochastic Shortest Path Problems (SSPs) are a common representation for probabilistic planning problems. Two approaches can be used to solve SSPs: (i) consider all probabilistically reachable states and (ii) plan only for a subset of these reachable states. Closed policies, the solutions obtained in the former approach, require significant computational effort, and they do not require replanni...