Harmonic functions are known to have an advantage as a global potential function in the potential field based approach for robot path planning. However, an immense amount of computations are required as the size of the environment get bigger. This paper conducts an experiment to speed up the computation by solving the harmonic functions with faster solver, i.e. two-point Explicit Group (EG) ite...

Path problems are a family of optimization and enumeration problems that reduce to determination or evaluation of paths in a directed graph. In this paper we give a convenient algebraic description of block algorithms for solving path problems. We also develop block versions of two Gaussian algorithms, which are counterparts of the conventional Jordan and escalator method respectively. The corr...

Path planning is a critical part of modern computer games; rare is the game where nothing moves and path planning is not necessary. A* is the workhorse for most path planning applications. Block A* is a state-of-the-art algorithm that is always faster than A* in experiments using game maps. Unlike other methods that improve upon A*’s performance, Block A* does not require knowledge of the map b...

In [3], [4], [5] Sellers developes a dynamic programming pattern matching algorithm that generates forward, reverse, and transverse path graphs that determine the best resemblance (lowest cost) of a smaller string pattern inside a larger. In this paper we study the properties and structure of these graphs. We show that these path graphs can be decomposed into a small number of distinct block ty...

Four rapeseed cultivars (Hayola 401, Hayola 308, RGS and Option) were evaluated for some physiological traits under stress (50 % field capacity (FC) and non-stress (irrigated) conditions. The factorial set of treatments was arranged within a randomized complete block design with three replications. The collected data were analyzed using path and factor analyses. These is results showed that...

A functional law is given for an I(1) sample data version of the continuous-path block bootstrap of Paparoditis and Politis (2001a). The results provide an alternative demonstration that continuous-path block bootstrap unit root tests are consistent under the null. © 2010 Elsevier B.V. All rights reserved.