Sökning: "polygon exploration"

Hittade 3 avhandlingar innehållade orden polygon exploration.

  1. 1. Exploration of polygonal environments

    Författare :Anders Ekman; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Databehandling;

    Sammanfattning : Several robotic problems involve the systematic traversal of environments, commonly called exploration. This thesis presents a strategy for exploration of finite polygonal environments, assuming a point robot that has 1) no positional uncertainty and 2) an ideal range sensor that measures range in N uniformly distributed directions in the plane. LÄS MER

  3. 2. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Författare :Mikael Hammar; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Sammanfattning : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. LÄS MER

  4. 3. Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry

    Författare :Mia Persson; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; systems; control; Datalogi; numerical analysis; broadcasting; polygon exploration; robotics; Mathematics; Matematik; Computer science; clique partition; clustering; computational complexity; computational geometry; computational biology; online algorithm; kontroll; approximation algorithm;

    Sammanfattning : The main contributions of this thesis are in the area of approximation and online algorithm design and derivation of lower bounds on the approximability for a number of combinatorial optimization problems with applications in computational biology and computational geometry. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. LÄS MER