***Programme :*** *8h30 :* **Accueil des participants** *9h00 :* **Mot de bienvenue de Laurent Dubar, Directeur du LAMIH** **Introduction avec les nouveautés FRA TMM et RITMEA** ***Les présentations :*** * Thème **CP** (Capteurs et Perception) **WP1 LOPNA** (LOcalisation et Perception …

Dans le cadre des actions autour de la semaine de l'IA dans la région Hauts-de-France, CRIStAL a participé à la journée IA \&Data de la Métropole Européenne de Lille le 16 juin. Cette journée, destinée à l'ensemble des agents de la MEL, de l'agent de voirie aux directions de services, était …

The use of deformations in robotics is one of the most active fields of application and research. To train the next generation of researchers and engineers, Inria, the IEEE Robotics and Automation Society and the University of Lille are joining forces to organize a summer school. During on week, …

La JRD-AGITSI permet de réunir les doctorants, mais également les post-doc et enseignants chercheurs en région Haut-de-France. Le thème de la journée est "Le recrutement des docteurs en Région dans le privé et dans le public". Les participants assisteront à des présentations et témoignages sur les …

**Carlos Ernesto Vazquez-Garcia** ***Title:*** Toward a Methodological Framework for Dexterous Soft Manipulation ***Abstract:*** This research proposes a framework for cooperative manipulation of fragile objects through soft robotics fingers, englobing passivity-based forced-position control, an …

Mickaël Basson, doctorant de l'équipe SCOOL du Groupe thématique DatIng a obtenu un Best Paper Award dans la catégorie Runner-Up à la conférence Lion 2026. Titre : *Leveraging Structural Constraints for Diffusion-besed Neural TSP Solvers*

**Emilia Fridman** *Title:* *Delay-Robust Control of PDEs* **Abstract:** Some PDEs may not be robust with respect to arbitrary small time-delays in the feedback. Robust finite-dimensional controller design for PDEs is a challenging problem. In this talk two constructive methods for delay-robust …

The Path Cover problem is a fundamental graph algorithmic problem that asks whether the vertices of a given graph G can be covered using a collection of K paths of G. Path Cover contains the celebrated Hamiltonian Path problem as a special case (when k=1). Indeed, when a graph is not Hamiltonian, it …

The meeting is designed to be fully interactive and will provide PhD students and post-doctoral researchers with the opportunity to present and discuss their latest work, as well as to explore potential collaboration opportunities within CO2 group. ***The program is organised as follows:*** …

In computational pathology, a common task is to analyze digitally scanned tissue samples to predict endpoints that enhance disease understanding and improve patient care.This often involves predicting clinical outcomes such as overall survival (OS) and progression-free survival (PFS), as well as …