Adrian Zvizdenco, Arthur Conrado Veiga Bosquetti, Alberto Lluch Lafuente, Christoph Matheja
Deciding which sensing capabilities to deploy on an agent in uncertain domains is a fundamental engineering challenge, in which one balances task achievability against the high costs of hardware and processing. This problem has previously been formalized as the Optimal Observability Problem (OOP), based on the well-known Partially Observable Markov Decision Process (POMDP) model for decision-making. This work studies (sub-)symbolic techniques to scale solving of decidable fragments of the OOP, namely the Sensor Selection Problem (SSP) and the Positional Observability Problem (POP). Besides improving the original approach based on parameter synthesis, we develop a new solving method that identifies sensible observation functions via decomposition of POMDPs, improving performance by 3 and 5 orders of magnitude for instance size and runtime, respectively.
This paper tackles the computational scalability of the Optimal Observability Problem (OOP) for POMDPs—the question of how to optimally assign sensing capabilities (observation functions) to an agent operating under uncertainty, subject to budget constraints. Building on the formalization by Konsta et al. (2024), which reduced decidable OOP fragments to parameter synthesis for typed parametric Markov chains (tpMCs) solved via SMT, this work offers two main contributions:
1. Improved SMT encodings: Native Boolean variable encoding, Bellman inequality relaxations, and pseudo-Boolean cardinality constraints that collectively yield ~10³× faster solving and ~75× larger solvable instances compared to the original approach.
2. A decomposition-based algorithm (A_G): A heuristic enumeration method that decomposes the OOP into individual POMDP evaluations by partitioning states into "atomic distinguishability groups" based on optimal action equivalence. This achieves an additional ~10³× speedup and ~10²× instance size increase beyond the SMT improvements.
The paper is methodologically structured but has notable limitations in rigor:
The problem addressed—optimal sensor placement under budget constraints—has clear practical relevance in robotics, autonomous systems, security, and cyber-physical systems. Cost-effective sensor deployment is a genuine engineering concern.
However, the practical impact is tempered by several factors:
The decomposition paradigm—separating observation function search from POMDP evaluation—is a conceptually valuable architectural insight that could inspire follow-up work beyond the specific algorithms proposed.
The paper addresses a timely topic at the intersection of AI planning, formal verification, and system design. As autonomous systems proliferate, principled methods for sensor budget optimization become increasingly relevant. The work builds directly on a 2024 CAV paper, making it a timely follow-up. The connection to ETR-complete problems and SMT solving places it within active research communities.
However, the field of POMDP solving has been advancing rapidly with deep learning and Monte Carlo methods, which this paper does not engage with substantially. The formal verification perspective is valuable but represents a niche within the broader POMDP community.
The paper's contribution is primarily engineering-oriented rather than foundational. The theoretical insight (atomic distinguishability groups) is relatively straightforward given the observation that states with identical optimal action sets can be grouped. The main value lies in demonstrating that this simple idea, combined with careful SMT encoding, yields dramatic practical improvements. The work would benefit from evaluation on more diverse and realistic problem instances to establish broader applicability.
Generated May 22, 2026
Paper 2 addresses a highly timely and critical challenge: safety monitoring for emerging Diffusion LLMs. By leveraging the unique multi-step denoising process to identify 'safety hesitation,' it introduces a novel and efficient dynamic routing mechanism for content moderation. Given the massive real-world implications of LLM safety and the rapid growth of generative AI, this work offers broader immediate applications and cross-disciplinary relevance compared to Paper 1. While Paper 1 demonstrates impressive algorithmic scaling for POMDPs, Paper 2's focus on AI safety alignment provides a higher potential for widespread societal and scientific impact.
Paper 2 introduces a novel framework (LLMSurvival) that bridges two major fields—LLMs and survival analysis—addressing a fundamental limitation (censoring) that has prevented LLM adoption in time-to-event prediction. It has broad real-world clinical applications, demonstrated on real patient cohorts, and opens a new research direction at the intersection of foundation models and medical statistics. Paper 1, while technically strong with impressive scalability improvements, addresses a narrower problem (sensor selection in POMDPs) with more limited cross-disciplinary appeal and real-world applicability.
Paper 2 has higher estimated impact due to broader applicability and timeliness: a unified neural framework for both symmetric/asymmetric VRPs targets a widely used optimization family with immediate logistics/transport relevance. It proposes a novel representation (pivot-based coordinate-free embedding) plus decoding changes and is validated across 110 variants with zero-shot generalization, suggesting robustness and cross-domain utility within routing/ML/OR. Paper 1 offers strong rigor and large scaling gains for OOP/POMDP sensor selection, but the scope is more specialized and likely impacts a narrower community despite significant methodological advances.
Paper 1 offers a profound methodological breakthrough in fundamental AI planning, achieving a 3 to 5 orders of magnitude improvement in instance size and runtime for solving POMDPs. This massive algorithmic leap has broad, cross-disciplinary implications for robotics, operations research, and decision-making under uncertainty. While Paper 2 provides a strong, timely application for 6G and UAV tracking, Paper 1's fundamental theoretical advancement and extraordinary performance gains suggest a deeper, more enduring scientific impact across multiple fields.
Paper 1 offers a massive fundamental improvement (3 to 5 orders of magnitude in instance size and runtime) for solving Partially Observable Markov Decision Processes (POMDPs). Because POMDPs are a foundational model for decision-making under uncertainty, these algorithmic advances have broad applicability across AI, robotics, and operations research. While Paper 2 presents a valuable and practical multimodal framework for UAV sensing, its contributions are more domain-specific compared to the foundational and broadly applicable theoretical advances in Paper 1.
Paper 2 demonstrates dramatic computational improvements (3-5 orders of magnitude) for a well-formalized problem (OOP/POMDP), with clear practical implications for sensor deployment in robotics and autonomous systems. Its methodological contribution—decomposition-based solving of POMDPs—has broad applicability across planning, robotics, and decision-making under uncertainty. Paper 1 combines causality with argumentation for XAI, which is novel but incremental, demonstrated only on two benchmarks, and competes in an already crowded XAI landscape without clearly establishing superiority over existing methods.
Paper 1 addresses a fundamental problem in AI planning under uncertainty with rigorous formal methods, achieving dramatic scalability improvements (3-5 orders of magnitude) for well-established formalisms (POMDPs). Its contributions are methodologically rigorous, broadly applicable across robotics, autonomous systems, and decision-making under uncertainty. Paper 2, while timely, evaluates specific LLM providers on a single game (Risk) with results that will quickly become outdated as models evolve. Its findings are narrower, more empirical/observational, and lack the lasting theoretical contribution and cross-domain applicability of Paper 1.
Paper 1 likely has higher impact due to timeliness and breadth: it targets the rapidly expanding LLM-agent ecosystem and provides a benchmark suite plus reference multi-agent implementation spanning retrieval, simulation, HPC orchestration, and manufacturing control. Benchmarks and tooling can become community infrastructure with broad cross-domain adoption. The methodology includes gated RAG evaluation and varied prompt/agent workflow tests, supporting rigorous comparisons across models. Paper 2 offers strong algorithmic advances for OOP/POMDP fragments with large performance gains, but the niche scope and narrower applicability may limit overall impact despite higher theoretical rigor.
Paper 1 proposes an end-to-end AI agent harness for complex data visualization, directly contributing to the highly relevant 'AI Scientist' paradigm. Its ability to autonomously generate customized visual analysis apps from high-level descriptions offers massive cross-disciplinary applicability across virtually all scientific fields dealing with complex data. While Paper 2 presents impressive methodological improvements in POMDP solving with huge performance gains, its impact is primarily confined to robotics and formal planning. Paper 1's broader real-world utility, cross-domain relevance, and alignment with cutting-edge autonomous AI research give it higher potential scientific impact.
Paper 2 addresses a fundamental theoretical problem (optimal observability in POMDPs) with rigorous methodological contributions, achieving 3-5 orders of magnitude improvements in scalability. It advances well-established formal frameworks with broad applicability across robotics, autonomous systems, and AI planning. Paper 1, while practically useful, describes an engineering platform for autonomous research whose evaluation relies on internal benchmarks and subjective expert judging, limiting its scientific rigor and generalizability. Paper 2's formal contributions are more likely to have lasting impact across multiple research communities.