I have been a research scientist at ONERA since september 2009, in the Systems Control and Flight Dynamics (DCSD) department, Control and Decision (CD) research unity. I was previously an associate professor at the Academic Institute of Technology of Lens (IUT de Lens), and a researcher at the Research Centre in Computer Science of Lens (CRIL), University of Artois. Prior to this I was an assistant professor at the University Paul Sabatier where I obtained a PhD in computer science at the Research Institute in Computer Science of Toulouse (IRIT).
My main research interests are Automated Planning in Artificial
Intelligence, Heuristic Search and Constraint Programming.
June 2011. The DAEyahsp planner, with Johann Dréo, Pierre Savéant and Marc Schoenauer, has been the
winner of the Deterministic Temporal Satisficing Track
at the 7th International Planning Competition (IPC-2011). This work is developed in the
DESCARWIN project
supported by the French National Research Agency (ANR).
June 2011. The YAHSP2-MT planner has been
runner-up ex-aequo in the Deterministic Temporal
Satisficing Track at the 7th International Planning Competition (IPC-2011). This work
is developed in the DESCARWIN project
supported by the French National Research Agency (ANR).
July 2010. The work about the DAEx planner, with Jacques Bibaï, Pierre Savéant and Marc Schoenauer, got a Silver
Medal at the 7th Annual Humies Awards for Human-Competitive Results Produced by Genetic and Evolutionnary Computation Held at the Genetic and Evolutionnary Computation Conference (HUMIES-2010).
Contact information
Vincent Vidal
ONERA — DCSD
2, avenue Edouard Belin
BP 74025
31055 TOULOUSE Cedex 4, FRANCE
Research scientist, ONERA, Toulouse. Department: Systems Control and Flight Dynamics (DCSD). Research unity: Control and Decision (CD).
sep. 2003 — aug. 2009
Associate professor, Academic Institute of Technology of Lens (IUT de Lens), University of Artois. Research lab: Research Centre in Computer Science of Lens (CRIL).
sep. 1998 — jan. 2003
Assistant professor, University Paul Sabatier, Toulouse. Research lab: Research Institute in Computer Science of Toulouse (IRIT).
Education
1998 — 2001
PhD in computer science (specialty Artificial Intelligence), University Paul Sabatier, Toulouse. Title: “Recherche dans les graphes de planification, satisfiabilité et stratégies de moindre engagement—Les systèmes LCGP et LCDPP” (Search in planning graphs, satisfiability and least commitment strategies—The LCGP and LCDPP systems). Research lab: Research Institute in Computer Science of Toulouse (IRIT). Advisor:Michel Cayrol, assisted by Pierre Régnier.
1997 — 1998
Master (specialty Knowledge Representation and Reasoning Formalization), University Paul Sabatier, Toulouse. Research lab: Research Institute in Computer Science of Toulouse (IRIT). Advisor:Pierre Régnier.
Awards
2011
Winner of the Deterministic Temporal Satisficing Track with the DAEyahsp planner, 7th International Planning Competition (IPC-2011), Freiburg, Germany, June 2011.
2011
Runner-up ex-aequo of the Deterministic Temporal Satisficing Track with the YAHSP2-MT planner, 7th International Planning Competition (IPC-2011), Freiburg, Germany, June 2011.
2010
Silver Medal for the work about the DAEx planner at the 7th Annual Humies Awards for Human-Competitive Results Produced by Genetic and Evolutionnary Computation Held at the Genetic and Evolutionnary Computation Conference (HUMIES-2010), Portland, OR, USA, July 2010.
2006
Distinguished performance for the CPT planner in Optimal Track (Temporal Domains), 5th International Planning Competition (IPC-2006), Ambleside, UK, June 2006.
2004
2nd place for the YAHSP planner in Suboptimal Propositional Track, 4th International Planning Competition (IPC-2004), Whistler, BC, Canada, June 2004.
2004
2nd place for the CPT planner in Optimal Track, 4th International Planning Competition (IPC-2004), Whistler, BC, Canada, June 2004.
Contracts & Grants
2009 — …
Leader at the ONERA level of the DESCARWIN project funded by the French National Research Agency (ANR) under the COSINUS call. Theme: “Evolutionary planning”, coordinated by Thales TRT. Partners: INRIA/TAO, Onera, Thales TRT.
2006 — 2009
Industrial contract with the Parisian Company of Urban Transportation (RATP). Theme: “Recomposition and optimization of the timetable for public urban transportation regulation”.
2005 — 2009
Leader of the PLANEVO project funded by the French National Research Agency (ANR) under the “Young Researchers” call. Theme: “Planning under uncertainty in a dynamic environment”.
1998 — 2001
Scolarship PhD grant from the French Ministry of Education, Research and Technology (“bourse MENRT”).
Students
2011 — …
Simon Vernhes, PhD, “Planification distribuée” (Distributed Planning). Co-directed with Guillaume Infantes (Onera, DCSD) and Éric Noulard (Onera, DTIM).
2003 — 2008
Zied Loukil, PhD, “Intégration des ressources en planification temporelle optimale” (Resources integration in optimal temporal planning), defended on 12 december 2008. Co-directed with Pierre Marquis (CRIL, University or Artois) and Abdelmajid Ben Hamadou (University of Sphax, Tunisia). Zied is actually associate professor at University of Sfax, Tunisia.
2005 — 2007
Sébastien Tabary, PhD, “Les conflits en programmation par contraintes—Application à la planification” (Conflicts in Constraint Programming—application to Planning), defended on 22 november 2007. Co-directed with Christophe Lecoutre and Lakhdar Saïs (CRIL, University or Artois). Sébastien is actually associate professor at University of Artois.
2005
Sébastien Tabary, Master, “Pondération des heuristiques pour une approche de la planification en programmation par contraintes” (Weighted heuristics for a constraint programming approach). Co-directed with Christophe Lecoutre and Lakhdar Saïs (CRIL, University or Artois).
2004
Élise Bonzon, Master, “Planification par recherche heuristique dans les espaces d'états” (Planning by heuristic search in the space of states). Co-directed with Pierre Régnier (IRIT, University Paul Sabatier).
2003
Zied Loukil, Master, “Planification dans l'incertain avec observabilité nulle : Approche par compilation” (Planning under uncertainty with no observability: and approach by compilation). Co-directed with Pierre Marquis (CRIL, University of Artois).
2002
Frédéric Maris, Master, “Traduction et étude comparative de codages SAT pour la planification” (Compilation and comparative study of SAT encodings of planning). Co-directed with Pierre Régnier (IRIT, University Paul Sabatier).
2002
Marjorie Couzinier, Master, “Prise en compte des interactions dans les espaces d'états pour l'amélioration de la recherche heuristique” (Interaction handling in state space for improving heuristic search). Co-directed with Pierre Régnier (IRIT, University Paul Sabatier).
Committees
Program committees:
23rd International Joint Conference on Artificial Intelligence (IJCAI-2013), Beijing, China, August 2013.
23rd International Conference on Automated Planning and Scheduling (ICAPS-2013), Rome, Italy, June 2013.
8th International Workshop on Constraint Reasoning, Planning and Scheduling Problems for a Sustainable Future (GREEN-COPLAS-2013), Beijing, China, June 2013.
11th ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2013), Rome, Italy, June 2013.
11st ICAPS Workshop on Evolutionary Techniques in Planning and Scheduling (EVOPS-2013), Rome, Italy, June 2013.
8èmes Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2013), Lille, France, July 2013.
7èmes Journées de l'Intelligence Artificielle Fondamentale (JIAF-2013), Aix-en-Provence, France, June 2013.
22nd International Conference on Automated Planning and Scheduling (ICAPS-2012), Atibaia, Sao Paulo, Brazil, June 2012.
5th Symposium on Combinatorial Search (SOCS-2012), Niagara Falls, Canada, July 2012.
5th Symposium of the Many-core Applications Research Community (MARC-2012), Toulouse, France, July 2012.
7th ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2012), Atibaia, Brazil, June 2012.
7èmes Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2012), Nancy, France, May 2012.
6èmes Journées de l'Intelligence Artificielle Fondamentale (JIAF-2012), Toulouse, France, May 2012.
4th Symposium on Combinatorial Search (SOCS-2011), Cardona, Spain, July 2011.
25th AAAI Conference on Artificial Intelligence (AAAI-2011), San Francisco, CA, USA, August 2011.
21st International Conference on Automated Planning and Scheduling (ICAPS-2011), Freiburg, Germany, June 2011.
22nd International Joint Conference on Artificial Intelligence (IJCAI-2011), Barcelona, Spain, July 2011.
6th ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2011), Freiburg, Germany, June 2011.
3rd ICAPS Workshop on Heuristics for Domain-independent Planning (HDIP-2011), Freiburg, Germany, June 2011.
5èmes Journées de l'Intelligence Artificielle Fondamentale (JIAF-2011), Lyon, France, June 2011.
22nd International Conference on Tools with Artificial Intelligence (ICTAI-2010), Arras, France, October 2010.
19th European Conference on Artificial Intelligence (ECAI-2010), Lisbon, Portugal, August 2010.
24th AAAI Conference on Artificial Intelligence (AAAI-2010), Atlanta, GA, USA, July 2010.
20th International Conference on Automated Planning and Scheduling (ICAPS-2010), Toronto, ON, Canada, May 2010.
5th ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2010), Toronto, ON, Canada, May 2010.
17ème Congrès francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle (RFIA-2010), Caen, France, January 2010.
5èmes Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2010), Besançon, France, June 2010.
4th ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2009), Thessaloniki, Greece, September 2009.
18th European Conference on Artificial Intelligence (ECAI-2008), Patras, Greece, July 2008.
3èmes Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2008), Metz, France, June 2008.
16ème Congrès francophone AFRIF-AFIA de Reconnaissance des Formes et Intelligence Artificielle (RFIA-2008), Amiens, France, January 2008.
3èmes Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2008), Metz, France, June 2008.
1st ICAPS Workshop on Heuristics for Domain-independent Planning (HDIP-2007), Providence, RI, USA, September 2007.
2nd ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2007), Providence, RI, USA, September 2007.
2èmes Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2007), Grenoble, France, July 2007.
17th European Conference on Artificial Intelligence (ECAI-2006), Riva del Garda, Italy, August 2006.
1st ICAPS Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems (COPLAS-2006), Cumbria, UK, June 2006.
1ères Journées Francophones Planification, Décision, Apprentissage pour la conduite de systèmes (JFPDA-2006), Toulouse, France, May 2006.
2èmes Journées Francophones de Programmation par Contraintes (JFPC-2006), Nîmes, France, June 2006.
IJCAI-2005 Workshop on Planning and Learning in A Priori Unknown or Dynamic Domains (link), Edinburgh, UK, August 2005.
1ères Journées Francophones de Programmation par Contraintes (JFPC-2005), Lens, France, June 2005.
7èmes Rencontres des Jeunes Chercheurs en Intelligence Artificielle (RJCIA-2005), Nice, France, May 2005.
CPT (which stands for “Constraint Programming Temporal
planner”) is a planning system for optimal temporal STRIPS
planning. It combines a branching scheme based on Partial Order Causal
Link (POCL) Planning with powerful and sound pruning rules implemented as
constraints.
The development of CPT is motivated by the limitation of heuristic
state approaches to parallel and temporal planning that suffer from a high
branching factor (cf. HSP* family of planners) and
thus have difficulties matching the performance of planners built on SAT
techniques such as SATPLAN.
In CPT, all branching decisions (resolution of open supports, support
threats, and mutex threats), generate binary splits, and nodes in the
search correspond to “partial plans” very much as in POCL
planning.
The CPT planner is implemented using the Choco CP library that operates
on top of Claire, a
high-level programming language that compiles into C++. Further details
can be found in the AAAI-2004 paper
that is concerned mostly with the computation of optimal canonical plans;
plans where no ground action is done more than once. The version of CPT
on this page removes this restriction, and computes optimal temporal
plans, whether canonical or not. Currently, the semantics of these plans
follows the one in (Smith and Weld, IJCAI-99) where interfering actions
are not allowed to overlap in time. This condition has been relaxed in
PDDL 2.1 where interfering actions may overlap sometimes (e.g., when
preconditions do not have to be preserved throughout the execution of the
action).
Papers
This work has been published at the AAAI-2004 conference, at the
Workshop on “Integrating Planning Into Scheduling” WIPIS-2004
held in conjunction with ICAPS-2004
[ps]
[ps.gz]
[pdf]
and in the Artificial Intelligence Journal
[ps]
[ps.gz]
[pdf].
It is also published in the french conference JNPC-2004
[ps]
[ps.gz]
[pdf].
Awards
Distinguished performance for the CPT
planner in Optimal Track (Temporal Domains), 5th International Planning Competition (IPC-2006), Ambleside, UK, June 2006.
2nd place in Optimal Track, 4th International Planning Competition (IPC-2004), Whistler, BC, Canada, June 2004.
Downloads
You can find here the source code and some binary versions of our
planning system. The source package also contains the original source code
of Claire required for the
compilation of CPT, plus the tailored version of Choco that we use. It should
compile on any platform where Claire can be compiled, that is at least
Linux, Windows, Solaris...
YAHSP (which stands for “Yet Another
Heuristic Search Planner”) is a planning system for
non-optimal STRIPS planning. It is based on recent ideas from
the planning as heuristic search framework, initiated by the
planners ASP and
HSP from Blai Bonet and Hector Geffner.
The heuristic is computed in a way very similar to Jörg
Hoffmann's FF planner, but
used in different ways. We introduce a novel way for extracting
information from the computation of the heuristic and for
tackling with helpful actions, by considering the high quality
of the plans computed by the heuristic function in numerous
domains. For each evaluated state, we employ actions from these
plans in order to find the beginning of a valid plan that can
lead to a reachable state, that will often bring us closer to
a solution state. The lookahead state thus calculated is then
added to the list of nodes that can be chosen to be developed
following the numerical value of the heuristic. We use this
lookahead strategy in a complete best-first search algorithm,
modified in order to take into account helpful actions by
preferring nodes that can be developed with such actions over
nodes that can be developed with actions not considered as
helpful.
We provide below an empirical evaluation which demonstrates
that in numerous planning benchmark domains, the performance of
heuristic search planning and the size of the problems that can
be handled have been drastically improved, while in more
“difficult” domains these strategies remain
interesting even if they sometimes degrade plan quality.
Papers
Here is a technical report describing the YAHSP planning system:
[ps.gz]
[pdf].
This work has also been published at the poster session of IJCAI-2003
[ps]
[ps.gz]
[pdf],
at ICAPS-2004
[ps]
[ps.gz]
[pdf],
and at the french conference RFIA-2004
[ps]
[ps.gz]
[pdf].
Award
2nd place in Suboptimal Propositional Track, 4th International Planning Competition (IPC-2004), Whistler, BC, Canada, June 2004.
Downloads
You can find here bytecode and binary versions of my planning
system. Source code is not available yet.
Version 1.1 : it is the version used in the competition
IPC-2004.
O'Caml Bytecode: runs
on all plateforms where Objective Caml runtime librairies (>= 3.06)
are installed.
Linux x86 binary:
runs on PC workstations under Linux (tested with Debian GNU/Linux
3.0).
Linux sparc binary:
runs on SUN workstations under Linux (tested with Debian GNU/Linux
3.0).
Windows binary: runs
on PC workstations under Windows (tested with Windows XP).
Version 1.0 : it's the version used for the papers IJCAI-2003 and
ICAPS-2004.
O'Caml Bytecode: runs on
all plateforms where Objective Caml runtime librairies (>= 3.06) are
installed.
Linux x86 binary: runs on
PC workstations under Linux (tested with Debian GNU/Linux 3.0).
SunOS binary: runs on SUN
workstations under SunOS (tested with SunOS 5.8).
Windows binary: runs on PC
workstations under Windows (tested with Windows 98, NT, XP).
Proceedings of the ICAPS-2013 Workshop on Evolutionary Techniques in Planning and Scheduling. Magali Barbier, Valentina Poggioni, Marc Schoenauer, Vincent Vidal (editors), 11st ICAPS Workshop on Evolutionary Techniques in Planning and Scheduling (EVOPS-2013), 2013.
Comparaison expérimentale entre UCPOP et VVPLAN, un planificateur d'ordre total pour ADL. V. Vidal, P. Régnier, Technical Report 98-30-R-1, 1999.
Contribution à l'amélioration de GRAPHPLAN. Formalisation, critique, modification : LCGP. V. Vidal, M. Cayrol, P. Régnier, Technical Report 99-12-R-2, 1999.
Comparaison entre la planification dans les espaces d'états et dans les espaces de plans. V. Vidal, Master's thesis, 1998.
Music
ManBuss
In my spare time I play bass in a rock band, ManBuss…