A dynamic sensor placement algorithm for dense sampling

Vineet Bhatawadekar, Duc Fehr, Vassilios Morellas, Nikolaos P Papanikolopoulos

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

2 Citations (Scopus)

Abstract

A robot that can drive autonomously, actively seeking more information about the environment as it attempts to infer it, has significant value in many application areas. Range scanners and depth sensors are one of the most popular sensors used in mobile robotics to accomplish several higher level tasks such as local planning, obstacle avoidance, and mapping and localization among others. For any application, it has been observed with laser range-scanners and depth sensors, that the sampling density, i.e., the number of range measurements per unit length of the scanned contour, can vary greatly even within a single scan measurement. The number of samples and their distribution are important factors, for example, when estimating the alignment between two range scans obtained from two different positions. In this paper, an on-line placement algorithm is proposed that computes where the robot must move next so that it is able to sample the environment uniformly and densely. The algorithm guarantees that a minimum number of measurements per unit length of the observed space is obtained, i.e. a high spatial measurement density. At any given time instant the robot computes a NEXT-BEST-VIEW relative to its current position while satisfying a locally-defined constraint function based on the sampling density of points. Two 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 publicationFusion 2011 - 14th International Conference on Information Fusion
StatePublished - Sep 13 2011
Event14th International Conference on Information Fusion, Fusion 2011 - Chicago, United States
Duration: Jul 5 2011Jul 8 2011

Other

Other14th International Conference on Information Fusion, Fusion 2011
CountryUnited States
CityChicago
Period7/5/117/8/11

Fingerprint

Robots
Sampling
Sensors
Collision avoidance
Robotics
Planning
Lasers
Experiments

Keywords

  • Adaptive systems
  • Reactive sensing

Cite this

Bhatawadekar, V., Fehr, D., Morellas, V., & Papanikolopoulos, N. P. (2011). A dynamic sensor placement algorithm for dense sampling. In Fusion 2011 - 14th International Conference on Information Fusion [5977613]

A dynamic sensor placement algorithm for dense sampling. / Bhatawadekar, Vineet; Fehr, Duc; Morellas, Vassilios; Papanikolopoulos, Nikolaos P.

Fusion 2011 - 14th International Conference on Information Fusion. 2011. 5977613.

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

Bhatawadekar, V, Fehr, D, Morellas, V & Papanikolopoulos, NP 2011, A dynamic sensor placement algorithm for dense sampling. in Fusion 2011 - 14th International Conference on Information Fusion., 5977613, 14th International Conference on Information Fusion, Fusion 2011, Chicago, United States, 7/5/11.
Bhatawadekar V, Fehr D, Morellas V, Papanikolopoulos NP. A dynamic sensor placement algorithm for dense sampling. In Fusion 2011 - 14th International Conference on Information Fusion. 2011. 5977613
Bhatawadekar, Vineet ; Fehr, Duc ; Morellas, Vassilios ; Papanikolopoulos, Nikolaos P. / A dynamic sensor placement algorithm for dense sampling. Fusion 2011 - 14th International Conference on Information Fusion. 2011.
@inproceedings{e5387a7a61a94a7f860eed2436aadac2,
title = "A dynamic sensor placement algorithm for dense sampling",
abstract = "A robot that can drive autonomously, actively seeking more information about the environment as it attempts to infer it, has significant value in many application areas. Range scanners and depth sensors are one of the most popular sensors used in mobile robotics to accomplish several higher level tasks such as local planning, obstacle avoidance, and mapping and localization among others. For any application, it has been observed with laser range-scanners and depth sensors, that the sampling density, i.e., the number of range measurements per unit length of the scanned contour, can vary greatly even within a single scan measurement. The number of samples and their distribution are important factors, for example, when estimating the alignment between two range scans obtained from two different positions. In this paper, an on-line placement algorithm is proposed that computes where the robot must move next so that it is able to sample the environment uniformly and densely. The algorithm guarantees that a minimum number of measurements per unit length of the observed space is obtained, i.e. a high spatial measurement density. At any given time instant the robot computes a NEXT-BEST-VIEW relative to its current position while satisfying a locally-defined constraint function based on the sampling density of points. Two variants of this algorithm, suitable for different practical applications are demonstrated with experiments on real robots in interesting scenarios.",
keywords = "Adaptive systems, Reactive sensing",
author = "Vineet Bhatawadekar and Duc Fehr and Vassilios Morellas and Papanikolopoulos, {Nikolaos P}",
year = "2011",
month = "9",
day = "13",
language = "English (US)",
isbn = "9781457702679",
booktitle = "Fusion 2011 - 14th International Conference on Information Fusion",

}

TY - GEN

T1 - A dynamic sensor placement algorithm for dense sampling

AU - Bhatawadekar, Vineet

AU - Fehr, Duc

AU - Morellas, Vassilios

AU - Papanikolopoulos, Nikolaos P

PY - 2011/9/13

Y1 - 2011/9/13

N2 - A robot that can drive autonomously, actively seeking more information about the environment as it attempts to infer it, has significant value in many application areas. Range scanners and depth sensors are one of the most popular sensors used in mobile robotics to accomplish several higher level tasks such as local planning, obstacle avoidance, and mapping and localization among others. For any application, it has been observed with laser range-scanners and depth sensors, that the sampling density, i.e., the number of range measurements per unit length of the scanned contour, can vary greatly even within a single scan measurement. The number of samples and their distribution are important factors, for example, when estimating the alignment between two range scans obtained from two different positions. In this paper, an on-line placement algorithm is proposed that computes where the robot must move next so that it is able to sample the environment uniformly and densely. The algorithm guarantees that a minimum number of measurements per unit length of the observed space is obtained, i.e. a high spatial measurement density. At any given time instant the robot computes a NEXT-BEST-VIEW relative to its current position while satisfying a locally-defined constraint function based on the sampling density of points. Two variants of this algorithm, suitable for different practical applications are demonstrated with experiments on real robots in interesting scenarios.

AB - A robot that can drive autonomously, actively seeking more information about the environment as it attempts to infer it, has significant value in many application areas. Range scanners and depth sensors are one of the most popular sensors used in mobile robotics to accomplish several higher level tasks such as local planning, obstacle avoidance, and mapping and localization among others. For any application, it has been observed with laser range-scanners and depth sensors, that the sampling density, i.e., the number of range measurements per unit length of the scanned contour, can vary greatly even within a single scan measurement. The number of samples and their distribution are important factors, for example, when estimating the alignment between two range scans obtained from two different positions. In this paper, an on-line placement algorithm is proposed that computes where the robot must move next so that it is able to sample the environment uniformly and densely. The algorithm guarantees that a minimum number of measurements per unit length of the observed space is obtained, i.e. a high spatial measurement density. At any given time instant the robot computes a NEXT-BEST-VIEW relative to its current position while satisfying a locally-defined constraint function based on the sampling density of points. Two variants of this algorithm, suitable for different practical applications are demonstrated with experiments on real robots in interesting scenarios.

KW - Adaptive systems

KW - Reactive sensing

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

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

M3 - Conference contribution

SN - 9781457702679

BT - Fusion 2011 - 14th International Conference on Information Fusion

ER -