Avenue Intersections (AI)

This chapter discusses two successful AI search applications. The first one is pathfinding – having AI map a route from one location to another (as seen in a GPS). The algorithms used to solve Rubik’s Cube are the same as are needed to do route mapping. The core idea uses the non-descriptive F = G + H algorithm introduced in an earlier chapter. Iterating (consider routes of length 1, then length 2, then length 3, etc.) until a solution is found is a useful search technique. This can be enhanced with knowledge to make the search more efficient. Examples show that this technology can be used for other real-world problems. A second application is robotics, with an emphasis on robotic vacuum cleaners and snow shovellers. The robotic vacuum Roomba uses search to ensure that it can clean an entire room. It has a “random walk” mode. Rather than systematically cleaning a floor by iteratively expanding the region that has already been cleaned, having the machine randomly move about eventually achieves the same effect – but with some advantages. Many people do not think of GPS or Roomba as being AI products. Another instance of invisible AI.