How difficult is it to not hit something?<p>Let&#x27;s suppose you are given a 2d field in which there are a number of rectangles, each of which have a velocity vector. So you know the location of each rectangle now, and, to a good approximation, in the near future.<p>How difficult is it to program a path-finding algorithm that will not crash into any of these rectangles, given that lowering speed is always a good option within a city?<p>I&#x27;d say this is really not all that difficult. Yes, there are a lot of special cases to consider, but still, in essence, this seems to me a quite simple problem.<p>So breaking down the problem is key. If you look at an autonomous vehicle as a black box, then, of course, it will seem dauntingly complicated, and difficult to trust.