Copertina

Optimal Sensor and Actuator Selection for Factored Markov Decision Processes: Complexity, Approximability and Algorithms

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bhargav, Jayanth, Ghasemi, Mahsa, Sundaram, Shreyas
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Systems and Control Computational Complexity Optimization and Control
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Submodular Information Selection for Hypothesis Testing with Misclassification Penalties
di: Bhargav, Jayanth, et al.
Pubblicazione: (2024)

Sensor Scheduling in Intrusion Detection Games with Uncertain Payoffs
di: Bhargav, Jayanth, et al.
Pubblicazione: (2025)

Robust Information Selection for Hypothesis Testing with Misclassification Penalties
di: Bhargav, Jayanth, et al.
Pubblicazione: (2025)

Distributed Equilibrium-Seeking in Target Coverage Games via Self-Configurable Networks under Limited Communication
di: Bhargav, Jayanth, et al.
Pubblicazione: (2026)

Query-Efficient Zeroth-Order Algorithms for Nonconvex Constrained Optimization
di: Jin, Ruiyang, et al.
Pubblicazione: (2025)

Convex Approximations of Random Constrained Markov Decision Processes
di: Varagapriya, V, et al.
Pubblicazione: (2025)

On the Complexity of p-Order Cone Programs
di: Blanco, Víctor, et al.
Pubblicazione: (2025)

The Complexity of Recognizing Facets for the Knapsack Polytope
di: Chen, Rui, et al.
Pubblicazione: (2022)

The Complexity of Computing KKT Solutions of Quadratic Programs
di: Fearnley, John, et al.
Pubblicazione: (2023)

Policy Gradient Algorithms in Average-Reward Multichain MDPs
di: Lee, Jongmin, et al.
Pubblicazione: (2026)

Markov Decision Process and Approximate Dynamic Programming for a Patient Assignment Scheduling problem
di: O'Reilly, Malgorzata M., et al.
Pubblicazione: (2024)

Quantum Markov Decision Processes: General Theory, Approximations, and Classes of Policies
di: Saldi, Naci, et al.
Pubblicazione: (2024)

Tight Time Complexities in Parallel Stochastic Optimization with Arbitrary Computation Dynamics
di: Tyurin, Alexander
Pubblicazione: (2024)

Minimal Actuator Selection
di: Ballotta, Luca, et al.
Pubblicazione: (2026)

Operator Splitting for Convex Constrained Markov Decision Processes
di: Grontas, Panagiotis D., et al.
Pubblicazione: (2024)

Markov Decision Process Design: A Framework for Integrating Strategic and Operational Decisions
di: Brown, Seth, et al.
Pubblicazione: (2023)

Quantum Markov Decision Processes: Dynamic and Semi-Definite Programs for Optimal Solutions
di: Saldi, Naci, et al.
Pubblicazione: (2024)

Revealing POMDPs: Qualitative and Quantitative Analysis for Parity Objectives
di: Asadi, Ali, et al.
Pubblicazione: (2025)

A direct optimization algorithm for input-constrained MPC
di: Wu, Liang, et al.
Pubblicazione: (2023)

A Markov Decision Process Framework for Enhancing Power System Resilience during Wildfires under Decision-Dependent Uncertainty
di: Zhao, Xinyi, et al.
Pubblicazione: (2026)

Subgradient Method for System Identification with Non-Smooth Objectives
di: Yalcin, Baturalp, et al.
Pubblicazione: (2025)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
di: Ketkov, Sergey S., et al.
Pubblicazione: (2024)

Avoiding Deadlocks via Weak Deadlock Sets
di: Oriolo, Gianpaolo, et al.
Pubblicazione: (2024)

A System-Dynamic Based Simulation and Bayesian Optimization for Inventory Management
di: Maitra, Sarit
Pubblicazione: (2024)

Learning complexity of gradient descent and conjugate gradient algorithms
di: Jiao, Xianqi, et al.
Pubblicazione: (2024)

Geometric and computational hardness of bilevel programming
di: Bolte, Jérôme, et al.
Pubblicazione: (2024)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
di: Sim, Chee-Khian
Pubblicazione: (2024)

A parallel framework for graphical optimal transport
di: Fan, Jiaojiao, et al.
Pubblicazione: (2024)

Hardness of some optimization problems over correlation polyhedra
di: Caprara, Alberto, et al.
Pubblicazione: (2026)

On the Induced Norms of Matrices and Grothendieck problems
di: Truong, Lan V., et al.
Pubblicazione: (2026)

Efficient LP warmstarting for linear modifications of the constraint matrix
di: Derval, Guillaume, et al.
Pubblicazione: (2025)

Constrained Nonnegative Gram Feasibility is $\exists\mathbb{R}$-Complete
di: Majumdar, Angshul
Pubblicazione: (2026)

On the Degree Automatability of Sum-of-Squares Proofs
di: Bortolotti, Alex, et al.
Pubblicazione: (2025)

Parameterized complexity of scheduling unit-time jobs with generalized precedence constraints
di: Büsing, Christina, et al.
Pubblicazione: (2025)

Benchmarking of Quantum and Classical Computing in Large-Scale Dynamic Portfolio Optimization Under Market Frictions
di: Chen, Ying, et al.
Pubblicazione: (2025)

Counterfactual Explanations for Integer Optimization Problems
di: Engelhardt, Felix, et al.
Pubblicazione: (2025)

A parameterized linear formulation of the integer hull
di: Eisenbrand, Friedrich, et al.
Pubblicazione: (2025)

Iterative Optimization of Multidimensional Functions on Turing Machines under Performance Guarantees
di: Boche, Holger, et al.
Pubblicazione: (2025)

On Big-M Reformulations of Bilevel Linear Programs: Hardness of A Posteriori Verification
di: Ketkov, Sergey S., et al.
Pubblicazione: (2026)

Information Redistribution Under Reductions in NP Search
di: Wei, Jing-Yuan
Pubblicazione: (2026)