While using drones (UAVs) for remote surveillance missions, it is mandatory to do path planning of the vehicle since these are pilot-less vehicles. Path planning, whether offline (more popular) or online, entails setting up the path as a sequence of locations in the 3D Euclidean space, whose coordinates happen to be latitude, longitude and altitude. For the specific application of remote survei...

Various efficient indexing techniques have been proposed for formulating broadcast index to minimize the tune-in cost at mobile clients to support shortest path search in a road network. However, none of them is designed for shortest path continuous queries (SPCQ). Due to frequent updates of traffic data, an SPCQ has to be invoked periodically while the path searching cost at the client. To red...

The Lee path connection algorithm is probably the most widely used method for finding wire paths on printed circuit boards. It is shown that the original claim of generality for the path cost function is incorrect, and a restriction, called the pathconsistency property, is introduced. The Lee algorithm holds for those path cost functions having this property. Codings for the cells of the grid a...

Heuristic search is used to efficiently solve the single-node shortest path problem in weighted graphs. In practice, however, one is not only interested in finding a short path, but an optimal path, according to a certain cost notion. We propose an algebraic formalism that captures many cost notions, like typical Quality of Service attributes. We thus generalize A*, the popular heuristic search...

Abstract: An important traffic engineering problem for OSPF networks is the determination of optimal link weight system for a given objective function such as the Fortz-Thorup (FT) piece-wise linear convex function. In this paper, we show that the optimal link weights are obtained from the slopes of the FT function when approached from the dual space. This also suggests that the slopes can be a...

In this paper we formulate and study an optimal path problem on networks that extends the minimum cost path problem in the weighted directed graphs. Let G = (X,E) be a finite directed graph with vertex set X, |X| = n and edge set E where to each directed edge e = (u, v) ∈ E a cost ce is associated. Assume that for two given vertices x, y there exists a directed path P (x, y) = {x = x0, e0, x1, ...

In an object oriented databases a class consists of a set of attributes and the values of the attributes are objects that belong to other classes that is the de nition of a class forms a class aggregation hierarchy of classes A branch of such a hierarchy is called a path There have been several index organizations proposed to support object oriented query languages including multiindex join ind...

In this work a minimum cost path approach is adopted to extract coronary artery centerlines from CTA data. The algorithm depends on the manual definition of the start and end point of the vessel. The cost image used in the minimal cost path approach is based on a vesselness measure and a smooth window function on intensity. In the majority of the cases the method was able to extract the centerl...