Vincent Vidal

40 papers A* 9A 5B 6C 2Journal 8Unranked 8
YearRankTypeTitle / Venue / Authors
2021 B conf
A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming.
CPAIOR
Marvin Stanczak, Cédric Pralet, Vincent Vidal, Vincent Baudoui
2020 C conf
Optimal Pipe Routing Techniques in an Obstacle-Free 3D Space.
ICORES
Marvin Stanczak, Cédric Pralet, Vincent Vidal, Vincent Baudoui
2020 — ch.
Planning in Artificial Intelligence.
A Guided Tour of Artificial Intelligence Research (2) (II)
Régis Sabbadin, Florent Teichteil-Königsbuch, Vincent Vidal
2016 B conf
Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing.
CPAIOR
Eliott Roynette, Bertrand Cabon, Cédric Pralet, Vincent Vidal
2015 — conf
Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve.
LION
Alexandre Quemy, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2015 — conf
Using hybrid planning for plan reparation.
ECMR
Patrick Bechon, Magali Barbier, Charles Lesire, Guillaume Infantes, Vincent Vidal
2014 — conf
HiPOP: Hierarchical Partial-Order Planning.
STAIRS
Patrick Bechon, Magali Barbier, Guillaume Infantes, Charles Lesire, Vincent Vidal
2013 J jnl
Multi-Objective AI Planning: Comparing Aggregation and Pareto Approaches
CoRR
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2013 B conf
Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches.
EvoCOP
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2013 C conf
Multi-objective AI Planning: Evaluating DaE YAHSP on a Tunable Benchmark.
EMO
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2013 A* conf
Pareto-Based Multiobjective AI Planning.
IJCAI
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2013 A* conf
Problem Splitting Using Heuristic Search in Landmark Orderings.
IJCAI
Simon Vernhes, Guillaume Infantes, Vincent Vidal
2013 J jnl
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning
CoRR
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2013 — conf
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning.
LION
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2012 J jnl
Multi-Objective AI Planning: Evaluating DAE-YAHSP on a Tunable Benchmark
CoRR
Mostepha Redouane Khouadjia, Marc Schoenauer, Vincent Vidal, Johann Dréo, Pierre Savéant
2012 — conf
The Landmark-based Meta Best-First Search Algorithm for Classical Planning.
STAIRS
Simon Vernhes, Guillaume Infantes, Vincent Vidal
2011 A* conf
Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends.
AAAI
Florent Teichteil-Königsbuch, Vincent Vidal, Guillaume Infantes
2011 A conf
Parallel divide-and-evolve: experiments with OpenMP on a multicore machine.
GECCO
Caner Candan, Johann Dréo, Pierre Savéant, Vincent Vidal
2010 B conf
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning.
SOCS
Vincent Vidal, Lucas Bordeaux, Youssef Hamadi
2010 A* conf
An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning.
ICAPS
Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal
2010 B conf
On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme.
EvoCOP
Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal
2010 A conf
On the generality of parameter tuning in evolutionary planning.
GECCO
Jacques Bibai, Pierre Savéant, Marc Schoenauer, Vincent Vidal
2009 J jnl
Reasoning from last conflict(s) in constraint programming.
Artif. Intell.
Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
2008 — ch.
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms.
Advances in Metaheuristics for Hard Optimization
Marc Schoenauer, Pierre Savéant, Vincent Vidal
2007 A conf
Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance.
CP
Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
2007 A* conf
Nogood Recording from Restarts.
IJCAI
Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
2007 J jnl
Recording and Minimizing Nogoods from Restarts.
J. Satisf. Boolean Model. Comput.
Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
2007 A* conf
Transposition Tables for Constraint Satisfaction.
AAAI
Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
2006 J jnl
Branching and pruning: An optimal temporal POCL planner based on constraint programming.
Artif. Intell.
Vincent Vidal, Hector Geffner
2006 B conf
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning.
EvoCOP
Marc Schoenauer, Pierre Savéant, Vincent Vidal
2006 J jnl
Divide-and-Evolve: a New Memetic Scheme for Domain-Independent Temporal Planning
CoRR
Marc Schoenauer, Pierre Savéant, Vincent Vidal
2006 A conf
Last Conflict Based Reasoning.
ECAI
Christophe Lecoutre, Lakhdar Sais, Sébastien Tabary, Vincent Vidal
2006 — conf
Les ressources et la planification temporelle.
INFORSID
Zied Loukil, Abdelmajid Ben Hamadou, Pierre Marquis, Vincent Vidal
2005 A conf
Solving Simple Planning Problems with More Inference and No Search.
CP
Vincent Vidal, Hector Geffner
2004 A* conf
A Lookahead Strategy for Heuristic Search Planning.
ICAPS
Vincent Vidal
2004 A* conf
Branching and Pruning: An Optimal Temporal POCL Planner Based on Constraint Programming.
AAAI
Vincent Vidal, Hector Geffner
2003 A* conf
A lookahead strategy for solving large planning problems.
IJCAI
Vincent Vidal
2001 J jnl
Least commitment in Graphplan.
Artif. Intell.
Michel Cayrol, Pierre Régnier, Vincent Vidal
2000 — conf
New Results about LCGP, a Least Committed GraphPlan.
AIPS
Michel Cayrol, Pierre Régnier, Vincent Vidal
1999 — conf
Total Order Planning is More Efficient than we Thought.
AAAI/IAAI
Vincent Vidal, Pierre Régnier