Guillaume Infantes
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
Research Subjects
Guillaume Infantes has a total of 45 co-authors. Here are the top co-authors by number of shared publications:
Charles Lesire
Onera - The French Aerospace Lab, F-31055, Toulouse, France
2 shared publicationsMagali Barbier
Onera – The French Aerospace Lab
2 shared publications- Alexandre Albore
Institute of Research and Technology (IRT) Saint Exupéry
1 shared publication - Aurelie Clodic
LAAS - CNRS, 7, Avenue du Colonel Roche, 31077 Toulouse, France, Auré
1 shared publication Austin Parker
University of Maryland, College Park
1 shared publication- B. Burger
LAAS
1 shared publication
Latest Publications
- 2 August 2017
- Published by Springer Nature
- p. 147-162
A Model-Checking Approach to Analyse Temporal Failure Propagation with AltaRica
- 2 August 2017
- Published by Springer Nature
- p. 147-162
A Model-Checking Approach to Analyse Temporal Failure Propagation with AltaRica
- 18 August 2016
- Published by Springer Nature in Autonomous Robots
- Vol. 40 (7) , 1343-1362
A distributed architecture for supervision of autonomous multi-robot missions
- 18 August 2016
- Published by Springer Nature in Autonomous Robots
- Vol. 40 (7) , 1343-1362
A distributed architecture for supervision of autonomous multi-robot missions
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Using hybrid planning for plan reparation
In this work we propose a plan repair algorithm designed to be used in a real-life setting for a team of autonomous robots. This algorithm is built on top of a hybrid planner. This planner mixes partial order planning and hierarchical planning. This allows the creation of a plan with temporal flexibility while using human knowledge to improve the search process. Simulation shows that repairing increases the number of solved problems or at least reduces the number of plans explored. The algorithm uses the same hierarchical knowledge as the underlying planner, thus needing no more human modelling to properly run. We show that using this knowledge can help the reparation, even when some half-executed abstract actions are present in the plan.
- 1 September 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Using hybrid planning for plan reparation
In this work we propose a plan repair algorithm designed to be used in a real-life setting for a team of autonomous robots. This algorithm is built on top of a hybrid planner. This planner mixes partial order planning and hierarchical planning. This allows the creation of a plan with temporal flexibility while using human knowledge to improve the search process. Simulation shows that repairing increases the number of solved problems or at least reduces the number of plans explored. The algorithm uses the same hierarchical knowledge as the underlying planner, thus needing no more human modelling to properly run. We show that using this knowledge can help the reparation, even when some half-executed abstract actions are present in the plan.
- 21 December 2011
- Published by Springer Nature in Autonomous Robots
- Vol. 32 (2) , 129-147
Two-handed gesture recognition and fusion with speech to command a robot
- 21 December 2011
- Published by Springer Nature in Autonomous Robots
- Vol. 32 (2) , 129-147
Two-handed gesture recognition and fusion with speech to command a robot
- 23 August 2011
- Published by Taylor & Francis
- p. 318-326
Lazy forward-chaining methods for probabilistic model-checking
- 23 August 2011
- Published by Taylor & Francis
- p. 318-326
Lazy forward-chaining methods for probabilistic model-checking
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-304
A generic framework for anytime execution-driven planning in robotics
Robotic missions require to implement various functionalities in order to link reactive functions at actuators and sensors level to deliberative functions like vision, supervision and planning at decisional level. All these functionalities must be versatile and generic enough to interact differently according to the missions while minimizing recoding effort. Moreover, deliberative functions like automated planning consume lots of memory and CPU time and usually complete in time incompatible with robotic missions' durations. Thus, we present a new generic and anytime planning concept for modular robotic architectures, which manages multiple planning requests at a time, solved in background, while allowing for reactive execution of planned actions at the same time. Different planners based on various formalisms and data structures can be plugged to the planning component without changing its behavior nor its code, facilitating reusability and validation of the component. We highlight the versatility of our concept on different use cases; then we demonstrate the efficiency of our approach in terms of mission duration and success, compared with traditional plan-then-execute approaches; we finally present a search and rescue mission by an autonomous rotorcraft solved with our paradigm, that cannot be tackled by traditional approaches.
- 1 May 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 299-304
A generic framework for anytime execution-driven planning in robotics
Robotic missions require to implement various functionalities in order to link reactive functions at actuators and sensors level to deliberative functions like vision, supervision and planning at decisional level. All these functionalities must be versatile and generic enough to interact differently according to the missions while minimizing recoding effort. Moreover, deliberative functions like automated planning consume lots of memory and CPU time and usually complete in time incompatible with robotic missions' durations. Thus, we present a new generic and anytime planning concept for modular robotic architectures, which manages multiple planning requests at a time, solved in background, while allowing for reactive execution of planned actions at the same time. Different planners based on various formalisms and data structures can be plugged to the planning component without changing its behavior nor its code, facilitating reusability and validation of the component. We highlight the versatility of our concept on different use cases; then we demonstrate the efficiency of our approach in terms of mission duration and success, compared with traditional plan-then-execute approaches; we finally present a search and rescue mission by an autonomous rotorcraft solved with our paradigm, that cannot be tackled by traditional approaches.
- 8 October 2010
- Published by Springer Nature in Autonomous Robots
- Vol. 30 (2) , 157-177
Learning the behavior model of a robot
- 8 October 2010
- Published by Springer Nature in Autonomous Robots
- Vol. 30 (2) , 157-177
Learning the behavior model of a robot
- 1 January 2010
- Published by IOS Press
- p. 50-62
POMDP solving: what rewards do you really expect at execution?
Partially Observable Markov Decision Processes have gained an increasing interest in many research communities, due to sensible improvements of their optimization algorithms and of computers capabilities. Yet, most research focus on optimizing either average accumulated rewards (AI planning) or direct entropy (active perception), whereas none of them matches the rewards actually gathered at execution. Indeed, the first optimization criterion linearly averages over all belief states, so that it does not gain best information from different observations, while the second one totally discards rewards. Thus, motivated by simple demonstrative examples, we study an additive combination of these two criteria to get the best of reward gathering and information acquisition at execution. We then compare our criterion with classical ones, and highlight the need to consider new hybrid non-linear criteria, on a realistic multi-target recognition and tracking mission.
- 1 January 2010
- Published by IOS Press
- p. 50-62
POMDP solving: what rewards do you really expect at execution?
Partially Observable Markov Decision Processes have gained an increasing interest in many research communities, due to sensible improvements of their optimization algorithms and of computers capabilities. Yet, most research focus on optimizing either average accumulated rewards (AI planning) or direct entropy (active perception), whereas none of them matches the rewards actually gathered at execution. Indeed, the first optimization criterion linearly averages over all belief states, so that it does not gain best information from different observations, while the second one totally discards rewards. Thus, motivated by simple demonstrative examples, we study an additive combination of these two criteria to get the best of reward gathering and information acquisition at execution. We then compare our criterion with classical ones, and highlight the need to consider new hybrid non-linear criteria, on a realistic multi-target recognition and tracking mission.
- 12 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 21 (1) , 92-107
SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases
Spatial probabilistic temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where a vehicle may be now or in the future. They express statements of the form "Object O is in spatial region R at some time t with some probability in the interval [L,U]." Past work on SPOT databases has developed selection operators based on selecting SPOT atoms that are entailed by the SPOT database-we call this "cautious" selection. In this paper, we study several problems. First, we note that the runtime of consistency checking and cautious selection algorithms in past work is influenced greatly by the granularity of the underlying Cartesian space. In this paper, we first introduce the notion of "optimistic" selection, where we are interested in returning all SPOT atoms in a database that are consistent with respect to a query, rather than having an entailment relationship. We then develop an approach to scaling SPOT databases that has three main contributions: 1) We develop methods to eliminate variables from the linear programs used in past work, thus greatly reducing the size of the linear programs used-the resulting advances apply to consistency checking, optimistic selection, and cautious selection. 2) We develop a host of theorems to show how we can prune the search space when we are interested in optimistic selection. 3) We use the above contributions to build an efficient index to execute optimistic selection queries over SPOT databases. Our approach is superior to past work in two major respects: First, it makes fewer assumptions than all past works on this topic except that in. Second, our experiments, which are based on real-world data about ship movements, show that our algorithms are much more efficient than those in.
- 12 May 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Knowledge and Data Engineering
- Vol. 21 (1) , 92-107
SPOT Databases: Efficient Consistency Checking and Optimistic Selection in Probabilistic Spatial Databases
Spatial probabilistic temporal (SPOT) databases are a paradigm for reasoning with probabilistic statements about where a vehicle may be now or in the future. They express statements of the form "Object O is in spatial region R at some time t with some probability in the interval [L,U]." Past work on SPOT databases has developed selection operators based on selecting SPOT atoms that are entailed by the SPOT database-we call this "cautious" selection. In this paper, we study several problems. First, we note that the runtime of consistency checking and cautious selection algorithms in past work is influenced greatly by the granularity of the underlying Cartesian space. In this paper, we first introduce the notion of "optimistic" selection, where we are interested in returning all SPOT atoms in a database that are consistent with respect to a query, rather than having an entailment relationship. We then develop an approach to scaling SPOT databases that has three main contributions: 1) We develop methods to eliminate variables from the linear programs used in past work, thus greatly reducing the size of the linear programs used-the resulting advances apply to consistency checking, optimistic selection, and cautious selection. 2) We develop a host of theorems to show how we can prune the search space when we are interested in optimistic selection. 3) We use the above contributions to build an efficient index to execute optimistic selection queries over SPOT databases. Our approach is superior to past work in two major respects: First, it makes fewer assumptions than all past works on this topic except that in. Second, our experiments, which are based on real-world data about ship movements, show that our algorithms are much more efficient than those in.
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19449445,p. 502-509
Rackham: An Interactive Robot-Guide
Rackham is an interactive robot-guide that has been used in several places and exhibitions. This paper presents its design and reports on results that have been obtained after its deployment in a permanent exhibition. The project is conducted so as to incrementally enhance the robot functional and decisional capabilities based on the observation of the interaction between the public and the robot. Besides robustness and efficiency in the robot navigation abilities in a dynamic environment, our focus was to develop and test a methodology to integrate human-robot interaction abilities in a systematic way. We first present the robot and some of its key design issues. Then, we discuss a number of lessons that we have drawn from its use in interaction with the public and how that will serve to refine our design choices and to enhance robot efficiency and acceptability
- 1 September 2006
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 19449445,p. 502-509
Rackham: An Interactive Robot-Guide
Rackham is an interactive robot-guide that has been used in several places and exhibitions. This paper presents its design and reports on results that have been obtained after its deployment in a permanent exhibition. The project is conducted so as to incrementally enhance the robot functional and decisional capabilities based on the observation of the interaction between the public and the robot. Besides robustness and efficiency in the robot navigation abilities in a dynamic environment, our focus was to develop and test a methodology to integrate human-robot interaction abilities in a systematic way. We first present the robot and some of its key design issues. Then, we discuss a number of lessons that we have drawn from its use in interaction with the public and how that will serve to refine our design choices and to enhance robot efficiency and acceptability