The problem of identifying the shortest path along a road network is a fundamental problem in network analysis, ranging from route guidance in a navigation system to solving spatial allocation problems. Since this type of problem is solved so frequently, it is important to craft an approach that is as efficient as possible. Based upon past research, it is generally accepted that several efficie...

We address the problem of statically proving, at compilation time, whether the execution of a given transaction m is safe w.r.t. a dynamical integrity constraint in the framework of object oriented database systems. To do so, we formalize dynamical constraints with first order Linear Temporal Logic formulae and we use predicate transformer “à la Dijkstra”, combined with automatic demonstration....

This thesis introduces a new algorithm for quickly answering repetitive least-cost queries between pairs of points on the Earth's surface as represented by digital topographical maps. The algorithm uses a three-step process; preprocessing, geometrically modified Dijkstra search, and postprocessing. The preprocessing step computes and saves highly valuable global information that describes the u...

This paper presents a new method for finding shortest node-disjoint paths in optical-switched networks with no wavelength conversion. The proposed method is based on a modified version of Dijkstra algorithm that works on an expanded so-called dual-network topology with n×nnodes and 2×m×n links, where n is the number of nodes and m is the number of links in the original network. Despite the larg...

Corresponding Author: Kil To Chong Department of Electronics Engineering, Chonbuk National University, Jeonju, South Korea Email: [email protected] Abstract: This paper addressed obstacle avoidance problem of a quadrotor in outdoor environment. Path planning was finished by employing classical Dijkstra algorithm and the controller of the quadrotor adopted integral backstepping method. In orde...

Abstract. The automatic motion or trajectory planning is essential for several tasks that lead to the autonomy increase of Unmanned Aerial Vehicles (UAVs). This work proposes a Dijkstra algorithm for fixed-wing UAVs trajectory planning. The navigation environments are represented by sets of visibility graphs constructed through the terrain elevations of these environments. Digital elevation mod...

Efficient solution of the single source shortest path (SSSP) problem on road networks is an important requirement for numerous real-world applications. This paper introduces an algorithm for the SSSP problem using compression method. Owning to precomputing and storing all-pairs shortest path (APSP), the process of solving SSSP problem is a simple lookup of a little data from precomputed APSP an...

In the domain of modular robotic systems, self-configura‐ tion, self-diagnosis and self-repair are known to be highly challenging tasks. This paper presents a novel fault selfdiagnosis strategy which consists of two parts: fault detection and fault message transmission. In fault detec‐ tion, a bionic synchronization ‘healthy heartbeat’ method is used to guarantee the high efficiency of the exog...

In order to reduce the impact of highway passenger transportation hubs on urban internal traffic operations and improve efficiency external travel, a method determine location such based POI data Dijkstra algorithm is proposed. Firstly, process connecting starting point travel in city road node exit analyzed. Taking minimum total time cost as objective function, mathematical model hub establish...