Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 13 of 13 for “"Art Gallery Problem"”.
-
The art gallery problem in polyomino corridors
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2022-11-15 without embargo terms
-
Computing Approximate Solutions to the Art Gallery Problem and Watchman Route Problem by Means of Photon Mapping
<p>Wireless sensor networks (WSNs) can be partitioned component sensor nodes (SNs) who are meant to operate and sense information arriving from multiple spectra in their environment. Determining where to place a single SN or multiple SNs such that the amount of information gained is maximized while …
-
Visibility analysis of landmark-based navigation
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 one landmark but sees no more than one landmark of any particular class. The …
-
Five Interactive Online Demonstrations for Robot Motion Planning
… Sum of Convex Polygons, Visibility Polygon, Art Gallery Problem and Motion Planning Demon strations. The aim of using Mathematica to implement these demonstrations is to provide curated, online interactive tools that can be used worldwide to understand and teach concepts from robotics and …
-
Optimal placement of light fixtures for energy saving
… has become higher than before, and a major part of the energy is on their lighting systems. This thesis aims at reducing the energy consumption of a building's lighting system. Our solution is to minimize the total number of necessary light fixtures in a commercial building, and thus we …
-
An art gallery approach to ensuring that landmarks are distinguishable
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 art gallery problem. A guard set S ⊂ P is a set of points in a polygon P such …
-
Decomposing polygons into r-stars or alpha-bounded subpolygons
… algorithms for a wide variety of decomposition problems. In this thesis we study two different polygon decomposition problems. The first problem that we study is a polygon decomposition problem that is equivalent to the Rectilinear Art Gallery problem. In this problem we seek a decomposition of …
-
Trajectory Planning for UAV and AUV Sensing Missions in Uneven Environments
… waypoint selection as an AUV version of the 3D Art Gallery Problem, ensuring complete visibility coverage using a minimal set of waypoints. For unknown environments, an online and occlusion-aware multi-AUV sweep coverage framework is developed that combines frontier-based exploration, …
-
Geometric optimization problems on orthogonal polygons: hardness results and approximation algorithms
… and complexity results for three guarding and partitioning problems on orthogonal polygons; namely, guarding orthogonal polygons using sliding cameras, partitioning orthogonal polygons so as to minimize the stabbing number and guarding orthogonal terrains using vertex guards. We first study a …
-
Efficient algorithms for beacon routing in polygons
… by Biro et al. [7], a novel twist on guarding in art galleries is introduced. A beacon is a fixed point with an attraction pull that can move points within the polygon. Points move greedily to monotonically decrease their Euclidean distance to the beacon by moving straight towards the beacon or …
-
Geometric Hitting Sets and Their Variants
… thesis explores a few geometric optimization problems that arise</p><p>in robotics and sensor networks. In particular we present efficient</p><p>algorithms for the hitting-set problem and the budgeted hitting-set problem.</p><p>Given a set of objects and a collection of subsets of the …
-
Placement and motion planning algorithms for robotic sensing systems
… prototype robotic sensing systems.In the first part of this dissertation, we study two problems on placing stationary sensors to cover an environment. Our objective is to place the fewest number of sensors required to ensure that every point in the environment is covered. In the first problem, we …
-
Altitude-Constrained Occlusion-Aware UAV Coverage Planning for Autonomous Wilderness Search and Rescue
… the VWSGA+ is compared against state-of-the-art methods and is shown to be superior in providing complete coverage using battery-efficient paths. This dissertation advances the state of autonomy for UAV-assisted wilderness SAR operations by producing high-confidence aerial search coverage …