Imagen de Portada

Which Sensor to Observe? Timely Tracking of a Joint Markov Source with Model Predictive Control

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cosandal, Ismail, Ulukus, Sennur, Akar, Nail
Formato:	Preprint
Publicado:	2025
Materias:	Information Theory Networking and Internet Architecture Systems and Control Signal Processing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Modeling AoII in Push- and Pull-Based Sampling of Continuous Time Markov Chains
por: Cosandal, Ismail, et al.
Publicado: (2024)

Multi-Threshold AoII-Optimum Sampling Policies for CTMC Information Sources
por: Cosandal, Ismail, et al.
Publicado: (2024)

Joint Age-State Belief is All You Need: Minimizing AoII via Pull-Based Remote Estimation
por: Cosandal, Ismail, et al.
Publicado: (2024)

How Far Back in Time a Digital Twin Reflects the State of the Physical Object: Age of Staleness
por: Cosandal, Ismail, et al.
Publicado: (2026)

Semi-Markov Decision Process Framework for Age of Incorrect Information Minimization
por: Cosandal, Ismail, et al.
Publicado: (2025)

AoII-Optimum Sampling of CTMC Information Sources Under Sampling Rate Constraints
por: Cosandal, Ismail, et al.
Publicado: (2024)

Minimizing the Age of Two Heterogeneous Sources With Packet Drops Via Cyclic Schedulers
por: Liyanaarachchi, Sahan, et al.
Publicado: (2024)

Scheduling Policies in a Multi-Source Status Update System with Dedicated and Shared Servers
por: Liyanaarachchi, Sahan, et al.
Publicado: (2024)

Age of Gossip in Networks with Multiple Views of a Source
por: Khojastepour, Kian J., et al.
Publicado: (2024)

Preemption Revisited: Multi-Threshold Preemption Policies for AoI Minimization
por: Liyanaarachchi, Sahan, et al.
Publicado: (2026)

Cyclic Scheduler Design for Minimizing Age of Information in Massive Scale Networks Susceptible to Packet Errors
por: Liyanaarachchi, Sahan, et al.
Publicado: (2024)

Age of Job Completion Minimization with Stable Queues
por: Mitrolaris, Stavros, et al.
Publicado: (2025)

Tracking and Assigning Jobs to a Markov Machine
por: Banerjee, Subhankar, et al.
Publicado: (2025)

Age of Information in a Single-Source Generate-at-Will Dual-Server Status Update System
por: Akar, Nail, et al.
Publicado: (2024)

When to Preempt in a Status Update System?
por: Banerjee, Subhankar, et al.
Publicado: (2024)

Source Coding for a Wiener Process
por: Liyanaarachchi, Sahan, et al.
Publicado: (2025)

How to Maximize Efficiency in Systems with Exhausted Workers
por: Sariisik, Elif Beray, et al.
Publicado: (2025)

Scale-Robust Timely Asynchronous Decentralized Learning
por: Mitra, Purbesh, et al.
Publicado: (2024)

Optimal Source Coding of Markov Chains for Real-Time Remote Estimation
por: Cosandal, Ismail, et al.
Publicado: (2025)

Query-Based Sampling of Heterogeneous CTMCs: Modeling and Optimization with Binary Freshness
por: Akar, Nail, et al.
Publicado: (2023)

Network Connectivity--Information Freshness Tradeoff in Information Dissemination Over Networks
por: Srivastava, Arunabh, et al.
Publicado: (2024)

Age of Gossip With Time-Varying Topologies
por: Srivastava, Arunabh, et al.
Publicado: (2024)

Modeling Interfering Sources in Shared Queues for Timely Computations in Edge Computing Systems
por: Akar, Nail, et al.
Publicado: (2024)

Structured Estimators: A New Perspective on Information Freshness
por: Liyanaarachchi, Sahan, et al.
Publicado: (2025)

HetDAPAC: Distributed Attribute-Based Private Access Control with Heterogeneous Attributes
por: Meel, Shreya, et al.
Publicado: (2024)

Age of Gossip With Cellular Drone Mobility
por: Srivastava, Arunabh, et al.
Publicado: (2026)

Age of Gossip in Ring Networks With Non-Poisson Updates
por: Srivastava, Arunabh, et al.
Publicado: (2026)

Optimizing Profitability in Timely Gossip Networks
por: Kaswan, Priyanka, et al.
Publicado: (2024)

Age of Gossip with the Push-Pull Protocol
por: Srivastava, Arunabh, et al.
Publicado: (2024)

Scalable Cyclic Schedulers for Age of Information Optimization in Large-Scale Status Update Systems
por: Akar, Nail, et al.
Publicado: (2024)

Preemptive Scheduling for Age of Job Minimization in Task-Specific Machine Networks
por: Banerjee, Subhankar, et al.
Publicado: (2026)

Equidistant-Sample or Wait-and-Sample to Minimize Age Under Sampling Constraint?
por: Banerjee, Subhankar, et al.
Publicado: (2025)

Minimizing Age of Information with Generate at Will Status Updates and Age-Agnostic Cyclic Scheduling
por: Gamgam, Ege Orkun, et al.
Publicado: (2023)

The Role of Common Randomness Replication in Symmetric PIR on Graph-Based Replicated Systems
por: Meel, Shreya, et al.
Publicado: (2026)

On the Capacity Region of Individual Key Rates in Vector Linear Secure Aggregation
por: Hu, Lei, et al.
Publicado: (2026)

Storage-Rate Trade-off in A-XPIR
por: Nomeir, Mohamed, et al.
Publicado: (2026)

Information Freshness in Dynamic Gossip Networks
por: Srivastava, Arunabh, et al.
Publicado: (2025)

How to Make Money From Fresh Data: Subscription Strategies in Age-Based Systems
por: Kaswan, Priyanka, et al.
Publicado: (2024)

Symmetric Private Information Retrieval (SPIR) on Graph-Based Replicated Systems
por: Meel, Shreya, et al.
Publicado: (2025)

Index-Based Scheduling for a Resource-Constrained Quantum Switch
por: Banerjee, Subhankar, et al.
Publicado: (2026)