Art gallery theorems and algorithms
Art gallery theorems and algorithms
Introduction to algorithms
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A tight analysis of the greedy algorithm for set cover
Journal of Algorithms
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Handbook of discrete and computational geometry
Occlusions as a Guide for Planning the Next View
IEEE Transactions on Pattern Analysis and Machine Intelligence
Performance of a Distributed Robotic System Using Shared Communication Channels
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
Robot Localization without Depth Perception
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Simplifying complex environments using incremental textured depth meshes
ACM SIGGRAPH 2003 Papers
VC-Dimension of Exterior Visibility
IEEE Transactions on Pattern Analysis and Machine Intelligence
A constant-factor approximation algorithm for optimal terrain guarding
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Near-optimal sensor placements in Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
Planning Tours of Robotic Arms among Partitioned Goals
International Journal of Robotics Research
Segmenting object space by geometric reference structures
ACM Transactions on Sensor Networks (TOSN)
Guarding galleries and terrains
Information Processing Letters
Sensor replacement using mobile robots
Computer Communications
Robust, low-cost, non-intrusive sensing and recognition of seated postures
Proceedings of the 20th annual ACM symposium on User interface software and technology
A General Method for Sensor Planning in Multi-Sensor Systems: Extension to Random Occlusion
International Journal of Computer Vision
On guarding the vertices of rectilinear domains
Computational Geometry: Theory and Applications
The Journal of Machine Learning Research
A nearly optimal sensor placement algorithm for boundary coverage
Pattern Recognition
Efficient Sensor Placement for Surveillance Problems
DCOSS '09 Proceedings of the 5th IEEE International Conference on Distributed Computing in Sensor Systems
A new lower bound for evaluating the performances of sensor location algorithms
Pattern Recognition Letters
Online distributed sensor selection
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Multi-round sensor deployment for guaranteed barrier Coverage
INFOCOM'10 Proceedings of the 29th conference on Information communications
A nearly optimal algorithm for covering the interior of an Art Gallery
Pattern Recognition
IBERAMIA'10 Proceedings of the 12th Ibero-American conference on Advances in artificial intelligence
Optimal sensor placement with signal propagation effects and inhomogeneous coverage preferences
International Journal of Sensor Networks
Submodularity and its applications in optimized information gathering
ACM Transactions on Intelligent Systems and Technology (TIST)
A Sensor Placement Algorithm for a Mobile Robot Inspection Planning
Journal of Intelligent and Robotic Systems
Generalized multi-sensor planning
ECCV'06 Proceedings of the 9th European conference on Computer Vision - Volume Part I
On guarding rectilinear domains
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Visual planning for autonomous mobile robot navigation
MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence
In-situ soil moisture sensing: Optimal sensor placement and field estimation
ACM Transactions on Sensor Networks (TOSN)
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling: An International Journal
Uninterrupted coverage of a planar region with rotating directional antennae
ADHOC-NOW'12 Proceedings of the 11th international conference on Ad-hoc, Mobile, and Wireless Networks
A pseudopolynomial time O(log n)-approximation algorithm for art gallery problems
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Modeling Coverage in Camera Networks: A Survey
International Journal of Computer Vision
Visiting convex regions in a polygonal map
Robotics and Autonomous Systems
Three-dimensional coverage planning for an underwater inspection robot
International Journal of Robotics Research
Hi-index | 0.00 |
This paper descirbes a placement strategy to compute a set of “good” locations where visual sensing will be most effective. Throughout this paper it is assumed that a {\em polygonal 2-D map} of a workspace is given as input. This polygonal map --- also known as a {\em floor plan} of {\em layout} --- is used to compute a set of locations where expensive sensing tasks (such as 3-D image acquisition) could be executed. A map-building robot, for example, can visit these locations in order to build a full 3-D model of the workspace.The sensor placement strategy relies on a randomized algorithm that solves a variant of the {\em art-gallery problem}-\cite{Oro87, She92, Urr97} : Find the minimum set of guards inside a polygonal workspace from which the entire workspace boundary is visibe. To better take into account the limitations of physical sensors, the algorithm computes a set of guards that satisfies incidence and range constraints. Although the computed set of guards is not guaranteed to have minimum size, the algorithm does compute with high probability a set whose size is at most a factor $\big0{ (n + h) \cot \log(c \ (n + h) )$ from the optimal size$c$, where $n$ is the number of edges in the input polygonal map and $n$ the number of obstacles in its interior (holes).