A dynamic sensor placement algorithm for dense sampling

For many applications, including robotic planning, obstacle avoidance, and mapping it has been observed with laser range-scanners and depth sensors that their sampling densities, i.e., the number of range measurements per unit length of the scanned contour, can vary greatly even within a single scan...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2011 IEEE/RSJ International Conference on Intelligent Robots and Systems s. 1167 - 1172
Hlavní autoři: Bhatawadekar, Vineet, Sivalingam, Ravishankar, Papanikolopoulos, Nikolaos
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.09.2011
Témata:
Current measurement
Density measurement
Equations
Robot kinematics
Robot sensing systems
Trajectory
ISBN:1612844545, 9781612844541
ISSN:2153-0858
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:For many applications, including robotic planning, obstacle avoidance, and mapping it has been observed with laser range-scanners and depth sensors that their sampling densities, i.e., the number of range measurements per unit length of the scanned contour, can vary greatly even within a single scan measurement. In this paper, an on-line placement algorithm is proposed that computes where the robot must next move so as to sample its environment uniformly and densely. The algorithm guarantees the minimum number of measurements per unit length of the observed space, obtaining a high and uniform spatial measurement density. It provides a Next-Best-View relative to a robot's current position while satisfying a locally-defined constraint function based on the sampling density of points. Three variants of this algorithm, suitable for different practical applications are demonstrated with experiments on real robots in interesting scenarios.
ISBN:1612844545
9781612844541
ISSN:2153-0858
DOI:10.1109/IROS.2011.6094908