HeuristicDomainAdaptation

Heuristic search aims to obtain a least-cost path to the destination. Onthewaytothedestination, heuristic search is achieved by progressively selecting the extended path. As the other part, the cost of estimating the distance from noden to the destinationh(n) could be similar to the domain-specific representationsH(x). The fundament representationsF(x)could be calculated by the sum ofG(x)andH(x). Meanwhile, since bothGandF could classify source samples correctly,the differences on source domain are little, which means S(G) = S(F).