Daniel Barber

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 Andrew Best

> Home > Persons > Daniel Barber

Publications

2018
[c5]
- view
  authority control:
- export record
  dblp key:
  - conf/cvpr/BestNPBM18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cvpr/BestNPBM18
Andrew Best, Sahil Narang, Lucas Pasqualin, Daniel Barber, Dinesh Manocha:
AutonoVi-Sim: Autonomous Vehicle Simulation Platform With Weather, Sensing, and Traffic Control. CVPR Workshops 2018: 1048-1056
2017
[c4]
- view
  authority control:
- export record
  dblp key:
  - conf/ahfe/BarberB17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ahfe/BarberB17
Daniel Barber, Andrew Best:
Connected and Automated Vehicle Simulation to Enhance Vehicle Message Delivery. AHFE (7) 2017: 38-46
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/iros/BestNBM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/iros/BestNBM17
Andrew Best, Sahil Narang, Daniel Barber, Dinesh Manocha:
AutonoVi: Autonomous vehicle planning with dynamic maneuvers and traffic constraints. IROS 2017: 2629-2636
[i1]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/BestNBM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/BestNBM17
Andrew Best, Sahil Narang, Daniel Barber, Dinesh Manocha:
AutonoVi: Autonomous Vehicle Planning with Dynamic Maneuvers and Traffic Constraints. CoRR abs/1703.08561 (2017)

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.