# Efficient, incremental coverage of space with a continuous curve

@article{Ramamoorthy2008EfficientIC, title={Efficient, incremental coverage of space with a continuous curve}, author={Subramanian Ramamoorthy and Ram Rajagopal and Lothar Wenzel}, journal={Robotica}, year={2008}, volume={26}, pages={503 - 512} }

SUMMARY This paper is concerned with algorithmic techniques for the incremental generation of continuous curves that can efficiently cover an abstract surface. We introduce the notion of low-discrepancy curves as an extension of the notion of low-discrepancy sequences—such that sufficiently smooth curves with low-discrepancy properties can be defined and generated. We then devise a procedure for lifting these curves, that efficiently cover the unit cube, to abstract surfaces, such as nonlinear…

## One Citation

### Task encoding, motion planning and intelligent control using qualitative models

- Computer Science
- 2007

This dissertation addresses the problem of trajectory generation for dynamical robots operating in unstructured environments in the absence of detailed models of the dynamics of the environment or of…

## References

SHOWING 1-10 OF 34 REFERENCES

### Parametrization and computations in shape spaces with area and boundary invariants

- Mathematics
- 2006

—Shape spaces play an important role in several applications in robotics, most notably by providing a manifold structure on which to perform motion planning, control, behavior discovery and related…

### Incremental Grid Sampling Strategies in Robotics

- Computer ScienceWAFR
- 2004

Algorithms for generating deterministic sample sequences using incremental grid-based sampling to generate dense sample sequences over spaces common in robotics, such as the unit cube, SO(3), and SE(3).

### Geometry from a differentiable viewpoint

- Mathematics
- 1994

Prelude and themes Part I. Synthetic Methods and Results: 1. Spherical geometry 2. Euclid 3. The theory of parallels 4. Non-Euclidean geometry I 5. Non-Euclidean geometry II Part II. Development:…

### Incremental low-discrepancy lattice methods for motion planning

- Computer Science2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422)
- 2003

We present deterministic sequences for use in sampling-based approaches to motion planning. They simultaneously combine the qualities found in many other sequences: i) the incremental and…

### On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals

- Mathematics
- 1960

by formulae of the form ~'iwi/(x,1 . . . . . xi~ ). He points out tha t the efficiency of such an integration formula m a y be gauged by considering how it fares when [(x 1 . . . . . xk) is the…

### THE EVALUATION OF DEFINITE INTEGRALS, AND A QUASI-MONTE-CARLO METHOD BASED ON THE PROPERTIES OF ALGEBRAIC NUMBERS

- Mathematics
- 1951

A formula is given for the approximate evaluation of multiple definite integrals using the ergodic property of a certain transformation of the unit cube into itself. Estimates of the rate of…

### Multidimensional sampling for simulation and integration: measures, discrepancies, and quasi-random numbers

- Mathematics, Physics
- 1996

### Exact robot navigation using artificial potential functions

- Computer ScienceIEEE Trans. Robotics Autom.
- 1992

A methodology for exact robot motion planning and control that unifies the purely kinematic path planning problem with the lower level feedback controller design is presented. Complete information…

### Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2002, Nice, France, December 15-17, 2002

- Computer ScienceWAFR
- 2004

Algorithms for Motion and Navigation in Virtual Environments and Games, and Constraint-Based Motion Planning Using Voronoi Diagrams for Kinematically Controllable Underactuated Mechanical Systems.

### Quasi-Random Sequences and Their Discrepancies

- MathematicsSIAM J. Sci. Comput.
- 1994

This work has shown that for moderate or large s, there is an intermediate regime in which the discrepancy of a quasi-random sequence is almost exactly the same as that of a randomly chosen sequence.