Searcharxiv⌕ Search

arXiv subjects

Leila J. Bridgeman

Publications and source records attributed to Leila J. Bridgeman.

12 recordsLinked to original sources

Design and Evaluation of a Compliant Quasi Direct Drive End-effector for Safe Robotic Ultrasound Imaging

Robot-assisted ultrasound scanning promises to advance autonomous and accessible medical imaging. However, ensuring patient safety and compliant human-robot interaction during probe contact poses a significant challenge. Most existing systems either have high mechanical stiffness or trade performance for compliance. This paper presents a novel compliant end-effector designed to mount on robotic arms for safe and accurate robotic ultrasound imaging, using a quasi-direct drive actuator to achieve passive mechanical compliance and precise active force control. To evaluate the end-effector's performance, we developed an ex vivo dynamic motion simulator platform for contact and scanning testing on tissue under simulated movements. The end-effector was evaluated against a UR3e robot arm using conventional force control strategies as a baseline. Single-point contact experiments from 2.5 N to 15 N show that the end-effector reduced force tracking RMS error by 80.1% on average. Trajectory scanning experiments at different speeds showed an average of 68.0% reduction in force tracking error. Statistically significant improvements were observed in four of six quantitative image quality and stability metrics using the end-effector. This work presents a novel approach for designing and evaluating compliant end-effectors, with the goal of improving safety and reliability in robotic ultrasound.

cs.RO↗

Consensus-Based Multi-Objective Controller Synthesis

Despite longstanding interest, controller synthesis remains challenging for networks of heterogeneous, nonlinear agents. Moreover, the requirements for computational scalability and information privacy have become increasingly critical. This paper introduces a dissipativity-based distributed controller synthesis framework for networks with heterogeneous agents and diverse performance objectives, leveraging the Network Dissipativity Theorem and iterative convex overbounding. Our approach enables the synthesis of controllers in a distributed way by achieving a network-wide consensus on agents' dissipativity variables while keeping sensitive subsystem information locally. The proposed framework is applied to full-state feedback controller synthesis.

eess.SY↗

Communication-Aware Dissipative Output Feedback Control

Communication-aware control is essential to reduce costs and complexity in large-scale networks. This work proposes a method to design dissipativity-augmented output feedback controllers with reduced online communication. The contributions of this work are three fold: a generalized well-posedness condition for the controller network, a convex relaxation for the constraints that infer stability of a network from dissapativity of its agents, and a synthesis algorithm integrating the Network Dissipativity Theorm, alternating direction method of multipliers, and iterative convex overbounding. The proposed approach yields a sparsely interconnected controller that is both robust and applicable to networks with heterogeneous nonlinear agents. The efficiency of these methods is demonstrated on heterogeneous networks with uncertain and unstable agents, and is compared to standard $\cH_\infty$ control.

eess.SY↗

See, Plan, Cut: MPC-Based Autonomous Volumetric Robotic Laser Surgery with OCT Guidance

Robotic laser systems offer the potential for sub-millimeter, non-contact, high-precision tissue resection, yet existing platforms lack volumetric planning and intraoperative feedback. We present RATS (Robot-Assisted Tissue Surgery), an intelligent opto-mechanical, optical coherence tomography (OCT)-guided robotic platform designed for autonomous volumetric soft tissue resection in surgical applications. RATS integrates macro-scale RGB-D imaging, micro-scale OCT, and a fiber-coupled surgical laser, calibrated through a novel multistage alignment pipeline that achieves OCT-to-laser calibration accuracy of 0.161+-0.031mm on tissue phantoms and ex vivo porcine tissue. A super-Gaussian laser-tissue interaction (LTI) model characterizes ablation crater morphology with an average RMSE of 0.231+-0.121mm, outperforming Gaussian baselines. A sampling-based model predictive control (MPC) framework operates directly on OCT voxel data to generate constraint-aware resection trajectories with closed-loop feedback, achieving 0.842mm RMSE and improving intersection-over-union agreement by 64.8% compared to feedforward execution. With OCT, RATS detects subsurface structures and modifies the planner's objective to preserve them, demonstrating clinical feasibility.

cs.RO↗

Communication-Aware Dissipative Control for Networks of Heterogeneous Nonlinear Agents

Communication-aware control is essential to reduce costs and complexity in large-scale networks. However, it is challenging to simultaneously determine a sparse communication topology and achieve high performance and robustness. This work achieves all three objectives through dissipativity-based, sparsity-promoting controller synthesis. The approach identifies an optimal sparse structure using either weighted l1 penalties or alternating direction methods of multipliers (ADMM) with a cardinality term, and iteratively solves a convexified version of the NP hard structured optimal control problem. The proposed methods are demonstrated on heterogeneous networks with uncertain and unstable agents.

eess.SY↗

Dissipativity and L2 Stability of Large-Scale Networks with Changing Interconnections

In this paper, the L2 stability of switched networks is studied based on the QSR-dissipativity of each agent. While the integration of dissipativity with switched systems has received considerable attention, most previous studies have focused on passivity, internal stability, or feedback networks involving only two agents. This work makes two contributions: first, the relationship between switched QSR-dissipativity and L2 stability is established based on the properties of dissipativity parameters of switched systems; and second, conditions for L2 stability of networks consisting of QSR-dissipative agents with switching interconnection topologies are derived. Crucially, this shows that a common storage function will exist across all modes, avoiding the need to find one, which becomes computationally taxing for large networks with many possible configurations. Numerical examples demonstrate how this can facilitate stability analysis for networked systems under arbitrary switching of swarm drones.

eess.SY↗

Data-driven certificates of constraint enforcement and stability for unmodeled, discrete dynamical systems using tree data structures

This paper addresses the critical challenge of developing data-driven certificates for the stability and safety of unmodeled dynamical systems by leveraging a tree data structure and an upper bound of the system's Lipschitz constant. Previously, an invariant set was synthesized by iteratively expanding an initial invariant set. In contrast, this work iteratively prunes the constraint set to synthesize an invariant set -- eliminating the need for a known, initial invariant set. Furthermore, we provide stability assurances by characterizing the asymptotic stability of the system relative to an invariant approximation of the minimal positive invariant set through synthesis of a discontinuous piecewise affine Lyapunov function over the computed invariant set. The proposed method takes inspiration from subdivision techniques and requires no prior system knowledge beyond Lipschitz continuity.

eess.SY↗

Improved Small-Signal L2 Gain Analysis for Nonlinear Systems

TheL2-gain characterizes a dynamical system's input-output properties, but can be difficult to determine for nonlinear systems. Previous work designed a nonconvex optimization problem to simultaneously search for a continuous piecewise affine (CPA) storage function and an upper bound on the small-signal L2-gain of a dynamical system over a triangulated region about the origin. This work improves upon those results by establishing a tighter upper-bound on a system's gain using a convex optimization problem. By reformulating the relationship between the Hamilton-Jacobi inequality and L2-gain as a linear matrix inequality and then developing novel LMI error bounds for a triangulation, tighter gain bounds are derived and computed more efficiently. Additionally, a combined quadratic and CPA storage function is considered to expand the nonlinear systems this optimization problem is applicable to. Numerical results demonstrate the tighter upper bound on a dynamical system's gain.

math.OC↗

Sampling-Based Model Predictive Control for Volumetric Ablation in Robotic Laser Surgery

Laser-based surgical ablation relies heavily on surgeon involvement, restricting precision to the limits of human error. The interaction between laser and tissue is governed by various laser parameters that control the laser irradiance on the tissue, including the laser power, distance, spot size, orientation, and exposure time. This complex interaction lends itself to robotic automation, allowing the surgeon to focus on high-level tasks, such as choosing the region and method of ablation, while the lower-level ablation plan can be handled autonomously. This paper describes a sampling-based model predictive control (MPC) scheme to plan ablation sequences for arbitrary tissue volumes. Using a steady-state point ablation model to simulate a single laser-tissue interaction, a random search technique explores the reachable state space while preserving sensitive tissue regions. The sampled MPC strategy provides an ablation sequence that accounts for parameter uncertainty without violating constraints, such as avoiding critical nerve bundles or blood vessels.

cs.RO↗

Iterative, Small-Signal L2 Stability Analysis of Nonlinear Constrained Systems

This paper provides a method to analyze the small-signal L2 gain of control-affine nonlinear systems on compact sets via iterative semi-definite programs. First, a continuous piecewise affine storage function and the corresponding upper bound on the L2 gain are found on a bounded, compact set's triangulation. Then, to ensure that the state does not escape this set, a barrier function is found that is robust to small-signal inputs. Small-signal L2 stability then holds inside each sublevel set of the barrier function inside the set where the storage function was found. The bound on the inputs is also found while searching for a barrier function. The method's effectiveness is shown in a numerical example.

eess.SY↗

Dissipative Imitation Learning for Discrete Dynamic Output Feedback Control with Sparse Data Sets

Imitation learning enables the synthesis of controllers for complex objectives and highly uncertain plant models. However, methods to provide stability guarantees to imitation learned controllers often rely on large amounts of data and/or known plant models. In this paper, we explore an input-output (IO) stability approach to dissipative imitation learning, which achieves stability with sparse data sets and with little known about the plant model. A closed-loop stable dynamic output feedback controller is learned using expert data, a coarse IO plant model, and a new constraint to enforce dissipativity on the learned controller. While the learning objective is nonconvex, iterative convex overbounding (ICO) and projected gradient descent (PGD) are explored as methods to successfully learn the controller. This new imitation learning method is applied to two unknown plants and compared to traditionally learned dynamic output feedback controller and neural network controller. With little knowledge of the plant model and a small data set, the dissipativity constrained learned controller achieves closed loop stability and successfully mimics the behavior of the expert controller, while other methods often fail to maintain stability and achieve good performance.

eess.SY↗

Failing with Grace: Learning Neural Network Controllers that are Boundedly Unsafe

In this work, we consider the problem of learning a feed-forward neural network controller to safely steer an arbitrarily shaped planar robot in a compact and obstacle-occluded workspace. Unlike existing methods that depend strongly on the density of data points close to the boundary of the safe state space to train neural network controllers with closed-loop safety guarantees, here we propose an alternative approach that lifts such strong assumptions on the data that are hard to satisfy in practice and instead allows for graceful safety violations, i.e., of a bounded magnitude that can be spatially controlled. To do so, we employ reachability analysis techniques to encapsulate safety constraints in the training process. Specifically, to obtain a computationally efficient over-approximation of the forward reachable set of the closed-loop system, we partition the robot's state space into cells and adaptively subdivide the cells that contain states which may escape the safe set under the trained control law. Then, using the overlap between each cell's forward reachable set and the set of infeasible robot configurations as a measure for safety violations, we introduce appropriate terms into the loss function that penalize this overlap in the training process. As a result, our method can learn a safe vector field for the closed-loop system and, at the same time, provide worst-case bounds on safety violation over the whole configuration space, defined by the overlap between the over-approximation of the forward reachable set of the closed-loop system and the set of unsafe states. Moreover, it can control the tradeoff between computational complexity and tightness of these bounds. Our proposed method is supported by both theoretical results and simulation studies.

eess.SY↗