Bibliography submission.

This page allows you to submit an entry to the mobile robotics bibliography using either a forms interface or by emailing a completed bibtex entry (for those who know how to create one).

You can also go back to the CIM Mobile Robotics & Shape page.

Forms interface for bibliography

You can enter a bib entry using the following form. It should now work with any browser that supports FORMS. If you don't have forms support in your browser, use the email method at the end of this page instead.

Publication type:
Author(s) of the paper (first name followed by last name, separate multiple authors with either semicolons or the word "and"):
Title
address or city (conference papers)
year
month
publisher
booktitle (for paper in a book of collected papers)
journal name (for paper in a journal)
journal issue number (for paper in a journal)
page numbers
journal volume number (for paper in a journal)
institution (for technical reports)
URL (if the document is available online, eg. ftp://ftp.cim.mcgill.ca/pub/mobile-robot/paper:sonar.ps)
other keys (did I forget something? eg. nfigures=36. )
To have your entry added, you must include a brief description of the paper that will allow us to classify it (1 or 2 sentences).

A completed example (for a conference paper) is available, if this seems too confusing.

Send a bib entry by email

You can email a bib entry in, but you have to use BIBTEX format. This is illustrated below. The automated script that handles this mail won't answer queries or help out. Sorry. A sample entry looks like this:

@inproceedings{Dudek1995b,
   author    = {Gregory Dudek and Kathleen Romanik and Sue Whitesides},
   title     = {Localizing a Robot with Minimum Travel},
   booktitle = {Proc. Sixth ACM-SIAM Symposium of Discrete Algorithms},
   year      = {1995},
   pages     = {100-109},
   month     = {January},
   address   = {San Francisco, CA},
   url={ftp://ftp.cim.mcgill.ca/pub/mobile-robot/paper:soda-localization-complexity.ps.Z},
   description = {Theoretical work. Presents an
          analysis of the difficulty of 
          global robot localization and an 
          efficient algorithm.  Assumes a 2D polygonal environment.}
}