Estimating the coverage measure and the area explored by a line-sweep sensor on the plane
From MaRDI portal
Publication:6570313
Recommendations
- Near-optimal coverage path planning with turn costs
- Coverage for robotics -- a survey of recent results
- The giving tree: Constructing trees for efficient offline and online multi-robot coverage
- Distributed coverage control for concave areas by a heterogeneous Robot-Swarm with visibility sensing constraints
- Sweep coverage of discrete time multi-robot networks with general topologies
Cites work
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 1466165 (Why is no real title available?)
- scientific article; zbMATH DE number 3221041 (Why is no real title available?)
- A new formula for winding number
- Computing a Guaranteed Approximation of the Zone Explored by a Robot
- Computing the topological degree of a mapping in \(R^n\)
- Coordinate-free coverage in sensor networks with controlled boundaries via homology
- Coverage in sensor networks via persistent homology
- Effective topological degree computation based on interval arithmetic
- Loop detection of mobile robots using interval analysis
- Mapping degree theory
- Set inversion via interval analysis for nonlinear bounded-error estimation
- Target Enumeration via Euler Characteristic Integrals
- Thick set inversion
- Topological invariants of knots and links.
This page was built for publication: Estimating the coverage measure and the area explored by a line-sweep sensor on the plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6570313)
