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 38 for “"Cell decomposition"”.

  1. A Cell Decomposition Approach to Autonomous Path Planning for Directional Mobile Sensors

    A methodology based on integer programming and cell decomposition is developed for planning the path of UGVs equipped with directional sensors used to classify multiple targets in an obstacle-populated environment. While it is desirable to solve this problem in minimum time, the non-completeness of …

    cornell Repository record for A Cell Decomposition Approach to Autonomous Path Planning for Directional Mobile Sensors (opens in a new tab)

  2. Mobile robot path planning based on hierarchical hexagonal decomposition

    … thesis, a new algorithm based on hierarchical cell decomposition and artificial potential field is developed to solve the find-path problem for a mobile robot. The basic cell structure used for decomposition is a hexagon. The artificial potential field is based on an attractive force from the …

    njit Repository record for Mobile robot path planning based on hierarchical hexagonal decomposition (opens in a new tab)

  3. A Hierarchical On-Line Path Planning Scheme using Wavelets

    … problem is solved using a multi-resolution cell decomposition of the environment obtained from the wavelet transform. In the second algorithm, we extend the results of the the first one by using the multiresolution representation of the environment in conjunction with a conformal mapping to …

    gatech Repository record for A Hierarchical On-Line Path Planning Scheme using Wavelets (opens in a new tab)

  4. Incremental geometric robot motion planning

    … incremental algorithms to compute an exact cell decomposition of the collision-free portion of the robot configuration space for a line segment robot moving freely in the plane amidst polygonal obstacles. After computing an initial decomposition of the collision-free portion of the robot …

    uiuc Repository record for Incremental geometric robot motion planning (opens in a new tab)

  5. Characterization of Semicomputable Sets, and Computable Partial Functions, on the Real Plane

    … 'whiles' programming language. By means of the cell decomposition theorem, variants of these structure theorem are derived, with "basic open semialgebraic sets" replaced by "connected open semialgebraic sets". (2) Equivalence of computability models for partial functions on the Real Plane. This …

    mcmaster Repository record for Characterization of Semicomputable Sets, and Computable Partial Functions, on the Real Plane (opens in a new tab)

  6. Minimizing Turns in Single and Multi Robot Coverage Path Planning

    … sum of their altitudes. Given an initial convex decomposition of a workspace, we apply this method to iteratively re-optimize and delete cuts of the decomposition. Finally, we compute a coverage path of the workspace by placing parallel line segments in each region, and then computing a tour of …

    waterloo Repository record for Minimizing Turns in Single and Multi Robot Coverage Path Planning (opens in a new tab)

  7. On the geometry and parametrization of almost invariant subspaces and observer theory

    … fixed restriction indices. They constructed a cell decomposition of the Brunovsky strata into so called Kronecker cells. In my thesis I show that in the tight case this cell decomposition is induced by a Bruhat decomposition of a generalized flag manifold. I identify the adherence order of the …

    wurz-thes Repository record for On the geometry and parametrization of almost invariant subspaces and observer theory (opens in a new tab)

  8. VISION-BASED TERRAIN CLASSIFICATION AND LEARNING TO IMPROVE AUTONOMOUS GROUND VEHICLE NAVIGATION IN OUTDOOR ENVIRONMENTS

    … planning, developing paths using approximate cell decomposition and the A* search algorithm. Tests of the developed random forest revealed accurate classification capabilities for all terrain types, but a tendency to misclassify certain terrain types. Portions of the navigation solution were …

    nps Repository record for VISION-BASED TERRAIN CLASSIFICATION AND LEARNING TO IMPROVE AUTONOMOUS GROUND VEHICLE NAVIGATION IN OUTDOOR ENVIRONMENTS (opens in a new tab)

  9. Some computations of the homology of real grassmannian manifolds

    … first step is usually to look at the Schubert cell decomposition, and the chain complex associated with it. In the complex case and the real unoriented case with Z₂ coefficients the additive structure is obtained immediately (i.e., generated by the homology classes represented by the Schubert …

    ubc Repository record for Some computations of the homology of real grassmannian manifolds (opens in a new tab) Download PDF for Some computations of the homology of real grassmannian manifolds (opens in a new tab)

  10. Heuristic Satisficing Inferential Decision Making in Human and Robot Active Perception

    … sensor planning methods, such as cell decomposition, information roadmap, and information potential algorithms fail due to adverse weather (fog) or significantly underperform because of time or cost limitations.

    cornell Repository record for Heuristic Satisficing Inferential Decision Making in Human and Robot Active Perception (opens in a new tab)

  11. Distality to and from combinatorics

    … properties. We do so by constructing distal decompositions (or strong honest definitions), a form of cell decomposition with desirable combinatorial properties. Chapter 4 demonstrates the to direction. We prove that relations definable in a distal structure have better bounds for the …

    whiterose Download PDF for Distality to and from combinatorics (opens in a new tab)

  12. Energy efficient path planning: the effectiveness of Q-learning algorithm in saving energy

    … several unstructured and unknown environments. A cell decomposition method was used to generate the search space representation of the environments, within which the algorithm operated. The results show that the Q-learning path planner paths on average consumed 3.04% less energy than the A* path …

    cape-town Repository record for Energy efficient path planning: the effectiveness of Q-learning algorithm in saving energy (opens in a new tab)

  13. Electrochemical analysis of CuCl/HCl electrolyser

    … half-reactions as well as electrolysis full-cell reaction. Gibbs energy minimization method is used to determine equilibrium concentrations of stable anolyte ions. Determination of thermodynamic properties of ions in the solution is carried out via application of the Helgeson-Kirkham-Flowers …

    uoit Repository record for Electrochemical analysis of CuCl/HCl electrolyser (opens in a new tab)

  14. Layered path planning for an autonomous mobile robot

    … into a collection of convex pieces called cells. The cells are transformed into a graph by adjacency. We show that every simple path on the graph corresponds to a unique simple homotopy class in the robot's world. We then search the graph to give each class a symbolic representation which …

    nps Repository record for Layered path planning for an autonomous mobile robot (opens in a new tab)

  15. Qualitative topological coverage of unknown environments by mobile robots

    … coverage information is overcome by embedding a cell decomposition, called slice decomposition, within the map. This is achieved using landmarks in the topological map as cell boundaries in slice decomposition. Slice decomposition is a new cell decomposition method which uses the landmarks in the …

    auckland-ms Repository record for Qualitative topological coverage of unknown environments by mobile robots (opens in a new tab)

  16. Qualitative Topological Coverage of Unknown Environments by Mobile Robots

    … coverage information is overcome by embedding a cell decomposition, called slice decomposition, within the map. This is achieved using landmarks in the topological map as cell boundaries in slice decomposition. Slice decomposition is a new cell decomposition method which uses the landmarks in the …

    soton Download PDF for Qualitative Topological Coverage of Unknown Environments by Mobile Robots (opens in a new tab)

  17. Properties of Shortest Length Curves inside Semi-Algebraic Sets and Problems related to an Erdos Conjecture concerning Lattice Cubes

    … come up with a stratification, in particular a cell decomposition, such that it satisfies the following analytical property. Given an arbitrary semi-closed and connected semi-algebraic set $X$ in $\mathbb{R}^2$, any two points in $X$ may be joined by a continuous path $\gamma$ of shortest …

    rice Repository record for Properties of Shortest Length Curves inside Semi-Algebraic Sets and Problems related to an Erdos Conjecture concerning Lattice Cubes (opens in a new tab)

  18. Hierarchical Path Planning and Control of a Small Fixed-wing UAV: Theory and Experimental Validation

    … transform (FLWT) to get a multiresolution cell decomposition of the environment, whose dimension is commensurate to the on-board computational resources. A topological graph representation of the multiresolution cell decomposition is constructed efficiently, directly from the approximation …

    gatech Repository record for Hierarchical Path Planning and Control of a Small Fixed-wing UAV: Theory and Experimental Validation (opens in a new tab)

  19. Combinatorial optimization on embedded curves

    … the triangulation X times, we can build another cell decomposition of the input surface of complexity O(n), in O(min(X, n^2 log X)) time, whose 1-skeleton contains the input curve. We emphasize the the cell decomposition algorithm takes polynomial time even if X is exponential. The main …

    uiuc Repository record for Combinatorial optimization on embedded curves (opens in a new tab)

  20. Collision-free path planning

    … robot rotations as an alternative to complex cell decomposition techniques or building passage networks on approximated 3D C-space obstacles;A common approach in path planning is to compute the Minkowski difference of a polygonal robot model with the polygonal obstacle environment. However …

    iastate Repository record for Collision-free path planning (opens in a new tab)

Page 1 of 2