4/19 Zehong Progress Report
This week, I first addressed the problem with local re-planning. I was thinking if an obstacle were to appear in the optimal route between Node1 and Node2, I can simple recall the saved shortest path between Node1 and Node2 that has been pre-planned to “go around” the obstacle. But I soon realized that due to the way my algorithm is set up, every pair of adjacent nodes in the optimal route are neighbors. This leads to a problem that if…