In random walks, the path representation of the Green's function is an infinite sum over the length of path probability density functions (PDFs). Recently, a closed-form expression for the Green's function of an arbitrarily inhomogeneous semi-Markovian random walk in a one-dimensional (1D) chain of L states was obtained by utilizing path-PDFs calculations. Here we derive and solve, in Laplace s...

In this paper, we introduce a distributed algorithm for single source shortest path problem for undirected graphs. In this problem, we find the shortest path from a given source node to other nodes in the graph. We start with undirected unweighted graphs in which the shortest path is a path with minimum number of edges. Following, we modify the algorithm to find shortest path for weighted graph...

To solve the problem that the traditional rapidly-exploring random tree(RRT) algorithm can not be directly applied to the path planning of Unmanned Aerial Vehicle(UAV), add the UAV turning angle constraint to the planning algorithm in the process of random point were produced, it make the path meet the capable of flying; For the problem that we could not determine the random point about the rap...

A key issue in software testing is the actual generation of test data from program input domain. Obviously, more accurate input domain is, more efficient test generation is. This paper presents a path-oriented automatic random testing method based on double constraint propagation. For a given path, its domain can be reduced by splitting an input variable domain and executing a double constraint...

A method of path averaging for waves propagating in a random dilute system of identical scatterers is developed. The scattering matrix of such a system is calculated. The method systematically takes into account repeating scatterings on the same scatterer and effects of correlations. Results obtained show the significant influence of new effects on the extinction of a coherent field and are val...