Benoit Desrochers
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Benoit Desrochers has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Luc Jaulin
ENSTA Bretagne
4 shared publications - Alexandru Stancu
The University of Manchester
1 shared publication - Didier Coquin
LISTIC, University Savoie Mont Blanc
1 shared publication - Reda Boukezzoula
University of Savoie, LISTIC, 515211 Annecy-le-Vieux, Auvergne-Rhone-Alpes France
1 shared publication - Simon Rohou
ENSTA Bretagne, Lab-STICC, UMR CNRS, Brest, France
1 shared publication
Latest Publications
- 21 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (11) , 3334-3348
Thick Fuzzy Sets (TFSs) and Their Potential Use in Uncertain Fuzzy Computations and Modeling
This paper aims at proposing the concept of thick fuzzy sets (TFSs). A TFS is based on the joint use of thick sets (TSs) and -cuts concepts. A TFS is represented by a family of nested TSs. A TS is an uncertain set, which is represented by a pair of crisp sets (CSs). These CSs characterize the upper and lower bounds of the TS. Therefore, a TS can be regarded as an interval of CSs. In this framework, as a type-1 fuzzy set (T1FS) is regarded as a family of nested CSs, a TFS can be represented by a family of nested TSs. Furthermore, according to the vertical dimension, a TFS can be regarded as an interval with T1FS bounds. The potentialities of the TFS concept have been validated using application examples where a real-world application for modeling the zone explored by an underwater robot is given.
- 21 August 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Fuzzy Systems
- Vol. 29 (11) , 3334-3348
Thick Fuzzy Sets (TFSs) and Their Potential Use in Uncertain Fuzzy Computations and Modeling
This paper aims at proposing the concept of thick fuzzy sets (TFSs). A TFS is based on the joint use of thick sets (TSs) and -cuts concepts. A TFS is represented by a family of nested TSs. A TS is an uncertain set, which is represented by a pair of crisp sets (CSs). These CSs characterize the upper and lower bounds of the TS. Therefore, a TS can be regarded as an interval of CSs. In this framework, as a type-1 fuzzy set (T1FS) is regarded as a family of nested CSs, a TFS can be represented by a family of nested TSs. Furthermore, according to the vertical dimension, a TFS can be regarded as an interval with T1FS bounds. The potentialities of the TFS concept have been validated using application examples where a real-world application for modeling the zone explored by an underwater robot is given.
- Open Access
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4393-4399
Set-membership state estimation by solving data association
This paper deals with the localization problem of a robot in an environment made of indistinguishable landmarks, and assuming the initial position of the vehicle is unknown. This scenario is typically encountered in underwater applications for which landmarks such as rocks all look alike. Furthermore, the position of the robot may be lost during a diving phase, which obliges us to consider unknown initial position. We propose a deterministic approach to solve simultaneously the problems of data association and state estimation, without combinatorial explosion. The efficiency of the method is shown on an actual experiment involving an underwater robot and sonar data.
- 1 May 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 4393-4399
Open AccessSet-membership state estimation by solving data association
This paper deals with the localization problem of a robot in an environment made of indistinguishable landmarks, and assuming the initial position of the vehicle is unknown. This scenario is typically encountered in underwater applications for which landmarks such as rocks all look alike. Furthermore, the position of the robot may be lost during a diving phase, which obliges us to consider unknown initial position. We propose a deterministic approach to solve simultaneously the problems of data association and state estimation, without combinatorial explosion. The efficiency of the method is shown on an actual experiment involving an underwater robot and sonar data.
- Open Access
- 16 February 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 62 (1) , 425-430
Computing a Guaranteed Approximation of the Zone Explored by a Robot
This technical note deals with the guaranteed characterization of the part of the space that has been explored by a robot. The main difficulty of the problem is to take into account the uncertainty associated with the trajectory and the fact that the dimension of the visible space at time t may be smaller than that of the workspace. An example involving an experiment made with an actual underwater robot is presented in order to illustrate the efficiency of the approach.
- 16 February 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 62 (1) , 425-430
Open AccessComputing a Guaranteed Approximation of the Zone Explored by a Robot
This technical note deals with the guaranteed characterization of the part of the space that has been explored by a robot. The main difficulty of the problem is to take into account the uncertainty associated with the trajectory and the fact that the dimension of the visible space at time t may be smaller than that of the workspace. An example involving an experiment made with an actual underwater robot is presented in order to illustrate the efficiency of the approach.
- 27 June 2014
- Published by American Society of Civil Engineers (ASCE)
- p. 2244-2253
Inner and Outer Approximations of Probabilistic Sets
This paper proposes a set-membership method to characterize a probabilistic set, i.e., a set enclosing the true value for the parameter vector of a parametric system with a given probability. The approach assumes that all errors are independent and an interval for the error is known. To each error interval, a probability to be an outlier is provided. It is shown that characterizing the probabilistic set is a set inversion problem. The main contribution of the paper is to provide a method to characterize the inner part of the probabilistic set. As an illustration, an application to the static localization of a mobile robot is considered.
- 27 June 2014
- Published by American Society of Civil Engineers (ASCE)
- p. 2244-2253
Inner and Outer Approximations of Probabilistic Sets
This paper proposes a set-membership method to characterize a probabilistic set, i.e., a set enclosing the true value for the parameter vector of a parametric system with a given probability. The approach assumes that all errors are independent and an interval for the error is known. To each error interval, a probability to be an outlier is provided. It is shown that characterizing the probabilistic set is a set inversion problem. The main contribution of the paper is to provide a method to characterize the inner part of the probabilistic set. As an illustration, an application to the static localization of a mobile robot is considered.