In order to investigate the use of unmanned aerial vehicles (UAVs) for future application in road damage detection and provide a theoretical technical basis UAV detection, this paper determined recommended flight camera parameters based on needs continuous image capture pavement disease recognition. Furthermore, realize automatic route planning control, photography stitching smoothing tasks, co...

In this paper, we address a shortest path problem where an autonomous vehicle moves on a polyhedral surface according to a distance function that depends on the direction of the movement (directional) and on the friction of the space (frictional). This shortest path problem generalizes a hierarchy of problems and finds geometric structure to solve several proximity problems. We perform the char...

It is well known that computing shortest paths over a network is an important task in many network and transportation related analyses. Choosing an adequate algorithm from the numerous algorithms reported in the literature is a critical step in many applications involving real road networks. In a recent study, a set of three shortest path algorithms that run fastest on real road networks has be...

We present a new characterization of Erd?s space factors, and show that the $$\mathfrak{C}$$ is unstable in class almost zero-dimensional F??-spaces. The latter answers question by Dijkstra van Mill.

The Single-Source Shortest Path (SSSP) problem arises in many different fields. In this paper we present a GPUbased version of the Crauser et al. SSSP algorithm. Our work significantly speeds up the computation of the SSSP, not only with respect to the CPU-based version, but also to other state-ofthe-art GPU implementation based on Dijkstra, due to Martı́n et al. Both GPU implementations have be...

Based on many large data set, we calibrate a nearoptimal heuristic as a constant function for guiding efficiently A or A∗ algorithm. We claim that this magic number exists as a universal constant for several kinds of date sets. This is perhaps related to the nature of their data sets though it is not theoretically analyzed yet. In general, A∗ and Dijkstra algorithms always pick up the optimal (...