Skip to Main content Skip to Navigation
New interface

Sélection contextuelle de services continus pour la robotique ambiante

Abstract : Ambient robotics aims at introducing mobile robots in active environments where the latter provide new or alternative functionalities to those shipped by mobile robots. This thesis studies the competition between robot and external functionalities, which is set as a service selection problem. Service selection consists in choosing a service or a combination of services among a set of candidates able to fulfil a given request. To do this, it has to predict and evaluate candidate performances. These performances are based on non-functional requirements such as execution time, cost or noise. This application domain requires tight coordination between some of its functionalities. Tight coordination involves setting data streams between functionalities during their execution. In this proposal, functionalities producing data streams are modelled as continuous services. This new service category requires hierarchical service composition and adds some constraints to the service selection problem. This thesis shows that an important non-functional coupling appears between service instances at different levels, even when data streams are unidirectional. The proposed approach focuses on performance prediction of an high-level service instance given its organigram. This organigram gathers service instances involved in the high-level task processing. The scenario included in this study is the selection of a positioning service involved in a robot navigation high-level service. For a given organigram, performance prediction of an high-level service instance of this scenario has to: (i) be contextual by, for instance, considering moving path towards the required destination, (ii) support service instance replacement after a failure or in an opportunist manner. Consequently, this service selection is set as a sequential decision problem and is formalized as a finite-horizon Markov decision process. Its high contextual dimensionality with respect to robot moving frequency makes direct learning of Q-value functions or transition functions inadequate. The proposed approachre lies on local dynamic models and uses the planned moving path to estimate Q-values of organigrams available in the initial state. This estimation is done using a Monte-Carlo tree search method, Upper Confidence bounds applied to Trees
Document type :
Complete list of metadata

Cited literature [197 references]  Display  Hide  Download
Contributor : ABES STAR :  Contact
Submitted on : Thursday, March 20, 2014 - 11:27:09 AM
Last modification on : Tuesday, October 19, 2021 - 4:08:17 PM
Long-term archiving on: : Friday, June 20, 2014 - 11:05:56 AM


Version validated by the jury (STAR)


  • HAL Id : tel-00961567, version 1



Benjamin Cogrel. Sélection contextuelle de services continus pour la robotique ambiante. Autre [cs.OH]. Université Paris-Est, 2013. Français. ⟨NNT : 2013PEST1079⟩. ⟨tel-00961567⟩



Record views


Files downloads