An accelerated sequential algorithm for producing D-optimal designs
SIAM Journal on Scientific and Statistical Computing
Maximizing the spread of influence through a social network
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Near-optimal sensor placements in Gaussian processes
ICML '05 Proceedings of the 22nd international conference on Machine learning
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
Deploying wireless sensors to achieve both coverage and connectivity
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Batch mode active learning and its application to medical image classification
ICML '06 Proceedings of the 23rd international conference on Machine learning
Efficient planning of informative paths for multiple robots
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
A note on maximizing a submodular set function subject to a knapsack constraint
Operations Research Letters
IPSN '08 Proceedings of the 7th international conference on Information processing in sensor networks
Efficient Multi-robot Search for a Moving Target
International Journal of Robotics Research
Stochastic Submodular Maximization
WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
FRACTAL: efficient fault isolation using active testing
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Online distributed sensor selection
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Bounded approximate decentralised coordination via the max-sum algorithm
Artificial Intelligence
A unified submodular framework for multimodal IC Trojan detection
IH'10 Proceedings of the 12th international conference on Information hiding
Unifying geometric, probabilistic, and potential field approaches to multi-robot deployment
International Journal of Robotics Research
Privately releasing conjunctions and the statistical query barrier
Proceedings of the forty-third annual ACM symposium on Theory of computing
MSSF: a multi-document summarization framework based on submodularity
Proceedings of the 34th international ACM SIGIR conference on Research and development in Information Retrieval
Efficient planning under uncertainty with macro-actions
Journal of Artificial Intelligence Research
On dynamic data-driven selection of sensor streams
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Robust grasping under object pose uncertainty
Autonomous Robots
Scene reconstruction and visualization from internet photo collections
Scene reconstruction and visualization from internet photo collections
The filter-placement problem and its application to minimizing information multiplicity
Proceedings of the VLDB Endowment
Adaptive submodularity: theory and applications in active learning and stochastic optimization
Journal of Artificial Intelligence Research
Randomized sensing in adversarial environments
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Three
Following the electrons: methods for power management in commercial buildings
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
Game-theoretic resource allocation for malicious packet detection in computer networks
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Observer effect from stateful resources in agent sensing
Autonomous Agents and Multi-Agent Systems
Operations Research
Light at the end of the tunnel: a Monte Carlo approach to computing value of information
Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems
Efficiently gathering information in costly domains
Decision Support Systems
Look versus leap: computing value of information with high-dimensional streaming evidence
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
AI problems such as autonomous robotic exploration, automatic diagnosis and activity recognition have in common the need for choosing among a set of informative but possibly expensive observations. When monitoring spatial phenomena with sensor networks or mobile robots, for example, we need to decide which locations to observe in order to most effectively decrease the uncertainty, at minimum cost. These problems usually are NP-hard. Many observation selection objectives satisfy submodularity, an intuitive diminishing returns property - adding a sensor to a small deployment helps more than adding it to a large deployment. In this paper, we survey recent advances in systematically exploiting this submodularity property to efficiently achieve near-optimal observation selections, under complex constraints. We illustrate the effectiveness of our approaches on problems of monitoring environmental phenomena and water distribution networks.