SearcharxivSearch

arXiv subjects

Andrea Garulli

Publications and source records attributed to Andrea Garulli.

At least 19 recordsLinked to original sources

Learning Social Robot Navigation By Sensing Human Legs

Robots navigating among pedestrians typically sense their surroundings with a 2D LiDAR mounted close to the ground. At that height, the sensor mostly sees moving legs rather than whole people, yet most learning-based navigation methods still treat pedestrians as simple shapes like circles. This paper addresses that gap with CALF (Convolutional Attention for Leg Features), an end-to-end neural architecture that combines convolutional layers, attention, and MLP to interpret leg motion directly from LiDAR scans and produce safe navigation commands. The CALF policy is trained using deep reinforcement learning algorithms within LegNav, a custom lightweight 2D simulator that combines 2D LiDAR ray tracing with a novel pedestrian gait model. The resulting policy is compared against classical and learning-based baselines in terms of navigation performance and social compliance. The approach is validated through real-world experiments via zero-shot deployment on a TurtleBot 4, yielding smooth and socially compliant trajectories. Written in JAX, the LegNav simulator enables the training of a deployment-ready CALF policy in under an hour on a single consumer GPU.

cs.RO

Data-Driven Robust Predictive Control with Interval Matrix Uncertainty Propagation

This paper presents a new data-driven robust predictive control law, for linear systems affected by unknown-but-bounded process disturbances. A sequence of input-state data is used to construct a suitable uncertainty representation based on interval matrices. Then, the effect of uncertainty along the prediction horizon is bounded through an operator leveraging matrix zonotopes. This yields a tube that is exploited within a variable-horizon optimal control problem, to guarantee robust satisfaction of state and input constraints. The resulting data-driven predictive control scheme is proven to be recursively feasible and practically stable. A numerical example shows that the proposed approach compares favorably to existing methods based on zonotopic tubes.

eess.SY

Robust Model Predictive Control for Linear Systems with Interval Matrix Model Uncertainty

This paper proposes a novel robust Model Predictive Control (MPC) scheme for linear discrete-time systems affected by model uncertainty described by interval matrices. The key feature of the proposed method is a bound on the uncertainty propagation along the prediction horizon which exploits a set-theoretic over-approximation of each term of the uncertain system impulse response. Such an approximation is based on matrix zonotopes and leverages the interval matrix structure of the uncertainty model. Its main advantage is that all the relevant bounds are computed offline, thus making the online computational load independent of the number of uncertain parameters. A variable-horizon MPC formulation is adopted to guarantee recursive feasibility and to ensure robust asymptotic stability of the closed-loop system. Numerical simulations demonstrate that the proposed approach is able to match the feasibility regions of the most effective state-of-the-art methods, while significantly reducing the computational burden, thereby enabling the treatment of nontrivial dimensional systems with multiple uncertain parameters.

eess.SY

Time-Optimal Model Predictive Control for Linear Systems with Multiplicative Uncertainties

This paper presents a time-optimal Model Predictive Control (MPC) scheme for linear discrete-time systems subject to multiplicative uncertainties represented by interval matrices. To render the uncertainty propagation computationally tractable, the set-valued error system dynamics are approximated using a matrix-zonotope-based bounding operator. Recursive feasibility and finite-time convergence are ensured through an adaptive terminal constraint mechanism. A key advantage of the proposed approach is that all the necessary bounding sets can be computed offline, substantially reducing the online computational burden. The effectiveness of the method is illustrated via a numerical case study on an orbital rendezvous maneuver between two satellites.

eess.SY

A Comparative Study of Human Motion Models in Reinforcement Learning Algorithms for Social Robot Navigation

Social robot navigation is an evolving research field that aims to find efficient strategies to safely navigate dynamic environments populated by humans. A critical challenge in this domain is the accurate modeling of human motion, which directly impacts the design and evaluation of navigation algorithms. This paper presents a comparative study of two popular categories of human motion models used in social robot navigation, namely velocity-based models and force-based models. A system-theoretic representation of both model types is presented, which highlights their common feedback structure, although with different state variables. Several navigation policies based on reinforcement learning are trained and tested in various simulated environments involving pedestrian crowds modeled with these approaches. A comparative study is conducted to assess performance across multiple factors, including human motion model, navigation policy, scenario complexity and crowd density. The results highlight advantages and challenges of different approaches to modeling human behavior, as well as their role during training and testing of learning-based navigation policies. The findings offer valuable insights and guidelines for selecting appropriate human motion models when designing socially-aware robot navigation systems.

cs.HC

Robust Variable-Horizon MPC with Adaptive Terminal Constraints

This paper presents a novel robust variable-horizon model predictive control scheme designed to intercept a target moving along a known trajectory, in finite time. Linear discrete-time systems affected by bounded process disturbances are considered and a tube-based MPC approach is adopted. The main contribution is an adaptive mechanism for choosing the terminal constraint set sequence in the MPC optimization problem. This mechanism is designed to ensure recursive feasibility while promoting minimization of the final distance to the target. Finite-time convergence of the proposed control scheme is proven. In order to evaluate its effectiveness, the designed control law is tested through numerical simulations, including a case study involving orbital rendezvous of a satellite with a tumbling object. The results indicate a significant reduction in conservatism compared to existing state-of-the-art methods using a fixed terminal set sequence.

eess.SY

A Family of Switching Pursuit Strategies for a Multi-Pursuer Single-Evader Game

This paper introduces a new family of pursuit strategies for multi-pursuer single-evader games in a planar environment. They leverage conditions under which the minimum-time solution of the game becomes equivalent to that of a suitable two-pursuer single-evader game. This enables the design of strategies in which the pursuers first aim to meet such conditions, and then transition to a two-pursuer game once they are satisfied. As a consequence, naive strategies that are in general unsuccessful, can be turned into winning strategies by switching to the appropriate two-pursuer game. Moreover, it is shown via numerical simulations that the switching mechanism significantly enhances the performance of existing pursuit algorithms, like those based on Voronoi partitions.

eess.SY

Adaptive Threshold Selection for Set Membership State Estimation with Quantized Measurements

State estimation for discrete-time linear systems with quantized measurements is addressed. By exploiting the set-theoretic nature of the information provided by the quantizer, the problem is cast in the set membership estimation setting. Motivated by the possibility of suitably tuning the quantizer thresholds in sensor networks, the optimal design of adaptive quantizers is formulated in terms of the minimization of the radius of information associated to the state estimation problem. The optimal solution is derived for first-order systems and the result is exploited to design adaptive quantizers for generic systems, minimizing the size of the feasible output signal set. Then, the minimum number of sensor thresholds for which the adaptive quantizers guarantee asymptotic boundedness of the state estimation uncertainty is established. Threshold adaptation mechanisms based on several types of outer approximations of the feasible state set are also proposed. The effectiveness of the designed adaptive quantizers is demonstrated on numerical tests involving a specific case study and randomly generated systems, highlighting the trade off between the resulting estimation uncertainty and the computational burden required by recursive set approximations.

eess.SY

Learning-based Parameter Optimization for a Class of Orbital Tracking Control Laws

This paper presents a machine learning approach for tuning the parameters of a family of stabilizing controllers for orbital tracking. An augmented random search algorithm is deployed, which aims at minimizing a cost function combining convergence time and fuel consumption. The main feature of the proposed learning strategy is that closed-loop stability is always guaranteed during the exploration of the parameter space, {a property that allows one to streamline the training process by restricting the search domain to well-behaved control policies.} The proposed approach is tested on two case studies: an orbital transfer and a rendezvous and docking mission. It is shown that in both cases the learned control parameters lead to a significant improvement of the considered performance measure.

eess.SY

Variable-Horizon Guidance for Autonomous Rendezvous and Docking to a Tumbling Target

In this paper, the trajectory planning problem for autonomous rendezvous and docking between a controlled spacecraft and a tumbling target is addressed. The use of a variable planning horizon is proposed in order to construct an appropriate maneuver plan, within an optimization-based framework. The involved optimization problem is nonconvex and features nonlinear constraints. The main contribution is to show that such problem can be tackled effectively by solving a finite number of linear programs. To this aim, a specifically conceived horizon search algorithm is employed in combination with a polytopic constraint approximation technique. The resulting guidance scheme provides the ability to identify favourable docking configurations, by exploiting the time-varying nature of the optimization problem endpoint. Simulation results involving the capture of the nonoperational EnviSat spacecraft indicate that the method is able to generate optimal trajectories at a fraction of the computational cost incurred by a state-of-the-art nonlinear solver.

eess.SY

Optimal Low-Thrust Orbit Transfers Made Easy: A Direct Approach

The optimization of low-thrust, multi-revolution orbit transfer trajectories is often regarded as a difficult problem in modern astrodynamics. In this paper, a flexible and computationally efficient approach is presented for the optimization of low-thrust orbit transfers under eclipse constraints. The proposed approach leverages a new dynamic model of the orbital motion and a Lyapunov-based initial guess generation scheme that is very easy to tune. A multi-objective, single-phase formulation of the optimal control problem is devised, which provides a convenient way to trade off fuel consumption and time of flight. A distinctive feature of such a formulation is that it requires no prior information about the structure of the optimal solution. Simulation results for two benchmark orbit transfer scenarios indicate that minimum-time, minimum-fuel and mixed time/fuel-optimal instances of the control problem can be readily solved via direct collocation, while incurring a significantly lower computational demand with respect to existing techniques.

math.OC

Satellite Relative Motion Modeling and Estimation via Nodal Elements

In this paper, a new parametrization of the relative motion between two satellites orbiting a central body is presented. The parametrization is based on the nodal elements: a set of angles describing the orbit geometry with respect to the relative line of nodes. These are combined with classical orbital elements to yield a nonsingular relative motion description. The exact nonlinear, perturbed dynamic model resulting from the new parametrization is established. The proposed parameter set captures the fundamental Keplerian invariants, while retaining a simple relationship with local orbital coordinates. An angles-only relative navigation filter and a collision avoidance scheme are devised by exploiting these features. The navigation solution is validated on a case study of an asteroid flyby mission. It is shown that a collision can be detected early on in the estimation process, which allows one to issue a timely evasive maneuver.

eess.SY

Cooperative versus decentralized strategies in three-pursuer single-evader games

The value of cooperation in pursuit-evasion games is investigated. The considered setting is that of three pursuers chasing one evader in a planar environment. The optimal evader trajectory for a well-known decentralized pursuer strategy is characterized. This result is instrumental to derive upper and lower bounds to the game length, in the case in which the pursuers cooperate in the chasing strategy. It is shown that the cooperation cannot reduce the capture time by more than one half with respect to the decentralized case, and that such bound is tight.

math.OC

Asynchronous Distributed Learning from Constraints

In this paper, the extension of the framework of Learning from Constraints (LfC) to a distributed setting where multiple parties, connected over the network, contribute to the learning process is studied. LfC relies on the generic notion of "constraint" to inject knowledge into the learning problem and, due to its generality, it deals with possibly nonconvex constraints, enforced either in a hard or soft way. Motivated by recent progresses in the field of distributed and constrained nonconvex optimization, we apply the (distributed) Asynchronous Method of Multipliers (ASYMM) to LfC. The study shows that such a method allows us to support scenarios where selected constraints (i.e., knowledge), data, and outcomes of the learning process can be locally stored in each computational node without being shared with the rest of the network, opening the road to further investigations into privacy-preserving LfC. Constraints act as a bridge between what is shared over the net and what is private to each node and no central authority is required. We demonstrate the applicability of these ideas in two distributed real-world settings in the context of digit recognition and document classification.

cs.LG

Upper Body Pose Estimation Using Wearable Inertial Sensors and Multiplicative Kalman Filter

Estimating the limbs pose in a wearable way may benefit multiple areas such as rehabilitation, teleoperation, human-robot interaction, gaming, and many more. Several solutions are commercially available, but they are usually expensive or not wearable/portable. We present a wearable pose estimation system (WePosE), based on inertial measurements units (IMUs), for motion analysis and body tracking. Differently from camera-based approaches, the proposed system does not suffer from occlusion problems and lighting conditions, it is cost effective and it can be used in indoor and outdoor environments. Moreover, since only accelerometers and gyroscopes are used to estimate the orientation, the system can be used also in the presence of iron and magnetic disturbances. An experimental validation using a high precision optical tracker has been performed. Results confirmed the effectiveness of the proposed approach.

cs.RO

A Distributed Asynchronous Method of Multipliers for Constrained Nonconvex Optimization

This paper presents a fully asynchronous and distributed approach for tackling optimization problems in which both the objective function and the constraints may be nonconvex. In the considered network setting each node is active upon triggering of a local timer and has access only to a portion of the objective function and to a subset of the constraints. In the proposed technique, based on the method of multipliers, each node performs, when it wakes up, either a descent step on a local augmented Lagrangian or an ascent step on the local multiplier vector. Nodes realize when to switch from the descent step to the ascent one through an asynchronous distributed logic-AND, which detects when all the nodes have reached a predefined tolerance in the minimization of the augmented Lagrangian. It is shown that the resulting distributed algorithm is equivalent to a block coordinate descent for the minimization of the global augmented Lagrangian. This allows one to extend the properties of the centralized method of multipliers to the considered distributed framework. Two application examples are presented to validate the proposed approach: a distributed source localization problem and the parameter estimation of a neural network.

math.OC

Distributed interpolatory algorithms for set membership estimation

This work addresses the distributed estimation problem in a set membership framework. The agents of a network collect measurements which are affected by bounded errors, thus implying that the unknown parameters to be estimated belong to a suitable feasible set. Two distributed algorithms are considered, based on projections of the estimate of each agent onto its local feasible set. The main contribution of the paper is to show that such algorithms are asymptotic interpolatory estimators, i.e. they converge to an element of the global feasible set, under the assumption that the feasible set associated to each measurement is convex. The proposed techniques are demonstrated on a distributed linear regression estimation problem.

math.OC

An Adaptive Groundtrack Maintenance Scheme for Spacecraft with Electric Propulsion

In this paper, the repeat-groundtrack orbit maintenance problem is addressed for spacecraft driven by electric propulsion. An adaptive solution is proposed, which combines an hysteresis controller and a recursive least squares filter. The controller provides a pulse-width modulated command to the thruster, in compliance with the peculiarities of the electric propulsion technology. The filter takes care of estimating a set of environmental disturbance parameters, from inertial position and velocity measurements. The resulting control scheme is able to compensate for the groundtrack drift due to atmospheric drag, in a fully autonomous manner. A numerical study of a low Earth orbit mission confirms the effectiveness of the proposed method.

eess.SY