Michael Montemerlo

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Isaac Penny

> Home > Persons > Michael Montemerlo

Publications

2009
[c23]
- view
  authority control:
- export record
  dblp key:
  - conf/darpa/MontemerloBBDDEHHHHJKLLLMOPPPPSSVT09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/darpa/MontemerloBBDDEHHHHJKLLLMOPPPPSSVT09
Michael Montemerlo, Jan Becker, Suhrid Bhat, Hendrik Dahlkamp, Dmitri Dolgov, Scott Ettinger, Dirk Hähnel, Tim Hilden, Gabe Hoffmann, Burkhard Huhnke, Doug Johnston, Stefan Klumpp, Dirk Langer, Anthony Levandowski, Jesse Levinson, Julien Marcil, David Orenstein, Johannes Paefgen, Isaac Penny, Anna Petrovskaya, Mike Pflueger, Ganymed Stanek, David Stavens, Antone Vogt, Sebastian Thrun:
Junior: The Stanford Entry in the Urban Challenge. The DARPA Urban Challenge 2009: 91-123
2008
[j5]
- view
  authority control:
- export record
  dblp key:
  - journals/jfr/MontemerloBBDDEHHHHJKLLLMOPPPPSSVT08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jfr/MontemerloBBDDEHHHHJKLLLMOPPPPSSVT08
Michael Montemerlo, Jan Becker, Suhrid Bhat, Hendrik Dahlkamp, Dmitri Dolgov, Scott Ettinger, Dirk Hähnel, Tim Hilden, Gabe Hoffmann, Burkhard Huhnke, Doug Johnston, Stefan Klumpp, Dirk Langer, Anthony Levandowski, Jesse Levinson, Julien Marcil, David Orenstein, Johannes Paefgen, Isaac Penny, Anna Petrovskaya, Mike Pflueger, Ganymed Stanek, David Stavens, Antone Vogt, Sebastian Thrun:
Junior: The Stanford entry in the Urban Challenge. J. Field Robotics 25(9): 569-597 (2008)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.