Browse Dissertations and Theses - Computer Science by Author "Erickson, Lawrence"

  • Erickson, Lawrence (2013-02-03)
    How many different classes of partially distinguishable landmarks are needed to ensure that a robot can always see a landmark without simultaneously seeing two of the same class? To study this, we introduce the chromatic ...

    application/pdf

    application/pdfPDF (180kB)
  • Erickson, Lawrence (2013-02-03)
    How many different classes of partially distinguishable landmarks are needed to ensure that a robot can always see a landmark without simultaneously seeing two of the same class? To study this, we introduce the chromatic ...

    application/pdf

    application/pdfPDF (180kB)
  • Erickson, Lawrence (2014-05-30)
    This thesis introduces and examines the chromatic art gallery problem. The chromatic art gallery problem asks for the minimum number of landmark classes required to ensure that every point in an input polygon sees at least ...

    application/pdf

    application/pdfPDF (1MB)