Kümpel et al., 1999 - Google Patents

Quadtree decomposition of configuration space for robot motion planning

Kümpel et al., 1999

Document ID
9823654777032967295
Author
Kümpel J
Sparbert J
Tibken B
Hofer E
Publication year
Publication venue
1999 European Control Conference (ECC)

External Links

Snippet

This paper presents a method to solve the general problem of path planning in the field of robotics. For autonomous mobile robots the configuration space is given by an occupancy matrix represented by a bitmap. Quadtree decomposition is used to decompose the …
Continue reading at ieeexplore.ieee.org (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/50—Computer-aided design
    • G06F17/5009—Computer-aided design using simulation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T11/00—2D [Two Dimensional] image generation
    • G06T11/20—Drawing from basic elements, e.g. lines or circles
    • G06T11/206—Drawing of charts or graphs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G06F17/30961—Trees
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N3/00—Computer systems based on biological models
    • G06N3/02—Computer systems based on biological models using neural network models
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06T—IMAGE DATA PROCESSING OR GENERATION, IN GENERAL
    • G06T17/00—Three dimensional [3D] modelling, e.g. data description of 3D objects
    • G06T17/20—Finite element generation, e.g. wire-frame surface description, tesselation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements

Similar Documents

Publication Publication Date Title
Blelloch et al. Design and implementation of a practical parallel Delaunay algorithm
Livnat et al. A near optimal isosurface extraction algorithm using the span space
Aloui et al. Cellular morphogenesis of three-dimensional tensegrity structures
Toulouse et al. Multi-level cooperative search: A new paradigm for combinatorial optimization and an application to graph partitioning
Hardwick Implementation and evaluation of an efficient parallel Delaunay triangulation algorithm
Carr et al. Scalable contour tree computation by data parallel peak pruning
HSIEH et al. Evaluation of automatic domain partitioning algorithms for parallel finite element analysis
Gupta et al. Constructing piecewise linear homeomorphisms of simple polygons
Plaza et al. About local refinement of tetrahedral grids based on bisection
Kümpel et al. Quadtree decomposition of configuration space for robot motion planning
Plaza et al. A 3D refinement/derefinement algorithm for solving evolution problems
Bahreininejad et al. Finite element mesh partitioning using neural networks
Takai et al. A cellular automaton model of particle motions and its applications
El Badawy et al. Shape representation using concavity graphs
Kohmoto et al. Performance of a genetic algorithm for the graph partitioning problem
Wang et al. An efficient approximation algorithm for finding a maximum clique using Hopfield network learning
Eppstein Dynamic connectivity in digital images
Gewali et al. Random generation of visibility aware polygons
Karcz-Duleba Dynamics of two-element populations in the space of population states
Spezzano et al. CARPET: A programming language for parallel cellular processing
Hannoun et al. Issues in adaptive mesh refinement implementation
Huang et al. A parallel adaptive mesh refinement algorithm for solving nonlinear dynamical systems
Sipper et al. Convergence to uniformity in a cellular automaton via local coevolution
Aharoni et al. On-line zone construction in arrangements of lines in the plane
Haran et al. An experimental study of point location in general planar arrangements