Related papers: Numerical scheme for a whole class of sweeping pro…
Coverage motion planning is essential to a wide range of robotic tasks. Unlike conventional motion planning problems, which reason over temporal sequences of states, coverage motion planning requires reasoning over the spatial distribution…
Matching pursuit algorithms are an important class of algorithms in signal processing and machine learning. We present a blended matching pursuit algorithm, combining coordinate descent-like steps with stronger gradient descent steps, for…
In this work, we numerically study the higher-ordered/extended Boussinesq system describing the propagation of water-waves over flat topography. A reformulation of the same order of precision that avoids the calculation of high order…
In this work we establish a simple yet effective strategy, based on optimal transport theory, for enabling a group of robots to accomplish complex tasks, such as shape formation and assembly. We demonstrate the feasibility of this approach…
Nowadays, parallel computing is ubiquitous in several application fields, both in engineering and science. The computations rely on the floating-point arithmetic specified by the IEEE754 Standard. In this context, an elementary brick of…
In this paper, we propose stochastic structure-preserving schemes to compute the effective diffusivity for particles moving in random flows. We first introduce the motion of particles using the Lagrangian formulation, which is modeled by…
We propose in this paper a unifying scheme for several algorithms from the literature dedicated to the solving of monotone inclusion problems involving compositions with linear continuous operators in infinite dimensional Hilbert spaces. We…
The main goal of this paper is developing the method of discrete approximations to derive necessary optimality conditions for a class of constrained sweeping processes with nonsmooth perturbations. Optimal control problems for sweeping…
We consider estimation procedures which are recursive in the sense that each successive estimator is obtained from the previous one by a simple adjustment. We propose a wide class of recursive estimation procedures for the general…
Spectral clustering has become a popular technique due to its high performance in many contexts. It comprises three main steps: create a similarity graph between N objects to cluster, compute the first k eigenvectors of its Laplacian matrix…
We discuss the solution of regular and singular Sturm-Liouville problems by means of High Order Finite Difference Schemes. We describe a code to define a discrete problem and its numerical solution by means of linear algebra techniques.…
This paper establishes the convergence of a time-steeping scheme for time fractional diffusion problems with nonsmooth data. We first analyze the regularity of the model problem with nonsmooth data, and then prove that the time-steeping…
This paper concerns the numerical procedure for solving hybrid optimal control problems with sliding modes. The proposed procedure has several features which distinguishes it from the other procedures for the problem. First of all a sliding…
In this thesis, we develop various techniques for working with sets in machine learning. Each input or output is not an image or a sequence, but a set: an unordered collection of multiple objects, each object described by a feature vector.…
This paper develops a planner to find an optimal assembly sequence to assemble several objects. The input to the planner is the mesh models of the objects, the relative poses between the objects in the assembly, and the final pose of the…
We investigate high-order finite difference schemes for the Hamilton-Jacobi equation continuum limit of nondominated sorting. Nondominated sorting is an algorithm for sorting points in Euclidean space into layers by repeatedly removing…
We present a novel parametric finite element approach for simulating the surface diffusion of curves and surfaces. Our core strategy incorporates a predictor-corrector time-stepping method, which enhances the classical first-order temporal…
In the setting adopted by Edmond and Thibault [Mathematical Programming 104 (2005), 347--373], we study a class of perturbed sweeping processes. Under suitable assumptions, we obtain two solution existence theorems for perturbed sweeping…
The problem of data clustering is one of the most important in data analysis. It can be problematic when dealing with experimental data characterized by measurement uncertainties and errors. Our paper proposes a recursive scheme for…
The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…