SearcharxivSearch

arXiv subjects

Luca Bascetta

Publications and source records attributed to Luca Bascetta.

4 recordsLinked to original sources

Enhanced-FQL($\lambda$), an Efficient and Interpretable RL with novel Fuzzy Eligibility Traces and Segmented Experience Replay

This paper introduces a fuzzy reinforcement learning framework, Enhanced-FQL($\lambda$), that integrates novel Fuzzified Eligibility Traces (FET) and Segmented Experience Replay (SER) into fuzzy Q-learning with the Fuzzified Bellman Equation (FBE) for continuous control. The proposed approach employs an interpretable fuzzy rule base instead of complex neural architectures, while maintaining competitive performance through two key innovations: a fuzzified Bellman equation with eligibility traces for stable multi-step credit assignment, and a memory-efficient segment-based experience replay mechanism for enhanced sample efficiency. Theoretical analysis proves the proposed method convergence under standard assumptions. On the Cart--Pole benchmark, Enhanced-FQL($\lambda$) improves sample efficiency and reduces variance relative to $n$-step fuzzy TD and fuzzy SARSA($\lambda$), while remaining competitive with the tested DDPG baseline. These results support the proposed framework as an interpretable and computationally compact alternative for moderate-scale continuous control problems.

cs.LG

Safe Motion Planning for a Mobile Robot Navigating in Environments Shared with Humans

In this paper, a robot navigating an environment shared with humans is considered, and a cost function that can be exploited in $\text{RRT}^\text{X}$, a randomized sampling-based replanning algorithm that guarantees asymptotic optimality, to allow for a safe motion is proposed. The cost function is a path length weighted by a danger index based on a prediction of human motion performed using either a linear stochastic model, assuming constant longitudinal velocity and varying lateral velocity, and a GMM/GMR-based model, computed on an experimental dataset of human trajectories. The proposed approach is validated using a dataset of human trajectories collected in a real world setting.

cs.RO

A feedback linearisation algorithm for single-track models with structural stability properties

This paper proposes a feedback linearizing law for single-track dynamic models, allowing the design of a trajectory tracking controller exploiting linear control theory. The main characteristics of this algorithm are its simplicity, its independence from any vehicle model parameter, apart from the position of the center of mass, and its robustness. In particular, a numerical bifurcation analysis demonstrates that, for physically meaningful values of the center of mass deviation, the equilibrium is structurally asymptotically stable. Experimental results, concerning the linearising law and its application as inner loop of a trajectory tracking controller, are also presented, confirming the effectiveness of the proposal.

eess.SY

Sampling-based optimal kinodynamic planning with motion primitives

This paper proposes a novel sampling-based motion planner, which integrates in RRT* (Rapidly exploring Random Tree star) a database of pre-computed motion primitives to alleviate its computational load and allow for motion planning in a dynamic or partially known environment. The database is built by considering a set of initial and final state pairs in some grid space, and determining for each pair an optimal trajectory that is compatible with the system dynamics and constraints, while minimizing a cost. Nodes are progressively added to the tree of feasible trajectories in the RRT* algorithm by extracting at random a sample in the gridded state space and selecting the best obstacle-free motion primitive in the database that joins it to an existing node. The tree is rewired if some nodes can be reached from the new sampled state through an obstacle-free motion primitive with lower cost. The computationally more intensive part of motion planning is thus moved to the preliminary offline phase of the database construction {at the price of some performance degradation due to gridding. Grid resolution can be tuned so as to compromise between (sub)optimality and size of the database. The planner is shown to be }asymptotically optimal as the grid resolution goes to zero and the number of sampled states grows to infinity.

cs.RO