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 20 of 43 for “"Visibility graph"”.
-
A reduced visibility graph approach for motion planning of autonomously guided vehicles
… This algorithm constructs and searches a reduced visibility graph, within the AGV's configuration space, using heuristic information about the problem domain.<br/><br/>The second algorithm establishes the time minimal collision-semi-free motion for an AGV, from its start point to is goal point, in …
-
Visualization of a plane sweep algorithm for construction of the visibility graph for robot path planning
Research and development work in robotics and industrial automation has prompted a need for efficient motion planning algorithms for collision avoidance. To build fully autonomous robots, these algorithms must also model the environment correctly and accurately to safely maneuver the robot around …
-
Graph-based Path Planning for Mobile Robots
… problem, particularly as it as solved by the visibility graph, is addressed first in Chapter III. Our so-called oriented visibility graph is a combinatorial planner with emphasis on dynamic re-planning in unknown environments at the expensive of guaranteed optimality at all times. An example …
-
Polygon reconstruction from visibility information
… results attempt to rebuild polygons from visibility information. Reconstruction of a general polygon from its visibility graph is still open and only known to be in PSPACE; thus additional information, such as the ordering of the edges around nodes that corresponds to the order of the …
-
Signed visibility graphs of time series and their application to brain networks
… introducing signs to the edges that describe the visibility graph. The resulting signed visibility graph contains more information about the properties of time series than standard visibility graphs. We designed a dynamic programming algorithm that creates optimal, non-overlapping and …
-
Mathematical aspects of coagulation and fragmentation processes
… and fragmentation processes. We initially use visibility graphs as a tool to analyse the results of kinetic Monte Carlo (kMC) simulations of submonolayer deposition in a one dimensional point island model. We introduce an effcient algorithm for the computation of the visibility graph resulting …
-
Topics in combinatorics and algorithms
… tight lower bound on the number of edges in the visibility graph of n non-intersecting line segments in the plane.
-
On fully characterizing terrain visibility graphs
… above the terrain (except at its endpoints). A graph whose vertices represent terrain vertices and whose edges represent mutually visible pairs of terrain vertices is called a terrain visibility graph. Understanding the graph theoretic properties of all terrain visibility graphs may help us …
-
Social Graphs and Their Applications to Robotics
… Path Planning Algorithm (MRPPA), combines Visibility graph VG method with the algebraic connectivity (
-
Geometric Graph Theory and Wireless Sensor Networks
… network topology of the sensors is their visibility graph. Using a standard distributed algorithm, the sensors can build common knowledge of their network topology. We first study the following inverse visibility problem: What positions of sensors and obstacles define the computed …
-
A Strategy for Multiple Cooperative Spacecraft to Control the Translational Velocity of a Shared Payload
… path planning with a three-dimensional visibility graph road-map method, and constrained model predictive control. All elements of the strategy are tested in multiple MATLAB simulations.
-
Criticality in dynamical systems through complex networks
… networks is addressed in two directions: using visibility graphs and intermittent networks. The visibility graph method is used to map time series onto networks. We applied this framework to generate and analyze visibility graphs from time series of the density of infected individuals. The main …
-
A study of mobile robot motion planning
… the research are the configuration space and the visibility graph. A new approach is developed which generates a smoothed minimum time path. The difference between this and the Minimum Time Path at Visibility Node (MTPVN) is that there is more clearance between the robot and the obstacles, and so …
-
The Horizontal Tunnelability Graph is Dual to Level Set Trees
… series analysis. These include tree methods, visibility algorithms, as well as persistence-based barcodes common to topological data analysis. This thesis enhances time series analysis by innovatively combining these perspectives through our concept of horizontal tunnelability. We prove that …
-
An efficient approach to layered-depth image based rendering
There exist a lot of computer graphics techniques to synthesize 3-D environments, of which, Image Based Rendering (IBR) techniques are becoming increasingly popular. In this thesis we concentrate on improving one such IBR technique, viz. Layered Depth Images (LDI). This technique, like many other …
-
Comparison of path-planning and search methods for cooperating unmanned aerial vehicles
… speed and optimization. This thesis shows that a visibility graph method leads to the lowest cost solution, while the Voronoi diagram method provides a computationally inexpensive solution.;The second scenario is a search and destroy mission where nothing is known about the battlefield prior to …
-
Bar-representable visibility graphs and a related network flow problem
… line segments in the plane called bars. The visibility graph associated with a layout is defined as the graph whose vertices correspond to the bars and whose edges represent the horizontal visibilities between pairs of bars. This dissertation is concerned with the characterization of …
-
Investigating the built environment of Fort George Wright, Spokane, Washington: a historic archaeological approach
… plan at different periods was conducted using Visibility Graph Analysis. The results of this analysis were compared to similar studies of contemporary fortifications in Washington State. This thesis demonstrates that an analysis of the physical arrangement of space at Fort George Wright can …
-
Shortest paths in weighted polygons.
… using O(E) space (where E is the size of the visibility of P). The second algorithm has two variations which both require O(n E log n) preprocessing (where E is the number of edges in the visibility graph of P). The first variation takes O(n log n) query time and O($n\sp2$ log n) space. The …
Page 1 of 3