A look at how Uber finds nearby drivers. Uber finding nearby drivers is the textbook real-time geospatial problem: a rider requests a car, and within ~1 second the system has to find the closest available drivers, compute ETA for each, surface them to the rider, and let one accept, across millions of concurrent riders, drivers,… Continue reading
How Uber Finds Nearby Drivers: H3 Hex Grid Architecture
