This article is my personal account on the work at Stanford on Stanley, the winning robot in the DARPA Grand Challenge. Between July 2004 and October 2005, my then-postdoc Michael Montemerlo and I led a team of students, engineers, and professionals with the single vision of claiming one of the most prestigious trophies in the field of robotics: the DARPA Grand Challenge (DARPA 2004). The Grand Challenge, organized by the U.S. government, was unprecedented in the nation's history. Instead, this is my personal story of leading the Stanford Racing Team.
This article describes a methodology for programming robots known as probabilistic robotics. The probabilistic paradigm pays tribute to the inherent uncertainty in robot perception, relying on explicit representations of uncertainty when determining what to do. This article surveys some of the progress in the field, using in-depth examples to illustrate some of the nuts and bolts of the basic approach. My central conjecture is that the probabilistic approach to robotics scales better to complex real-world applications than approaches that ignore a robot's uncertainty.
This article summarizes the Conference on Automated Learning and Discovery (CONALD), which took place in June 1998 at Carnegie Mellon University. CONALD brought together an interdisciplinary group of scientists concerned with decision making based on data. One of the meeting's focal points was the identification of promising research topics, which are discussed toward the end of this article.
This article describes JEEVES, one of the winning entries in the 1996 Annual AAAI Mobile Robot Competition and Exhibition, held as part of the Thirteenth National Conference on Artificial Intelligence. The model, a geometric map constructed from sensory data gathered while the robot performed its task, enabled JEEVES to sweep the arena efficiently. This article argues that JEEVES's success depended crucially on the existence of the model. It also argues that models are generally useful in mobile robotics -- even in tasks as simple as the one faced in this competition.