SearcharxivSearch

arXiv subjects

John S. Baras

Publications and source records attributed to John S. Baras.

At least 19 recordsLinked to original sources

Risk-Constrained Belief-Space Optimization for Safe Control under Latent Uncertainty

Many safety-critical control systems operate under latent uncertainty that sensors cannot resolve at decision time. Such uncertainty, arising from unknown physical properties, disturbances, or unobserved geometry, affects dynamics, task feasibility, and safety margins. Standard methods optimize expected performance and offer limited protection against rare but severe outcomes, while robust formulations treat uncertainty conservatively without exploiting its probabilistic structure. We consider systems with measured state and an unknown, time-invariant parameter represented by a belief distribution. We propose a risk-sensitive belief-space Model Predictive Path Integral (MPPI) controller that plans under this belief, regularizes performance using Conditional Value-at-Risk (CVaR), and imposes a CVaR constraint on a trajectory safety margin over the horizon. For the exact risk-constrained formulation underlying this controller, we establish three properties: (1) the CVaR constraint implies a probabilistic safety guarantee, (2) the controller recovers the risk-neutral optimum as the objective risk weight tends to zero, and (3) a union-bound argument extends the per-horizon guarantee to cumulative safety over repeated solves. In contact-rich MuJoCo simulations of vision-guided dexterous stowing, where a manipulator inserts a grasped object into an occupied slot with pose uncertainty exceeding prescribed lateral clearance requirements, our method achieves 82% success with zero contact violations at high risk aversion, compared with 55% and 50% for a risk-neutral configuration and a chance-constrained baseline, both of which incur nonzero exterior contact forces. Project page: https://clintonenwerem.com/belief-cvar-mppi/.

eess.SY

Does Imitation Learning Preserve Temporal Robustness in Dexterous Manipulation? An Expert-Learner Comparison Across Task Execution Speeds

Dexterous manipulation policies learned by imitation are typically evaluated for robustness to variation in scenes, objects, or instructions, but their performance across task execution speeds is less often examined. This leaves open how much temporal robustness a learner retains relative to the expert it imitates. We compare an expert and learner under the same task conditions, initial-condition draws, and speedup factors. We instantiate the evaluation in ParcelStow, a contact-rich task in which the robot acquires, reorients, and inserts a parcel. The demonstrations span the speedup range for the manipulation phases after parcel acquisition. A scripted expert and an Action Chunking with Transformers (ACT) policy trained from the expert's demonstrations both achieve 100 percent task success at nominal speed. Their success rates diverge within the demonstrated range: at its maximum, expert success is 84 percent and ACT success is 53 percent. Two ACT policies with different parameter initializations show similar degradation, decreasing by 34 and 48 percentage points from nominal speed to the maximum demonstrated speed, compared with 16 points for the expert. Stage-level analysis shows that 35 of ACT's 47 failures at the maximum demonstrated speed are insertion misalignments. Under the relative-motion handoff, every ACT acquisition retains the parcel through reorientation and transfer in free space, but only 64 percent complete the overall task, compared with 95 percent after expert acquisition. Across all evaluated policies and speeds, none of the 414 acquisitions without force closure completes the task. Equal nominal task success therefore does not imply preservation of expert performance across execution speeds. Code, data, and evaluation scripts are available at https://github.com/coenwerem/parcelstow.

cs.RO

FIRMGrasp: A Friction-Informed Risk Margin for Robust Grasp Synthesis

Classical grasp quality metrics assume one deterministic friction coefficient and therefore cannot assess whether a grasp maintains force closure across plausible friction values. We present FIRMGrasp, a family of grasp quality metrics that incorporates friction uncertainty through Conditional Value-at-Risk (CVaR). At confidence level $β$, we evaluate the force-closure margin at the mean of the adverse friction tail. This evaluation defines the risk-adjusted margin $\varepsilon^{(β)}$, the inscribed-ball radius of the corresponding grasp wrench space. We prove that $\varepsilon^{(β)}$ varies monotonically with $β$, remains differentiable in the grasp parameters, and certifies that any grasp with $\varepsilon^{(β)} > 0$ achieves force closure with probability at least $β$. Across 1,599 LEAP Hand and Allegro Hand grasps, $\varepsilon^{(β)}$ identifies friction-sensitive grasps that receive high nominal Ferrari-Canny scores, and 53% of the nominally force-closed grasps lose closure in the adverse friction tail. The nominal margin ranks a successful grasp above a failed grasp with probabilities of only 0.53 in the shake test and 0.67 in the pick test, whereas $\varepsilon^{(β)}$ achieves 0.63 and 0.78. At an adverse friction coefficient of 0.2, 70% of grasps with positive $\varepsilon^{(β)}$ withstand a simulated lift and lateral pull, compared with 25% of grasps with positive nominal margin and nonpositive $\varepsilon^{(β)}$. We also synthesize grasps with positive $\varepsilon^{(β)}$ for the RealHand L6 and LEAP Hand, both of which retain the object during adverse-friction lifts. In MuJoCo trials with the RealHand L6, 95% of grasps that establish contact and have positive $\varepsilon^{(β)}$ retain the object at the same adverse friction coefficient.

cs.RO

Grasp Execution Without a Planner: Configuration-Space Grasp Distance Fields with Certified Safety & Guaranteed Quality

Mainstream plan-then-track approaches to multifingered grasp execution entail selecting a grasp, planning a collision-free trajectory, and tracking the resulting trajectory via a feedback controller. Pose-estimation error during execution or scene motion can invalidate this open-loop commitment and trigger replanning. We thus present Grasp Distance Fields (GDFs), smooth softmin distances to finite sets of arm-hand grasp configurations. Using their negative gradients as feedback, we jointly select and execute grasps without planning a trajectory. A CBF-CLF quadratic program (QP) enforces self-collision, workspace, object, and obstacle-clearance constraints, while its CLF slack quantifies obstruction of task progress. We bound the softmin approximation error by $\log N/ρ$ and prove forward invariance of the filtered safe set. To handle changes in contact topology, we combine a hysteretic contact-mode transition with a wrench-quality CBF that limits degradation of the realized force-closure margin relative to hold onset. Using our method, a fixed-base manipulator and a Unitree G1 equipped with the same underactuated hand grasp and lift 46 of 50 test objects amid clutter and moving obstacles. The realized grasps also retain a median 94% of their synthesized quality margin, and each QP solve requires 0.09 ms within a 20 ms control interval. Project page: www.clintonenwerem.com/gdf.

cs.RO

Variational Neural Belief Parameterizations for Robust Dexterous Grasping under Multimodal Uncertainty

Contact variability, sensing uncertainty, and external disturbances make grasp execution stochastic. Expected-quality objectives ignore tail outcomes and often select grasps that fail under adverse contact realizations. Risk-sensitive POMDPs address this failure mode, but many use particle-filter beliefs that scale poorly, obstruct gradient-based optimization, and estimate Conditional Value-at-Risk (CVaR) with high-variance approximations. We instead formulate grasp acquisition as variational inference over latent contact parameters and object pose, representing the belief with a differentiable Gaussian mixture. We use Gumbel-Softmax component selection and location-scale reparameterization to express samples as smooth functions of the belief parameters, enabling pathwise gradients through a differentiable CVaR surrogate for direct optimization of tail robustness. In simulation, our variational neural belief improves robust grasp success under contact-parameter uncertainty and exogenous force perturbations while reducing planning time by roughly an order of magnitude relative to particle-filter model-predictive control. On a serial-chain robot arm with a multifingered hand, we validate grasp-and-lift success under object-pose uncertainty against a Gaussian baseline. Both methods succeed on the tested perturbations, but our controller terminates in fewer steps and less wall-clock time while achieving a higher tactile grasp-quality proxy. Our learned belief also calibrates risk more accurately, keeping mean absolute calibration error below 0.14 across tested simulation regimes, compared with 0.58 for a Cross-Entropy Method planner. We provide code, simulation assets, and a dataset of 243 force-closed grasps at the following link: www.github.com/coenwerem/vnb-grasp.

cs.RO

Stability Buys Time: A Re-Keying Game for Encrypted Multi-Agent Control

Encrypted control lets a cloud coordinate a fleet of agents on fully homomorphically encrypted state, keeping their positions and commands private. The approximate scheme for real-valued control, CKKS, returns decryptions that carry the encryption noise, a key-recovery leak; the loop must decrypt to actuate, so the leak is unavoidable. Yet the security of approximate FHE is studied statically, encrypted control assumes an honest-but-curious cloud, and persistent-threat games never reach inside the cryptosystem. We model the loop's security under an advanced persistent threat as a two-phase game, passive reconnaissance then active manipulation, separated by a measured residual detector that sees only the manipulation. The passive phase reduces to the known flooding tradeoff; the active defense is re-keying, not bootstrapping, since only re-keying resets accumulated leakage. The active phase is a detection-evasion timing game: overt manipulation is caught, so the rational adversary stays stealthy, and at its Stackelberg equilibrium the defender re-keys on the laziest cadence that denies it, set by the control-theoretic fragility of the graph topology. The marginally-stable graph must re-key far more often than the well-connected one. A three-way tension among FHE precision, control accuracy, and re-key cadence sets where this game lives, between a securability floor and a static-suffices ceiling. The efficient secure point is that window, where re-keying is the price of precision efficiency. More broadly, security for an approximate cryptosystem in a feedback loop is a dynamic game whose defender's move is the scheme's own refresh, applying beyond control to any system that must repeatedly decrypt to act.

cs.CR

Status Updating via Integrated Sensing and Communication: Freshness Optimisation

In this paper, we study how sensing and communication should be jointly coordinated in integrated sensing and communication (ISAC) systems to maintain timely situational awareness under reliability and resource constraints. We consider an ISAC-enabled base station that supports a remote source by dynamically choosing between sensing new state information and communicating previously acquired information, with the two operations semantically intertwined rather than serving separate targets and users. Both sensing and communication are unreliable and costly. The objective is to optimise a long-term cost that captures information freshness at the source, measured by the age of information (AoI), together with sensing and communication overheads. The resulting sequential decision problem is formulated as an infinite-horizon Markov decision process (MDP) with two-dimensional AoI states that capture information freshness at the source and at the base station. We prove that the optimal stationary policy admits a monotone threshold structure characterised by a nondecreasing switching curve in the AoI state space, and show that, as the base-station information becomes staler, the system increasingly favours sensing over communication. Our numerical analysis corroborates the theoretical findings.

cs.IT

Feedback Control via Integrated Sensing and Communication: Uncertainty Optimisation

This paper studies integrated sensing and communication (ISAC) coordination for feedback control tasks under shared platform constraints. We consider a cyber-physical system in which a remote dynamical process (i.e., remote source) is regulated with the support of an ISAC-enabled base station that alternates between sensing the source state and communicating control-relevant information to the source, with the two operations semantically intertwined rather than serving separate targets and users. For a Gauss-Markov source with Bernoulli-distributed sensing and communication links and a finite-horizon linear-quadratic-Gaussian (LQG) cost, we derive the optimal ISAC and control policies. Under a Bellman-operator condition, we prove that the optimal ISAC policy at the base station follows an order-threshold structure in terms of the source and base-station estimation covariances, while the optimal control policy at the source follows a certainty-equivalent structure in terms of the source state estimate. We show that the threshold region, defined as the set of estimation covariance pairs for which communication is preferred over sensing, expands with increasing source uncertainty and contracts with increasing base-station uncertainty. Our numerical analysis validates the theoretical findings.

cs.IT

EquiDexFlow: Contact-Grounded SE(3)-Equivariant Dexterous Grasp Generative Flows

Most learned dexterous grasp generators relegate contact forces to a downstream verification step, so a kinematically-plausible pose can still violate the conditions for a stable physical grasp. We address this with EquiDexFlow, an SE(3)-equivariant flow-matching model that jointly predicts wrist pose, joint angles, fingertip contacts, surface normals, and contact forces from an object point cloud. Our architecture projects contacts onto the object surface and forces into the Coulomb friction cone by construction, so placement and friction compliance hold without loss penalties. We prove end-to-end SE(3) equivariance and verify it empirically over 200 rotations, with wrist residuals below $0.04^\circ$ and exactly zero joint deviation. Trained on 8,100 force-closure grasps across 81 objects for the 16-DoF Allegro Hand, our model achieves zero friction violations, the best composite score, and the lowest wrench residual among all ablation variants. We retarget decoded fingertip contacts to a 16-DoF LEAP Hand via per-finger inverse kinematics, and our hardware-feasible refinement places every joint at least 5% inside its actuator envelope while preserving wrench balance. On the physical robot, retargeted EquiDexFlow-decoded grasps complete open-loop pick-and-hold trials on all six test objects, with every asymmetric object succeeding at both the canonical pose and a $120^\circ$ co-rotation. Videos, code, and checkpoints are available at https://equidexflow.github.io.

cs.RO

An End-to-End Encrypted Control Pipeline for Multi-Agent Coordination via CKKS Homomorphic Encryption

Cloud-based coordination of multi-agent systems requires sharing state with a central server, creating a conflict between coordination and privacy. Fully homomorphic encryption (FHE) resolves this in principle, but its severe arithmetic constraints demand that every stage of the control loop be redesigned from first principles. We present an end-to-end encrypted control pipeline in which sensing, state estimation, state propagation, and consensus control all operate on CKKS-encrypted data using only addition, multiplication, and cyclic rotation. In order to overcome the computational challenges of FHE, we employ steady-state Kalman gains instead of solving for the matrices online and graph Laplacians are applied via the diagonal method at a cost proportional to the number of nonzero cyclic diagonals, accommodating ring, torus, and complete-graph topologies within a unified framework. To quantify the cumulative effect of encryption noise, we use the separation principle to decouple controller and observer error dynamics and derive a periodic bootstrapping bound in which CKKS bootstrapping acts as an impulsive disturbance; the resulting steady-state error ball depends on the bootstrapping precision and the closed-loop spectral radius, providing a direct design equation for the privacy-accuracy tradeoff. The pipeline is validated on a multi-agent formation control scenario, confirming stable closed-loop operation under encryption with bounded tracking error.

eess.SY

IDDMBSE: Integrating Data-Driven and Model-Based Systems Engineering for Trusted Autonomous Cyber-Physical Systems

Autonomous cyber-physical systems (CPS) sit at the intersection of Model-Based Systems Engineering (MBSE) and data-driven Machine Learning and Artificial Intelligence (ML/AI), yet no integrated Systems Engineering (SE) methodology natively spans both. We address this gap with IDDMBSE, an Integrated Data-Driven and Model-Based Systems Engineering methodology that extends the rigorous MBSE V-process with a data-driven loop at every step, anchored in SysML, the autonomy stack, and a hybrid model-based plus data-driven trade-off architecture. We instantiate IDDMBSE as an interoperable, open-source tool chain: PERFECT, which maps SysML system architectures to executable ROS autonomy stacks for scalable performance evaluation; TRADES-X, which decomposes design-space exploration into a model-based optimization stage followed by a data-driven evaluation stage; and VERITAS, which combines formal, data-driven, and runtime verification into a single assurance workflow. We demonstrate IDDMBSE on a Trusted Autonomous Ground Robot across its development lifecycle, spanning sensor-suite selection, risk-sensitive path planning, behavior-tree task verification, conformal-prediction-based robust perception, and assured multi-robot coordination, all exercised in a contested-terrain Isaac Sim test range that we release with the tool chain. We close by sketching how IDDMBSE is being re-formulated on SysML v2 / KerML foundations to enable language-native composability and tighter ML/AI integration.

cs.RO

On the Stability and Realizability of Recurrent Polynomial Surrogate Ternary Logic Gate Networks

Recurrent Neural Networks (RNNs) can learn to predict Signal Temporal Logic (STL) verdicts online from partial trajectories, but deploying them as runtime monitors in safety-critical systems demands more than predictive accuracy. Standard RNN architectures offer no structural guarantee that outputs degrade gracefully under sensor degradation; a dropped input can silently flip a verdict from safe to unsafe. We introduce the Recurrent Differentiable Ternary Logic Gate Network (R-DTLGN), a recurrent architecture that operates over Kleene's three-valued logic $\{-1, 0, +1\}$, where $0$ explicitly represents unknown. The R-DTLGN trains through continuous polynomial surrogates and hardens to a discrete ternary logic circuit at inference. We analyze the hardened circuit through two gate vocabularies derived from two orderings on the ternary domain: numerically monotone gates ensure stable recurrent dynamics, while information-monotone gates, when present, guarantee principled abstention (unknown inputs never produce wrong outputs) and monotonicity in input certainty (more information can only improve the verdict). We show that the recurrent connections required by bounded STL operators use exclusively AND and OR, which belong to both vocabularies, linking the monitoring task to the architecture's guarantees. A realizability bound derived from the STL formula's temporal operators directly sizes the network's hidden state, replacing hyperparameter search with a formula-driven specification. We evaluate on STL specifications over D4RL PointMaze navigation data, testing prediction accuracy, degradation under predicate dropout, and the accuracy-versus-safety tradeoff between two label construction pipelines. The R-DTLGN is, to our knowledge, the first recurrent architecture that couples learned temporal prediction with formal degradation guarantees rooted in three-valued logic.

cs.LG

Ternary Logic Encodings of Temporal Behavior Trees with Application to Control Synthesis

Behavior Trees (BTs) provide designers an intuitive graphical interface to construct long-horizon plans for autonomous systems. To ensure their correctness and safety, rigorous formal models and verification techniques are essential. Temporal BTs (TBTs) offer a promising approach by leveraging existing temporal logic formalisms to specify and verify the executions of BTs. However, this analysis is currently limited to offline post hoc analysis and trace repair. In this paper, we reformulate TBTs using a ternary-valued Signal Temporal Logic (STL) amenable for control synthesis. Ternary logic introduces a third truth value \textit{Unknown}, formally capturing cases where a trajectory has neither fully satisfied or dissatisfied a specification. We propose mixed-integer linear encodings for partial trajectory STL and TBTs over ternary logic allowing for correct-by-construction control strategies for linear dynamical systems via mixed-integer optimization. We demonstrate the utility of our framework by solving optimal control problems.

cs.RO

Learning from Imperfect Demonstrations via Temporal Behavior Tree-Guided Trajectory Repair

Learning robot control policies from demonstrations is a powerful paradigm, yet real-world data is often suboptimal, noisy, or otherwise imperfect, posing significant challenges for imitation and reinforcement learning. In this work, we present a formal framework that leverages Temporal Behavior Trees (TBT), an extension of Signal Temporal Logic (STL) with Behavior Tree semantics, to repair suboptimal trajectories prior to their use in downstream policy learning. Given demonstrations that violate a TBT specification, a model-based repair algorithm corrects trajectory segments to satisfy the formal constraints, yielding a dataset that is both logically consistent and interpretable. The repaired trajectories are then used to extract potential functions that shape the reward signal for reinforcement learning, guiding the agent toward task-consistent regions of the state space without requiring knowledge of the agent's kinematic model. We demonstrate the effectiveness of this framework on discrete grid-world navigation and continuous single and multi-agent reach-avoid tasks, highlighting its potential for data-efficient robot learning in settings where high-quality demonstrations cannot be assumed.

cs.LG

Polynomial Surrogate Training for Differentiable Ternary Logic Gate Networks

Differentiable logic gate networks (DLGNs) learn compact, interpretable Boolean circuits via gradient-based training, but all existing variants are restricted to the 16 two-input binary gates. Extending DLGNs to Ternary Kleene $K_3$ logic and training DTLGNs where the UNKNOWN state enables principled abstention under uncertainty is desirable. However, the support set of potential gates per neuron explodes to $19{,}683$, making the established softmax-over-gates training approach intractable. We introduce Polynomial Surrogate Training (PST), which represents each ternary neuron as a degree-$(2,2)$ polynomial with 9 learnable coefficients (a $2{,}187\times$ parameter reduction) and prove that the gap between the trained network and its discretized logic circuit is bounded by a data-independent commitment loss that vanishes at convergence. Scaling experiments from 48K to 512K neurons on CIFAR-10 demonstrate that this hardening gap contracts with overparameterization. Ternary networks train $2$-$3\times$ faster than binary DLGNs and discover true ternary gates that are functionally diverse. On synthetic and tabular tasks we find that the UNKNOWN output acts as a Bayes-optimal uncertainty proxy, enabling selective prediction in which ternary circuits surpass binary accuracy once low-confidence predictions are filtered. More broadly, PST establishes a general polynomial-surrogate methodology whose parameterization cost grows only quadratically with logic valence, opening the door to many-valued differentiable logic.

cs.LG

Remote State Estimation over Unreliable Channels with Unreliable Feedback: Strategies and Limits

In this article, we establish a comprehensive theoretical framework for remote estimation in a networked system composed of a source that is observed by a sensor, a remote monitor that needs to estimate the state of the source in real time, and a communication channel that connects the source to the monitor. The source is a partially observable dynamical process, and the communication channel is a packet-erasure channel with feedback. We consider a novel communication model that captures implicit information. Our main objective is to identify the optimal strategies and the fundamental performance limits of the underlying system in the sense of a causal tradeoff between the packet rate and the mean square error when both forward and backward channels are unreliable. We characterise an optimal coding policy profile consisting of a scheduling policy for an encoder and an estimation policy for a decoder, collocated with the source and the monitor, respectively. We derive the recursive equations that must be solved online by the encoder and the decoder. In addition, we prove that the value function, originally defined over an expanding information set, admits a lower-dimensional representation depending only on two variables. We discuss the structural properties of the optimal policies, and analyse the computational complexity of an algorithm proposed for their computation. We then examine a range of special cases derived from our main theoretical results. We complement the theoretical results with a numerical analysis, and compare the performance of different remote estimation tasks in various operating regimes.

cs.IT

Safety-Aware Reinforcement Learning for Control via Risk-Sensitive Action-Value Iteration and Quantile Regression

Mainstream approximate action-value iteration reinforcement learning (RL) algorithms suffer from overestimation bias, leading to suboptimal policies in high-variance stochastic environments. Quantile-based action-value iteration methods reduce this bias by learning a distribution of the expected cost-to-go using quantile regression. However, ensuring that the learned policy satisfies safety constraints remains a challenge when these constraints are not explicitly integrated into the RL framework. Existing methods often require complex neural architectures or manual tradeoffs due to combined cost functions. To address this, we propose a risk-regularized quantile-based algorithm integrating Conditional Value-at-Risk (CVaR) to enforce safety without complex architectures. We also provide theoretical guarantees on the contraction properties of the risk-sensitive distributional Bellman operator in Wasserstein space, ensuring convergence to a unique cost distribution. Simulations of a mobile robot in a dynamic reach-avoid task show that our approach leads to more goal successes, fewer collisions, and better safety-performance trade-offs than risk-neutral methods.

cs.LG

Cooperative Hypothesis Testing by Two Observers with Asymmetric Information

We consider the binary hypothesis testing problem with two observers. There are two possible states of nature (or hypotheses). Observations collected by the two observers are statistically related to the true state of nature. The knowledge of joint distribution of the observations collected and the true state of nature is unknown to the observers. There are two problems to be solved by the observers: (i) true state of nature is known: find the distribution of the local information collected; (ii) true state of nature is unknown: collaboratively estimate the same using the distributions found by solving the first problem. We present four algorithms, each having two phases where the two problems are solved, with emphasis on the information exchange between the observers and resulting patterns. We prove different properties of the algorithms including the following: the probability spaces constructed as a consequence of solving the first problem are dependent on the information patterns at the observers; (ii) the rate of decay of probability of error of algorithms while solving the second problem is dependent on the information exchange between the observers. We present a numerical example demonstrating the four algorithms.

eess.SY