gps reading
Rise Of The Drone Mapper
Two rhinos at the Kuzikus Nature Reserve in Namibia, photographed by drone. When the U.S. military needed to identify mines in a dangerous valley in Afghanistan, aerial-imagery specialist Tudor Thomas helped build a plane-based system to map it. Back in 2013, similar systems cost the military and its contractors one to five million dollars, Thomas says--and that didn't even include the cost of the plane. "It's hard to comprehend how much was getting spent just to make a simple aerial image," he says. The experience sparked an idea for a business: mapping by drone.
Green Driver: AI in a Microcosm
Apple, Jim (On Time Systems, Inc.) | Chang, Paul (On Time Systems, Inc.) | Clauson, Aran (On Time Systems, Inc.) | Dixon, Heidi (On Time Systems, Inc.) | Fakhoury, Hiba (On Time Systems, Inc.) | Ginsberg, Matthew L. (On Time Systems, Inc.) | Keenan, Erin (On Time Systems, Inc.) | Leighton, Alex (On Time Systems, Inc.) | Scavezze, Kevin (On Time Systems, Inc.) | Smith, Bryan (On Time Systems, Inc.)
The Green Driver app is a dynamic routing application for GPS-enabled smartphones. Green Driver combines client GPS data with real-time traffic light information provided by cities to determine optimal routes in response to driver route requests. Routes are optimized with respect to travel time, with the intention of saving the driver both time and fuel, and rerouting can occur if warranted. During a routing session, client phones communicate with a centralized server that both collects GPS data and processes route requests. All relevant data are anonymized and saved to databases for analysis; statistics are calculated from the aggregate data and fed back to the routing engine to improve future routing. Analyses can also be performed to discern driver trends: where do drivers tend to go, how long do they stay, when and where does traffic congestion occur, and so on. The system uses a number of techniques from the field of artificial intelligence. We apply a variant of A* search for solving the stochastic shortest path problem in order to find optimal driving routes through a network of roads given light-status information. We also use dynamic programming and hidden Markov models to determine the progress of a driver through a network of roads from GPS data and light-status data. The Green Driver system is currently deployed for testing in Eugene, Oregon, and is scheduled for large-scale deployment in Portland, Oregon, in Spring 2011.
Recognizing Multi-Agent Activities from GPS Data
Sadilek, Adam (University of Rochester) | Kautz, Henry (University of Rochester)
Recent research has shown that surprisingly rich models of human behavior can be learned from GPS (positional) data. However, most research to date has concentrated on modeling single individuals or aggregate statistical properties of groups of people. Given noisy real-world GPS data, we---in contrast---consider the problem of modeling and recognizing activities that involve multiple related individuals playing a variety of roles. Our test domain is the game of capture the flag---an outdoor game that involves many distinct cooperative and competitive joint activities. We model the domain using Markov logic, a statistical relational language, and learn a theory that jointly denoises the data and infers occurrences of high-level activities, such as capturing a player. Our model combines constraints imposed by the geometry of the game area, the motion model of the players, and by the rules and dynamics of the game in a probabilistically and logically sound fashion. We show that while it may be impossible to directly detect a multi-agent activity due to sensor noise or malfunction, the occurrence of the activity can still be inferred by considering both its impact on the future behaviors of the people involved as well as the events that could have preceded it. We compare our unified approach with three alternatives (both probabilistic and nonprobabilistic) where either the denoising of the GPS data and the detection of the high-level activities are strictly separated, or the states of the players are not considered, or both. We show that the unified approach with the time window spanning the entire game, although more computationally costly, is significantly more accurate.