There are some pros about an expensive dining plan: there was all-you-can-eat sweet potato souffle at Dudley dining hall this week… and there was apple cobbler two weeks ago (almost as good as peach cobbler)

Students also have free access to the Harvard Cinema. I’m going to watch Three Sisters this weekend. My grandma lived there, and I spent two summers in Yunan’s capital, Kunming (which is no doubt very different than rural Yunan!) hcl.harvard.edu/hfa/films/2017sepnov/wang.html#three

work pictures

My own implementation of the RRT algorithm (rapidly expanding random trees) in Julia: collision checking issues, two runs, and a graph of how the solution path cost decreases with more iterations (aka if you find a path, you find a better path on average if you run more iterations). Although, it seems to converge not on what you might expect is about the optimal path cost (20* sqrt(2) = 28). And why would the optimal path cost decrease with more iterations, if the algorithm stops right when we find a solution? Hmm. I need to make more plots.