Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Abstract— This paper studies the robust stability and stabilization problems for switched linear discrete-time systems. The parameter uncertainties in the system under considerat...
This paper addresses the problem of human gait recognition by applying model (in)validation techniques. The main idea is to associate to each class of gaits a nominal model and a ...
Cecilia Mazzaro, Mario Sznaier, Octavia I. Camps, ...
An approach to estimation for a class of hybrid discrete-time linear systems using Luenberger observers is presented. The proposed Luenberger observer for such a kind of systems re...