The paper "T*: A Weighted Double-heuristic Search Algorithm to Find the Shortest Path"

The paper entitled "T*: A Weighted Double-heuristic Search Algorithm to Find the Shortest Path" was published by International Journal of Computing Science and Mathematics (Inderscience Publishers) in January 30, 2019. This paper proposes a weighted double-heuristic search algorithm to find the shortest path between two points. It can be used in numerous fields such as graph theory, game theory, and network. This algorithm, called T*, uses a weighted and heuristic function as f(x) = α × t(x) + β × h1(x) + γ × h2(x). It selects the path which minimises f(x) where x is a current node on the path, t(x) is cost of the path from start to x, h1(x) is a heuristic to estimate the cost from x to the straight line passing through start and target, and h2(x) is a heuristic to estimate cost of the cheapest path from x to target. Furthermore, α, β, and γ indicate effective weights of each sub-function on f(x).

You can find more information about this paper via the link.