Exploiting submodular value functions for scaling up active perception

Exploiting submodular value functions for scaling up active perception

<p>In <em>active perception</em> tasks, an agent aims to select sensory actions that reduce its uncertainty about one or more hidden variables. For example, a mobile robot takes sensory actions to efficiently navigate in a new environment. While <em>partially observable Marko...

Bibliografske podrobnosti
Main Authors:	Satsangi, Y, Whiteson, S, Oliehoek, F, Spaan, M
Format:	Journal article
Izdano:	Springer Verlag 2017

Podobne knjige/članki

PAC greedy maximization with efficient bounds on information gain for sensor selection
od: Whiteson, S, et al.
Izdano: (2016)

Which submodular functions are expressible using binary submodular functions?
od: Živný, S, et al.
Izdano: (2008)

Which submodular functions are expressible using binary submodular functions?
od: Živný, S, et al.
Izdano: (2008)

Real−time resource allocation for tracking systems
od: Satsangi, Y, et al.
Izdano: (2017)

Approximating Submodular Functions Everywhere
od: Goemans, Michel X., et al.
Izdano: (2011)

Matchings, matroids and submodular functions
od: Harvey, Nicholas James Alexander
Izdano: (2009)

Approximation Algorithms for the Submodular Load Balancing with Submodular Penalties
od: Xiaofei Liu, et al.
Izdano: (2020-10-01)

Resilient monotone submodular function maximization
od: Tzoumas, V, et al.
Izdano: (2017)

Robust Monotone Submodular Function Maximization
od: Orlin, James B, et al.
Izdano: (2021)

Robust monotone submodular function maximization
od: Orlin, James B, et al.
Izdano: (2021)

Resilient monotone submodular function maximization
od: Tzoumas, Vasileios, et al.
Izdano: (2018)

The Expressive Power of Binary Submodular Functions
od: Zivny, S, et al.
Izdano: (2008)

The Expressive Power of Binary Submodular Functions.
od: Zivny, S, et al.
Izdano: (2009)

The Expressive Power of Binary Submodular Functions
od: Živný, S, et al.
Izdano: (2009)

The Expressive Power of Binary Submodular Functions
od: Živný, S, et al.
Izdano: (2008)

Maximizing k-submodular functions and beyond
od: Ward, J, et al.
Izdano: (2016)

The Expressive Power of Binary Submodular Functions
od: Zivny, S, et al.
Izdano: (2008)

The expressive power of binary submodular functions
od: Živný, S, et al.
Izdano: (2009)

The expressive power of binary submodular functions
od: ivný, S, et al.
Izdano: (2009)

The Expressive Power of Binary Submodular Functions
od: Živný, S, et al.
Izdano: (2008)

The Expressive Power of Binary Submodular Functions
od: Živný, S, et al.
Izdano: (2009)

Gradient bounded dynamic programming with submodular and concave extensible value functions
od: Lebedev, D, et al.
Izdano: (2021)

Maximizing information gain in partially observable environments via prediction rewards
od: Satsangi, Y, et al.
Izdano: (2020)

Coxeter submodular functions and deformations of Coxeter permutahedra
od: Ardila, Federico, et al.
Izdano: (2022)

Coxeter submodular functions and deformations of Coxeter permutahedra
od: Ardila, Federico, et al.
Izdano: (2021)

Deep Compressed Sensing for Learning Submodular Functions
od: Yu-Chung Tsai, et al.
Izdano: (2020-05-01)

The submodular joint replenishment problem
od: Cheung, Maurice, et al.
Izdano: (2015)

Submodular Secretary Problem and Extensions
od: Zadimoghaddam, Morteza, et al.
Izdano: (2010)

Distributionally robust submodular maximization
od: Staib, Matthew, et al.
Izdano: (2021)

Discrete Newton’s Algorithm for Parametric Submodular Function Minimization
od: Goemans, Michel X, et al.
Izdano: (2018)

Scheduling to Minimize Power Consumption using Submodular Functions
od: Demaine, Erik D., et al.
Izdano: (2012)

Scheduling to minimize power consumption using submodular functions
od: Zadimoghaddam, Morteza
Izdano: (2011)

A simple combinatorial algorithm for submodular function minimization
od: Iwata, Satoru, et al.
Izdano: (2011)

On Maximizing Sums of Non-monotone Submodular and Linear Functions
od: Qi, Benjamin
Izdano: (2023)

Robust Budget Allocation Via Continuous Submodular Functions
od: Staib, Matthew, et al.
Izdano: (2021)

Test Suite Reduction via Submodular Function Maximization
od: WEN Jin, ZHANG Xing-yu, SHA Chao-feng, LIU Yan-jun
Izdano: (2021-12-01)

Gradient-bounded dynamic programming for submodular and concave extensible value functions with probabilistic performance guarantees
od: Lebedev, D, et al.
Izdano: (2021)

Allowing non-submodular score functions in distributed task allocation
od: Choi, Han-Lim, et al.
Izdano: (2013)

Attempting the Impossible: Enumerating Extremal Submodular Functions for n = 6
od: Elod P. Csirmaz, et al.
Izdano: (2024-12-01)

Robust and Adaptive Sequential Submodular Optimization
od: Tzoumas, V, et al.
Izdano: (2023)