Consider a weighted graph representing a city's traffic network where edge weights change dynamically based on congestion. Describe how you would optimize the A* search algorithm to find the shortest path in real-time under these conditions. Discuss the trade-offs between recomputing paths from scratch versus using incremental search techniques like D* or LPA*, and provide pseudocode for your proposed solution.