This paper is devoted to path planning when the safety of the system considered has to be guaranteed in the presence of bounded uncertainty affecting its model. A new path planner addresses this problem by combining Rapidly-exploring Random Trees (RRT) and a set representation of uncertain states. An idealized algorithm is presented first, before a description of one of its possible implementat...

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

Aldous and Pitman (1994) studied asymptotic distributions as n!1, of various functionals of a uniform random mapping of the set f1; : : : ; ng, by constructing amapping-walk and showing these random walks converge weakly to a re ecting Brownian bridge. Two di erent ways to encode a mapping as a walk lead to two di erent decompositions of the Brownian bridge, each de ned by cutting the path of t...

Abstract. In this article we continue the study of the quenched distributions of transient, one-dimensional random walks in a random environment. In a previous article we showed that while the quenched distributions of the hitting times do not converge to any deterministic distribution, they do have a weak weak limit in the sense that viewed as random elements of the space of probability measur...

We investigate the practical merits of a parallel priority queue through its use in the development of a fast and work-efficient parallel shortest path algorithm, originally designed for an EREW PRAM. Our study reveals that an efficient implementation on a real supercomputer requires considerable effort to reduce the communication performance (which in theory is assumed to take constant time). ...

A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length ...

Correlation coefficient and path analysis studies was conducted with eight parents and their 28 F1 crosses for twelve component characters including seed yield and revealed significant positive association of pods per plant, harvest index and clusters per plant with seed yield in parental generation whereas in F1 generation, significant positive association of clusters per plant, pods per plant...

A new on-line cancellation path modeling signal for active noise control is proposed in this paper. The signal is based on the spectrum of the disturbance signal, and is especially useful for the cancellation path modeling in active noise control when the disturbance signal is tonal. It is shown that using the proposed signal as the perturbation signal in modeling can significantly reduce the m...

Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that execute a single control flow path within a program. The main challenge of PRT lies in its ability to build efficiently such a test suite in order to minimize the number of rejects (test data that execute another control flow path). We address this problem with an original divide-and-c...

We consider Euclidean first-passage percolation on a large family of connected random geometric graphs in the d-dimensional Euclidean space encompassing various well-known models from stochastic geometry. In particular, we establish a strong linear growth property for shortest-path lengths on random geometric graphs which are generated by point processes. We consider the event that the growth o...