Adjacent vertex distinguishing incidence coloring of graph G is an incidence coloring that satisfies that adjacent vertices have different color sets, and the minimum color number is called the adjacent vertex distinguishing incidence coloring number of graph G, which is denoted as χ ai (G). In this paper, we study the adjacent vertex distinguishing incidence coloring of semi-strong products and strong products of paths of different orders, and obtain the exact values of the corresponding coloring numbers.