We present three new ideas for grid-based path-planning algorithms that improve the search speed and quality of the paths found. First, we introduce a new type of database, the Local Distance Database (LDDB), that contains distances between boundary points of a local neighborhood. Second, an LDDB-based algorithm is introduced, called Block A*, that calculates the optimal path between start and ...

This paper presents an algorithm to heuristically partition the data dependence graph representing a basic block or a hyper block of code in order to assign instructions to available processing cores. The algorithm relies on the observation that the critical path in the data dependence graph defines the lower bound on the schedule length of a block and hence the instructions on the critical pat...

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 bas...

Block A* and Any-angle Path-Planning Peter Yap and Neil Burch and Robert C. Holte and Jonathan Schaeffer Computing Science Department University of Alberta Edmonton, Alberta, Canada T6G 2E8 [email protected], {nburch, rholte, jonathan}@ualberta.ca

Management of nitrogen fertilization in crops is one of the most important components of integrated weed management. A two-year field experiment was conducted to determine the direct effects of wild mustard aboveground biomass and N content of wild mustard on oilseed rape yield. A set of factorial treatments was arranged in a randomized complete block design with four replications. Treatments w...

a vertex irregular total k-labeling of a graph g with vertex set v and edge set e is an assignment of positive integer labels {1, 2, ..., k} to both vertices and edges so that the weights calculated at vertices are distinct. the total vertex irregularity strength of g, denoted by tvs(g)is the minimum value of the largest label k over all such irregular assignment. in this paper, we study the to...

The majority of the definitions used here will be found in (3),1 with the terms "point", "line", and "cycle" replaced by vertex, edge, and circuit. In particular, a block is a connected graph with no cut vertex, and a block is minimal if no spanning subgraph of the block with fewer edges is also a block. We consider the graph with one vertex and no edges (the vertex graph) and the graph with tw...