{"total":19,"items":[{"citing_arxiv_id":"2606.24632","ref_index":28,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Parallel Dynamic Programming for Conic Linear Quadratic Control","primary_cat":"math.OC","submitted_at":"2026-06-23T14:26:38+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Parallel dynamic programming variant of Riccati recursion inside ADMM enables up to 5x speedup for conic LQ control problems on multi-core CPUs.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.23760","ref_index":76,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Engineering Reliable Autonomous Systems: Challenges and Solutions","primary_cat":"cs.RO","submitted_at":"2026-06-22T10:04:37+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":2.0,"formal_verification":"none","one_line_summary":"A workshop report catalogues challenges and solution pathways for verification, engineering, and architecting reliable autonomous systems.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.11049","ref_index":36,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Free Parametrization of L_2-Bounded Structured State-Space Controllers for Nonlinear Control with Stability Guarantees","primary_cat":"eess.SY","submitted_at":"2026-06-09T16:14:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A new free parametrization of L2-bounded LTI systems creates L2RU SSM layers that enforce stability by design, allowing unconstrained nonlinear controller optimization with guarantees via small-gain theorem.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.09047","ref_index":10,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Families of Control-Cost-Parametrized Inverse-Optimal Universal Stabilizers","primary_cat":"eess.SY","submitted_at":"2026-06-08T05:34:31+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A nonlinear operator maps user-chosen control costs to families of inverse-optimal universal stabilizers with proven Lipschitz continuity and semiglobal practical stability under approximation.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.06896","ref_index":44,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Successive Convexification for Trajectory Optimization with Continuous-time Satisfaction of Signal Temporal Logic Specifications","primary_cat":"math.OC","submitted_at":"2026-06-05T04:28:31+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Presents a successive convexification framework that enforces continuous-time STL specifications in trajectory optimization via GMSR robustness and prox-convex solving.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.06153","ref_index":1,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Structure-Preserving Operator Splitting via JR-Decomposition for Circuit Models","primary_cat":"math.NA","submitted_at":"2026-06-04T13:28:48+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"An enhanced JR-decomposition is proposed to relax standard restrictions and enable energy-conforming splitting for port-Hamiltonian MNA circuit models, illustrated by a numerical example.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2606.04872","ref_index":148,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Consistent Distributed Cooperative Localization for Ultra Large-Scale Multi-agent Systems","primary_cat":"eess.SY","submitted_at":"2026-06-03T13:36:53+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A new cooperative localization algorithm based on overlapping covariance intersection is fully distributed, provably recursively consistent, and scalable to ultra large-scale multi-agent systems without performance loss from ignored cross-correlations.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.20457","ref_index":22,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"The Structure and Dynamics of the Online MAHA-sphere","primary_cat":"cs.SI","submitted_at":"2026-05-19T20:10:50+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Reddit analysis finds MAHA users show strong cross-theme belief bundling and network coherence unlike anti-MAHA users, with pandemic-era shifts from anti-fluoride/mask to anti-vaccine to broader anti-science engagement.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.19009","ref_index":14,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Adversarial Stress Testing of SPARK Humanoid Safety Filters","primary_cat":"cs.RO","submitted_at":"2026-05-18T18:32:45+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":4.0,"formal_verification":"none","one_line_summary":"Replicates SPARK humanoid safety filters and stress-tests them under crowding, noise, and delays, showing trade-offs in goal tracking versus collision reduction.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.17487","ref_index":12,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Port-Hamiltonian Control and Structure-Preserving Algorithm for Grid-Forming SVGs","primary_cat":"math.OC","submitted_at":"2026-05-17T14:56:22+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A port-Hamiltonian modeling, ISS control, and energy-conserving simulation framework for grid-forming SVGs that outperforms PI control and standard integrators in numerical tests.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2605.11210","ref_index":32,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Distributed Pose Graph Optimization via Continuous Riemannian Dynamics","primary_cat":"cs.RO","submitted_at":"2026-05-11T20:24:16+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Pose graph optimization is recast as damped Riemannian dynamics on Lie groups, enabling a fully distributed algorithm with a semi-implicit integrator that converges under both synchronous and asynchronous communication.","context_count":1,"top_context_role":"background","top_context_polarity":"background","context_text":"setting and show that symplectic integration [29] is essential for preserving acceleration when passing from continuous to discrete time. Parallel efforts [30, 31] study the continuous- time dynamics perspective for optimization over Riemannian manifolds. In robotics, [32-37] study the related problem of point cloud registration from the dynamical system perspective. Golyanik et al. [32] formulate registration as a damped N- body dynamical system, where template points evolve under gravitational forces induced by the reference points. This approach is extended in [34] that introduces a nonlinear least squares optimization over an altered potential and uses Barnes-Hut tree to accelerate point interaction. Yang et al. [37] generalizes [32-34] and models a broader range of pose"},{"citing_arxiv_id":"2605.09545","ref_index":2,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Diagnostic Certificates of Data Quality and Regression Identifiability for Koopman Identification","primary_cat":"math.OC","submitted_at":"2026-05-10T14:01:05+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"The paper introduces diagnostic certificates that separately assess state-space coverage, lifted-feature nondegeneracy, and regression-spectrum quality for Koopman and EDMDc identification, with theoretical guarantees on the smallest singular value under a population spectral gap.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2603.28965","ref_index":28,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Koopman Operator Framework for Modeling and Control of Off-Road Vehicle on Deformable Terrain","primary_cat":"eess.SY","submitted_at":"2026-03-30T20:11:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Koopman operators identified from Bekker-Wong terramechanics simulations enable short-horizon prediction and constrained MPC for stable tracking of aggressive maneuvers by off-road vehicles on deformable terrain.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2602.02394","ref_index":15,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"On the Practical Implementation of a Sequential Quadratic Programming Algorithm for Nonconvex Sum-of-squares Problems","primary_cat":"math.OC","submitted_at":"2026-02-02T17:56:01+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"A filter line search SQP algorithm reduces iterations and computation time for nonconvex SOS programs compared to prior methods.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.19408","ref_index":76,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Mixed formulation and structure-preserving discretization of Cosserat rod dynamics in a port-Hamiltonian framework","primary_cat":"math.NA","submitted_at":"2025-12-22T14:04:03+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"A mixed formulation for Cosserat rod dynamics is cast as an infinite-dimensional nonlinear port-Hamiltonian system and discretized with structure-preserving finite elements to yield energy-momentum consistent time integration.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2512.17637","ref_index":22,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"About Time: Model-free Reinforcement Learning with Timed Reward Machines","primary_cat":"cs.AI","submitted_at":"2025-12-19T14:39:03+00:00","verdict":"CONDITIONAL","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"Timed reward machines extend reward machines with timing constraints, allowing model-free RL algorithms to learn policies that satisfy precise temporal requirements on standard benchmarks.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2508.13677","ref_index":39,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Non-linear stochastic trajectory optimisation","primary_cat":"math.OC","submitted_at":"2025-08-19T09:27:23+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":7.0,"formal_verification":"none","one_line_summary":"SODA uses differential algebra and adaptive Gaussian mixtures to solve chance-constrained nonlinear trajectory optimization problems for space missions with non-Gaussian uncertainties.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2502.15949","ref_index":27,"ref_count":1,"confidence":0.9,"is_internal_anchor":false,"paper_title":"Chance constraints transcription and failure risk estimation for stochastic trajectory optimisation","primary_cat":"math.OC","submitted_at":"2025-02-21T21:26:08+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":6.0,"formal_verification":"none","one_line_summary":"Two general-purpose methods transcribe multi-dimensional Gaussian chance constraints for trajectory optimization with reduced conservatism, paired with a quadratic-complexity risk estimator that remains accurate in high dimensions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null},{"citing_arxiv_id":"2005.06674","ref_index":19,"ref_count":2,"confidence":0.9,"is_internal_anchor":false,"paper_title":"On the Convergence of Overlapping Schwarz Decomposition for Nonlinear Optimal Control","primary_cat":"math.OC","submitted_at":"2020-05-14T00:19:28+00:00","verdict":"UNVERDICTED","verdict_confidence":"LOW","novelty_score":5.0,"formal_verification":"none","one_line_summary":"Overlapping Schwarz decomposition for nonlinear OCPs achieves local linear convergence with rate improving exponentially with overlap size, based on exponential decay of sensitivity for primal and dual solutions.","context_count":0,"top_context_role":null,"top_context_polarity":null,"context_text":null}],"limit":50,"offset":0}