Searcharxiv⌕ Search

arXiv subjects

Antonio Giannitrapani

Publications and source records attributed to Antonio Giannitrapani.

15 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↗

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↗

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↗

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↗

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↗

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↗

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↗

A Community Microgrid Architecture with an Internal Local Market

This work fits in the context of community microgrids, where members of a community can exchange energy and services among themselves, without going through the usual channels of the public electricity grid. We introduce and analyze a framework to operate a community microgrid, and to share the resulting revenues and costs among its members. A market-oriented pricing of energy exchanges within the community is obtained by implementing an internal local market based on the marginal pricing scheme. The market aims at maximizing the social welfare of the community, thanks to the more efficient allocation of resources, the reduction of the peak power to be paid, and the increased amount of reserve, achieved at an aggregate level. A community microgrid operator, acting as a benevolent planner, redistributes revenues and costs among the members, in such a way that the solution achieved by each member within the community is not worse than the solution it would achieve by acting individually. In this way, each member is incentivized to participate in the community on a voluntary basis. The overall framework is formulated in the form of a bilevel model, where the lower level problem clears the market, while the upper level problem plays the role of the community microgrid operator. Numerical results obtained on a real test case implemented in Belgium show around 54% cost savings on a yearly scale for the community, as compared to the case when its members act individually.

eess.SY↗

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↗

A New Approach to Electricity Market Clearing With Uniform Purchase Price and Curtailable Block Orders

The European market clearing problem is characterized by a set of heterogeneous orders and rules that force the implementation of heuristic and iterative solving methods. In particular, curtailable block orders and the uniform purchase price (UPP) pose serious difficulties. A block is an order that spans over multiple hours, and can be either fully accepted or fully rejected. The UPP prescribes that all consumers pay a common price, i.e., the UPP, in all the zones, while producers receive zonal prices, which can differ from one zone to another. The market clearing problem in the presence of both the UPP and block orders is a major open issue in the European context. The UPP scheme leads to a non-linear optimization problem involving both primal and dual variables, whereas block orders introduce multi-temporal constraints and binary variables into the problem. As a consequence, the market clearing problem in the presence of both blocks and the UPP can be regarded as a non-linear integer programming problem involving both primal and dual variables with complementary and multi-temporal constraints. The aim of this paper is to present a non-iterative and heuristic-free approach for solving the market clearing problem in the presence of both curtailable block orders and the UPP. The solution is exact, with no approximation up to the level of resolution of current market data. By resorting to an equivalent UPP formulation, the proposed approach results in a mixed-integer linear program, which is built starting from a non-linear integer bilevel programming problem. Numerical results using real market data are reported to show the effectiveness of the proposed approach. The model has been implemented in Python, and the code is freely available on a public repository.

q-fin.PR↗

Asynchronous Distributed Method of Multipliers for Constrained Nonconvex Optimization

This paper addresses a class of constrained optimization problems over networks in which local cost functions and constraints can be nonconvex. We propose an asynchronous distributed optimization algorithm, relying on the centralized Method of Multipliers, in which each node wakes up in an uncoordinated fashion and performs either a descent step on a local Augmented Lagrangian or an ascent step on the local multiplier vector. These two phases are regulated by a distributed logic-AND, which allows nodes to understand when the descent on the (whole) Augmented Lagrangian is sufficiently small. We show that this distributed algorithm is equivalent to a block coordinate descent algorithm for the minimization of the Augmented Lagrangian followed by an update of the whole multiplier vector. Thus, the proposed algorithm inherits the convergence properties of the Method of Multipliers.

math.OC↗

Asymptotic analysis of threshold models for social networks

A class of dynamic threshold models is proposed, for describing the upset of collective actions in social networks. The agents of the network have to decide whether to undertake a certain action or not. They make their decision by comparing the activity level of their neighbors with a time-varying threshold, evolving according to a time-invariant opinion dynamic model. Key features of the model are a parameter representing the degree of self-confidence of the agents, and the mechanism adopted by the agents to evaluate the activity level of their neighbors. The case in which a radical agent, initially eager to undertake the action, interacts with a group of ordinary agents, is considered. The main contribution of the paper is the complete analytic characterization of the asymptotic behaviors of the network, for three different graph topologies. The asymptotic activity patterns are determined as a function of the self-confidence parameter and of the initial threshold of the ordinary agents.

cs.SI↗