Publications

Unsupervised skill discovery for robotic manipulation through automatic task generation

By David Emukpere, Bingbing Wu, Julien Perez, Jean-Michel Renders

2024-10-10

In IEEE international conference on robotics and automation, ICRA 2024, yokohama, japan, may 13-17, 2024

Abstract

Self-supervised skill learning aims to acquire useful behaviors that leverage the underlying dynamics of the environment. Latent variable models, based on mutual information maximization, have been successful in this task but still struggle in the context of robotic manipulation. As it requires impacting a possibly large set of degrees of freedom composing the environment, mutual information maximization fails alone in producing useful and safe manipulation behaviors. Furthermore, tackling this by augmenting skill discovery rewards with additional rewards through a naive combination might fail to produce desired behaviors. To address this limitation, we introduce SLIM, a multi-critic learning approach for skill discovery with a particular focus on robotic manipulation. Our main insight is that utilizing multiple critics in an actor-critic framework to gracefully combine multiple reward functions leads to a significant improvement in latent-variable skill discovery for robotic manipulation while overcoming possible interference occurring among rewards which hinders convergence to useful skills. Furthermore, in the context of tabletop manipulation, we demonstrate the applicability of our novel skill discovery approach to acquire safe and efficient motor primitives in a hierarchical reinforcement learning fashion and leverage them through planning, significantly surpassing baseline approaches for skill discovery.

Continue reading

Unsupervised skill discovery for robotic manipulation through automatic task generation

By Paul Jansonnie, Bingbing Wu, Julien Perez, Jan Peters

2024-10-10

In IEEE-RAS international conference on humanoid robots

Abstract

Learning skills that interact with objects is of major importance for robotic manipulation. These skills can indeed serve as an efficient prior for solving various manipulation tasks. We propose a novel Skill Learning approach that discovers composable behaviors by solving a large and diverse number of autonomously generated tasks. Our method learns skills allowing the robot to consistently and robustly interact with objects in its environment. The discovered behaviors are embedded in primitives which can be composed with Hierarchical Reinforcement Learning to solve unseen manipulation tasks. In particular, we leverage Asymmetric Self-Play to discover behaviors and Multiplicative Compositional Policies to embed them. We compare our method to Skill Learning baselines and find that our skills are more interactive. Furthermore, the learned skills can be used to solve a set of unseen manipulation tasks, in simulation as well as on a real robotic platform.

Continue reading

From linear to nonlinear unfolded condat-vũ algorithm for spectro-polarimetric hight-constrast image recovery

By Édouard Chappon, Nelly Pustelnik, Julian Tachella, Laurence Denneulin, André, Ferrari, Maud Langlois

2024-10-09

In Proceedings of the 32nd european signal processing conference (EUSIPCO 2024)

Abstract

Studying circumstellar environments is crucial for understanding exoplanets and stellar systems. Instruments like SPHERE can extract information about these environments by leveraging advanced image reconstruction methods, possibly based on deep learning. This work focuses on unfolded proximal neural networks based on Condat-Vũ iterations and proposes a new nonlinear formulation. To evaluate and compare the performance of the proposed reconstruction strategies, two datasets dedicated to circumstellar environments analysis in the context of high-contrast imagery have been created offering different level of complexity in the evaluation of the performance.

Continue reading

Raspberry pi single-board computers: Cost/performance rela onship over time

By David Beserra, Patricia Takako Endo, Louis Clinckx, Thomas Clement, Boubacar Guisse, Alexandre Maugras

2024-10-01

In IEEE international conference on systems, man, and cybernetics

Abstract

This study delves into the dynamic landscape of cost versus performance ratio within the Raspberry Pi family of computers, specifically scrutinizing the Raspberry Pi B and Raspberry Pi Zero lines. Based on previous analyses, our comprehensive investigation encompasses all generations of the Raspberry Pi B and Zero lines available until January 2024. Prices are meticulously adjusted to the 2012 dollar value, aligning with the inaugural launch of the Raspberry Pi. The findings illuminate an upward in performance around 229 times over an 11-year period, coupled with a notable decline in the cost per unit of performance. The impact of the dollar’s depreciation since 2012 further accentuates these trends.

Continue reading

Towards verifying security policies for infinite-state systems

By Quentin Peyras, Ghada Gharbi, Souheib Baarir

2024-10-01

In Proceedings of the 16th international conference on verified software: Theories, tools, and experiments (VSTTE’24)

Abstract

Non-interference ensures no unauthorized data leaks during system execution. Verifying security policies is complex, requiring analysis of multiple execution paths. Hyperproperties provide a framework to describe security policies like non-interference. However, existing methods like HyperLTL are limited to finite-state models. This paper introduces a case study illustrating the use of HyperFOLTL, designed for infinite-state systems, and presents a formal approach to verify security policies in such systems.

Continue reading

New algorithms for multivalued component trees

By Nicolas Passat, Romain Perrin, Jimmy Francky Randrianasoa, Camille Kurtz, Benoît Naegel

2024-09-30

In Proceedings of the 27th international conference on pattern recognition

Abstract

Tree-based structures can model images—and more generally valued graphs—for processing and analysis purpose. In this framework, the component tree was natively designed for grey-level images—and more generally totally or- dered valued graphs. Ten years ago, the notion of a multivalued component tree was introduced to relax this grey-level / total order constraint. In this algorith- mic paper, we provide new tools to handle multivalued component trees. Our contributions are twofold: (1) we propose a new algorithm for the construction of the multivalued component tree; (2) we propose two strategies for building hierarchical orders on value sets, required to further build the multivalued com- ponent trees of images / graphs relying on such value sets. Codes available at: https://github.com/bnaegel/multivalued_component_tree.

Continue reading

A large scale format compliance checker for TeX font metrics

By Didier Verna

2024-09-01

In TUGboat

Abstract

We present tfm-validate, a TeX Font Metrics format checker. The library’s core functionality is to inspect TFM files and report any discovered compliance issue. It can be run on individual files or complete directory trees. tfm-validate also provides a convenience function to (in)validate a local TeXLive installation. When run this way, the library processes every TFM file in the distribution and generates a website aggregating all the discovered non-compliance issues. One public instance of tfm-validate is now automatically triggered on a daily basis. The corresponding website is available at https://texlive.info/tfm-validate/.

Continue reading

Introducing multi-layer concatenation as a scheme to combine information in water distribution cyber-physical systems

By Côme Frappé–Vialatoux, Pierre Parrend

2024-09-01

In 28th international conference on knowledge-based and intelligent information and engineering systems

Abstract

As Water distribution infrastructures are ageing, their modernization process is leading to an increased incorporation of connected devices into these physical systems. This transition is changing the nature of water distribution control systems from physical systems to cyber-physical systems (CPS). However, this evolution is associated with an increased vulnerability to cyber-attacks. Detecting such attacks in CPS is gaining traction in the scientific community with the recent release of cyber-physical datasets that capture simultaneously the network traffic and the physical state of a water distribution testbed. This novel paradigm of conjoint availability of these two types of data from a common source infrastructure opens a new question on how to combine their information when training machine learning models for attack detection. As an alternative approach to previous models that rely on model aggregation, this paper introduces Multi-Layer Concatenation, a combination scheme to merge the information from the physical and network parts of a CPS from a data perspective, through a time-based join operation coupled with a propagation process to keep the coherence of the global system. The evaluation of its impact assesses its benefits for machine learning-based detection on three cyber-physical datasets, by measuring machine learning models’ performances on physical and network data separately, and then on data combined through the proposed scheme.

Continue reading

Myhill-Nerode theorem for higher-dimensional automata

By Uli Fahrenberg, Krzysztof Ziemiański

2024-09-01

In Fundamenta Informaticae

Abstract

We establish a Myhill-Nerode type theorem for higher-dimensional automata (HDAs), stating that a language is regular if and only if it has finite prefix quotient. HDAs extend standard automata with additional structure, making it possible to distinguish between interleavings and concurrency. We also introduce deterministic HDAs and show that not all HDAs are determinizable, that is, there exist regular languages that cannot be recognised by a deterministic HDA. Using our theorem, we develop an internal characterisation of deterministic languages. Lastly, we develop analogues of the Myhill-Nerode construction and of determinacy for HDAs with interfaces.

Continue reading

ICDAR 2024 competition on historical map text detection, recognition, and linking

Abstract

Text on digitized historical maps contains valuable information, e.g., providing georeferenced political and cultural context. The goal of the ICDAR 2024 MapText Competition is to benchmark methods that automatically extract textual content on historical maps (e.g., place names) and connect words to form location phrases. The competition features two primary tasks—text detection and end-to-end text recognition—each with a secondary task of linking words into phrase blocks. Submissions are evaluated on two data sets: 1) David Rumsey Historical Map Collection which contains 936 map images covering 80 regions and 183 distinct publication years (from 1623 to 2012); 2) French Land Registers (created during the 19th century) which contains 145 map images of 50 French cities and towns. The competition received 44 submissions among all tasks. This report presents the motivation for the competition, the tasks, the evaluation metrics, and the submission analysis.

Continue reading