Searcharxiv⌕ Search

arXiv subjects

Venanzio Cichella

Publications and source records attributed to Venanzio Cichella.

At least 19 recordsLinked to original sources

Robust Decoupled Input Filtering for Internal Model Principle-Based Output Regulation of Polynomial Exogenous Signals

Internal model principle-based controllers regulate polynomial references and disturbances exactly, but only asymptotically, and their transient input can peak and oscillate, increasingly so as the degree of the exogenous signals grows. A filter placed in series with the plant smooths the command but alters the closed-loop spectrum and can destroy stability. We propose an architecture that keeps the filter outside the loop the regulator stabilizes: the internal model is driven by the error of an ideal, unfiltered copy of the plant, the physical plant receives the filtered command, and an auxiliary plant copy absorbs the mismatch between the two inputs. If the filter satisfies blocking conditions at the origin, any gains that stabilize the unfiltered loop can be combined with any such filter without losing regulation of the true error. Under additive plant uncertainty, we derive a small-gain condition that guarantees robust stability and regulation. On a scalar plant, the proposed controller produces a smoother input and a larger input-delay margin than the unfiltered one, and it maintains regulation under a large loss of actuator effectiveness. On a three-mass chain, its tolerance to unmodeled actuator dynamics and delay stays essentially constant as the regulator is made more aggressive.

math.OC↗

Costate Estimation and Covector Mapping for Bernstein Polynomial Direct Methods in Optimal Control

Bernstein polynomial approximation of continuous functions has a slower rate of convergence as compared to other approximation methods. ``The fact seems to have precluded any numerical application of Bernstein polynomials from having been made. Perhaps they will find application when the properties of the approximant in the large are of more importance than the closeness of the approximation.'' -- has remarked P.J. Davis in his 1963 book Interpolation and Approximation. This paper presents a direct approximation method for nonlinear optimal control problems with mixed input and state constraints based on Bernstein polynomial approximation, in which the dynamic and path constraints are imposed at the Bernstein coefficients (control points). We provide a rigorous analysis showing that, under convergence assumptions on the control polygons, the proposed method yields consistent approximations of time continuous optimal control problems and can be used for costate estimation of the optimal control problems. In particular, multipliers satisfying a relaxed Karush Kuhn Tucker system of the resulting nonlinear program, scaled by the quadrature weight, approximate the costate and the multipliers of the optimal control problem. Owing to the structure of the Bernstein differentiation matrix, the discrete transversality conditions are contained in the relaxed Karush Kuhn Tucker system, and no additional closure conditions need to be added to it. This result leads to the formulation of the Covector Mapping Theorem for Bernstein polynomial approximation.

math.OC↗

Continuous-Time Safe Planning and Control for Agile Quadrupeds

Agile quadruped navigation in dynamic environments demands trajectories that are both dynamically feasible and provably collision-free. Most real-time planners achieve tractability through a convex reduction that requires simplified kinematic models, discarding motion that the robot can readily execute, and certify safety only at discretization points, leaving open possible inter-sample collisions with moving obstacles. We present a real-time motion planning framework that retains the fully-actuated $SE(2)$ model of a quadruped, with its anisotropic, heading-coupled velocity bounds, and accepts the resulting nonconvexity. By parameterizing trajectories as composite Bernstein polynomials, we exploit the convex hull property to certify collision avoidance and the input bounds over the entirety of each planning horizon. Solved at online replanning rates, the optimization runs in closed loop, commanding body velocities to the locomotion controller. We validate the approach in simulation against ablations and external baselines, and in hardware experiments on a quadruped navigating among unknown moving obstacles, recovering both lateral and heading-coupled motion that simplified models exclude.

cs.RO↗

Solving Geodesic Equations with Composite Bernstein Polynomials for Trajectory Planning

This work presents a trajectory planning method based on composite Bernstein polynomials for autonomous systems navigating complex environments. The method is implemented in a symbolic optimization framework that enables continuous paths and precise control over trajectory shape. Trajectories are planned over a cost surface that encodes obstacles as continuous fields rather than discrete boundaries. Regions near obstacles are assigned higher costs, naturally encouraging the trajectory to maintain a safe distance while still allowing efficient routing through constrained spaces. The use of composite Bernstein polynomials preserves continuity while enabling fine control over local curvature to satisfy geodesic constraints. The symbolic representation supports exact derivatives, improving optimization efficiency. The method applies to both two- and three-dimensional environments and is suitable for ground, aerial, underwater, and space systems. In spacecraft trajectory planning, for example, it enables the generation of continuous, dynamically feasible trajectories with high numerical efficiency, making it well suited for orbital maneuvers, rendezvous and proximity operations, cluttered gravitational environments, and planetary exploration missions with limited onboard computational resources. Demonstrations show that the approach efficiently generates smooth, collision-free paths in scenarios with multiple obstacles, maintaining clearance without extensive sampling or post-processing. The optimization incorporates three constraint types: (1) a Gaussian surface inequality enforcing minimum obstacle clearance; (2) geodesic equations guiding the path along locally efficient directions on the cost surface; and (3) boundary constraints enforcing fixed start and end conditions. The method can serve as a standalone planner or as an initializer for more complex motion planning problems.

cs.RO↗

Real-Time Optimal Control via Transformer Networks and Bernstein Polynomials

In this paper, we propose a Transformer-based framework for approximating solutions to infinite-dimensional optimization problems: calculus of variations problems and optimal control problems. Our approach leverages offline training on data generated by solving a sample of infinite- dimensional optimization problems using composite Bernstein collocation. Once trained, the Transformer efficiently generates near-optimal, feasible trajectories, making it well-suited for real-time applications. In motion planning for autonomous vehicles, for instance, these trajectories can serve to warm- start optimal motion planners or undergo rigorous evaluation to ensure safety. We demonstrate the effectiveness of this method through numerical results on a classical control problem and an online obstacle avoidance task. This data-driven approach offers a promising solution for real-time optimal control of nonlinear, nonconvex systems.

math.OC↗

Solutions to Differential Algebraic Inequalities with Composite Bernstein Polynomials

The Bernstein polynomial basis sees significant use owing to its unique properties, particularly in the field of optimal control. However, the basis is known to have a slow rate of convergence to the function it approximates. With this in mind, we introduce two collocation methods for solving general ordinary differential equations using composite Bernstein polynomials to preserve the basis properties while improving convergence. Of particular note is the integration based method which uses a minimal number of variables to describe the resulting composite polynomial, reducing computational effort. In addition, we exploit the convex hull property of the Bernstein polynomial basis in order to enforce inequality constraints in differential algebraic inequalities, highlighting the benefits of the basis in function approximation. Solutions to six numerical examples are provided as well as discussion of the advantages and disadvantages of the proposed solution methodologies.

math.OC↗

Coordinated Path Following of UAVs using Event-Triggered Communication over Networks with Digraph Topologies

This article presents a novel time-coordination algorithm based on event-triggered communication to ensure multiple UAVs progress along their desired paths in coordination with one another. In the proposed algorithm, a UAV transmits its progression information to its neighbor UAVs only when a decentralized trigger condition is satisfied. Consequently, it significantly reduces the volume of inter-vehicle communications required to achieve the goal compared with the existing algorithms based on continuous communication. With such intermittent communications, it is shown that a decentralized coordination controller guarantees exponential convergence of the coordination error to a neighborhood of zero. Furthermore, a lower bound on the difference between two consecutive event-triggered times is provided showing that the Zeno behavior is excluded with the proposed algorithm. Lastly, simulation results validate the efficacy of the proposed algorithm.

eess.SY↗

Quasi-Static Continuum Model of Octopus-Like Soft Robot Arm Under Water Actuated by Twisted and Coiled Artificial Muscles (TCAMs)

The current work is a qualitative study that aims to explore the implementation of Twisted and Coiled Artificial Muscles (TCAMs) for actuating and replicating the bending motion of an octopus-like soft robot arm underwater. Additionally, it investigates the impact of hydrostatic and dynamic forces from steady-state fluid flow on the arm's motion. The artificial muscles are lightweight and low-cost actuators that generate a high power-to-weight ratio, producing tensile force up to 12,600 times their own weight, which is close to the functionality of biological muscles. The "extended" Cosserat theory of rods is employed to formulate a quasi-static continuum model of arm motion, where the arm's cross-section is not only capable of rigid rotation but also deforms within its plane. This planar deformation of the arm cross-section aligns with the biological behavior of the octopus arm, where the stiffness of the hydrostat is directly induced by the incompressibility of the tissues. In line with the main goal, a constitutive model is derived for the material of the octopus arm to capture its characteristic behavior.

cs.RO↗

Optimal Control using Composite Bernstein Approximants

In this work, we present composite Bernstein polynomials as a direct collocation method for approximating optimal control problems. An analysis of the convergence properties of composite Bernstein polynomials is provided, and beneficial properties of composite Bernstein polynomials for the solution of optimal control problems are discussed. The efficacy of the proposed approximation method is demonstrated through a bang-bang example. Lastly, we apply this method to a motion planning problem, offering a practical solution that emphasizes the ability of this method to solve complex optimal control problems.

math.OC↗

Scalable Optimal Motion Planning for Multi-Agent Systems by Cosserat Theory of Rods

We address the motion planning problem for large multi-agent systems, utilizing Cosserat rod theory to model the dynamic behavior of vehicle formations. The problem is formulated as an optimal control problem over partial differential equations (PDEs) that describe the system as a continuum. This approach ensures scalability with respect to the number of vehicles, as the problem's complexity remains unaffected by the size of the formation. The numerical discretization of the governing equations and problem's constraints is achieved through Bernstein surface polynomials, facilitating the conversion of the optimal control problem into a nonlinear programming (NLP) problem. This NLP problem is subsequently solved using off-the-shelf optimization software. We present several properties and algorithms related to Bernstein surface polynomials to support the selection of this methodology. Numerical demonstrations underscore the efficacy of this mathematical framework.

math.OC↗

Autopilot System for Depth and Pitch Control in Underwater Vehicles: Navigating Near-Surface Waves and Disturbances

This paper introduces a framework for depth and pitch control of underwater vehicles in near-surface wave conditions. By effectively managing tail, sail plane angles and hover tank operations utilizing a Linear Quadratic Regulator controller and L1 Adaptive Autopilot augmentation, the system ensures balanced control input distribution and significantly attenuates wave disturbances. This development in underwater vehicle control systems offers potential for improved functionality across a range of marine applications. The proposed framework is demonstrated to be robust in a variety of wave conditions, enabling more precise navigation and improved safety in operational scenarios. The effectiveness of this control strategy is validated through extensive simulations using the Joubert BB2 model.

eess.SY↗

On-line Motion Planning Using Bernstein Polynomials for Enhanced Target Localization in Autonomous Vehicles

The use of autonomous vehicles for target localization in modern applications has emphasized their superior efficiency, improved safety, and cost advantages over human-operated methods. For localization tasks, autonomous vehicles can be used to increase efficiency and ensure that the target is localized as quickly and precisely as possible. However, devising a motion planning scheme to achieve these objectives in a computationally efficient manner suitable for real-time implementation is not straightforward. In this paper, we introduce a motion planning solution for enhanced target localization, leveraging Bernstein polynomial basis functions to approximate the probability distribution of the target's trajectory. This allows us to derive estimation performance criteria which are used by the motion planner to enhance the estimator efficacy. To conclude, we present simulation results that validate the effectiveness of the suggested algorithm.

eess.SY↗

Coordinated Path Following of UAVs over Time-Varying Digraphs Connected in an Integral Sense

This paper presents a new connectivity condition on the information flow between UAVs to achieve coordinated path following. The information flow is directional, so that the underlying communication network topology is represented by a time-varying digraph. We assume that this digraph is connected in an integral sense. This is a much more general assumption than the one currently used in the literature. Under this assumption, it is shown that a decentralized coordination controller ensures exponential convergence of the coordination error vector to a neighborhood of zero. The efficacy of the algorithm is confirmed with simulation results.

eess.SY↗

Path Planning for Continuum Rods Using Bernstein Surfaces

This paper presents a method for optimal motion planning of continuum robots by employing Bernstein surfaces to approximate the system's dynamics and impose complex constraints, including collision avoidance. The main contribution is the approximation of infinite-dimensional continuous problems into their discrete counterparts, facilitating their solution using standard optimization solvers. This discretization leverages the unique properties of Bernstein surface, providing a framework that extends previous works which focused on ODEs approximated by Bernstein polynomials. Numerical validations are conducted through several numerical scenarios. The presented methodology offers a promising direction for solving complex optimal control problems in the realm of soft robotics.

cs.RO↗

Bioinspired Soft Robotics: state of the art, challenges, and future directions

Purpose of Review: This review provides an overview of the state of the art in bioinspired soft robotics with by examining advancements in actuation, functionality, modeling, and control. Recent Findings: Recent research into actuation methods, such as artificial muscles, have expanded the functionality and potential use of bioinspired soft robots. Additionally, the application of finite dimensional models has improved computational efficiency for modeling soft continuum systems, and garnered interest as a basis for controller formulation. Summary: Bioinspiration in the field of soft robotics has led to diverse approaches to problems in a range of task spaces. In particular, new capabilities in system simplification, miniaturization, and untethering have each contributed to the field's growth. There is still significant room for improvement in the streamlining of design and manufacturing for these systems, as well as in their control.

cs.RO↗

Modeling, Simulation, and Maneuvering Control of a Generic Submarine

This work introduces two multi-level control strategies to address the problem of guidance and control of underwater vehicles. An outer-loop path-following algorithm and an outer-loop trajectory tracking algorithm are presented. Both outer-loop algorithms provide reference commands that enable the generic submarine to adhere to a three-dimensional path, and both use an inner-loop adaptive controller to determine the required actuation commands. Further, a reduced order model of a generic submarine is presented. Computational fluid dynamics (CFD) results are used to create and validate a model that includes depth dependence and the effect of waves on the craft. %The model and the procedure to obtain its coefficients are discussed, and examples of the data used to obtain the model coefficients are presented. An example of operation following a complex path is presented and Results from the reduced order model for each control strategy are compared.

eess.SY↗

Coordinated Path Following of UAVs using Event-Triggered Communication over Time-Varying Networks with Digraph Topologies

In this article, a novel time-coordination algorithm based on event-triggered communications is proposed to achieve coordinated path-following of UAVs. To be specific, in the approach adopted a UAV transmits its progression information over a time-varying network to its neighbors only when a decentralized trigger condition is satisfied, thereby significantly reducing the volume of inter-vehicle communications required when compared with the existing algorithms based on continuous communications. Using such intermittent communications, it is shown that a decentralized coordination controller guarantees exponential convergence of the coordination error to a neighborhood of zero. Also, a lower bound on the interval between two consecutive event-triggered times is provided showing that the chattering issue does not arise with the proposed algorithm. Finally, simulation results validate the efficacy of the proposed algorithm.

eess.SY↗

Reduced Order Model of a Generic Submarine for Maneuvering Near the Surface

A reduced order model of a generic submarine is presented. Computational fluid dynamics (CFD) results are used to create and validate a model that includes depth dependence and the effect of waves on the craft. The model and the procedure to obtain its coefficients are discussed, and examples of the data used to obtain the model coefficients are presented. An example of operation following a complex path is presented and results from the reduced order model are compared to those from an equivalent CFD calculation. The controller implemented to complete these maneuvers is also presented.

eess.SY↗