A dynamic sensor placement algorithm for dense sampling

Vineet Bhatawadekar, Ravishankar Sivalingam, Nikolaos P Papanikolopoulos

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publicationIROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems
Subtitle of host publicationCelebrating 50 Years of Robotics
Pages1167-1172
Number of pages6
DOIs
StatePublished - Dec 29 2011
Event2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics, IROS'11 - San Francisco, CA, United States
Duration: Sep 25 2011Sep 30 2011

Other

Other2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics, IROS'11
CountryUnited States
CitySan Francisco, CA
Period9/25/119/30/11

Fingerprint

Robots
Sampling
Sensors
Collision avoidance
Robotics
Planning
Lasers
Experiments

Cite this

Bhatawadekar, V., Sivalingam, R., & Papanikolopoulos, N. P. (2011). A dynamic sensor placement algorithm for dense sampling. In IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics (pp. 1167-1172). [6048576] https://doi.org/10.1109/IROS.2011.6048576

A dynamic sensor placement algorithm for dense sampling. / Bhatawadekar, Vineet; Sivalingam, Ravishankar; Papanikolopoulos, Nikolaos P.

IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics. 2011. p. 1167-1172 6048576.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Bhatawadekar, V, Sivalingam, R & Papanikolopoulos, NP 2011, A dynamic sensor placement algorithm for dense sampling. in IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics., 6048576, pp. 1167-1172, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics, IROS'11, San Francisco, CA, United States, 9/25/11. https://doi.org/10.1109/IROS.2011.6048576
Bhatawadekar V, Sivalingam R, Papanikolopoulos NP. A dynamic sensor placement algorithm for dense sampling. In IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics. 2011. p. 1167-1172. 6048576 https://doi.org/10.1109/IROS.2011.6048576
Bhatawadekar, Vineet ; Sivalingam, Ravishankar ; Papanikolopoulos, Nikolaos P. / A dynamic sensor placement algorithm for dense sampling. IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems: Celebrating 50 Years of Robotics. 2011. pp. 1167-1172
@inproceedings{8740e275bce04c04839db1e8caae0963,
title = "A dynamic sensor placement algorithm for dense sampling",
abstract = "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.",
author = "Vineet Bhatawadekar and Ravishankar Sivalingam and Papanikolopoulos, {Nikolaos P}",
year = "2011",
month = "12",
day = "29",
doi = "10.1109/IROS.2011.6048576",
language = "English (US)",
isbn = "9781612844541",
pages = "1167--1172",
booktitle = "IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems",

}

TY - GEN

T1 - A dynamic sensor placement algorithm for dense sampling

AU - Bhatawadekar, Vineet

AU - Sivalingam, Ravishankar

AU - Papanikolopoulos, Nikolaos P

PY - 2011/12/29

Y1 - 2011/12/29

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84455171266&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84455171266&partnerID=8YFLogxK

U2 - 10.1109/IROS.2011.6048576

DO - 10.1109/IROS.2011.6048576

M3 - Conference contribution

SN - 9781612844541

SP - 1167

EP - 1172

BT - IROS'11 - 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems

ER -