Path planning in urban traffic simulation is typically based on graph theory algorithms, where the road grid is modeled as a directed graph and A* or Dijkstra algorithms are used to calculate the shortest path