Browse Dept. of 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; LaValle, Steven M. (2010-08-04)
    The art gallery problem asks for the smallest number of guards required to see every point of the interior of a polygon $P$. We introduce and study a similar problem called the chromatic art gallery problem. Suppose that ...

    application/pdf

    application/pdfPDF (124kB)
  • Erickson, Lawrence; Yu, Jingjin; Huang, Yaonan; LaValle, Steven M. (2013-04-18)
    This document contains supplemental simulation data for "Counting Moving Bodies Using Sparse Sensor Beams" by Lawrence H. Erickson, Jingjin Yu, Yaonan Huang, and Steven M. LaValle.

    application/pdf

    application/pdfPDF (137kB)
  • 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)