Vincent Vidal

Affiliations:
  • ONERA-DCSD, Toulouse, France
  • Academic Institute of Technology of Lens, France (former)
  • University of Artois, France (former)
  • University Paul Sabatier, Toulouse, France (former)


According to our database1, Vincent Vidal authored at least 34 papers between 1999 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
A Pipe Routing Hybrid Approach Based on A-Star Search and Linear Programming.
Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2021

2020
Optimal Pipe Routing Techniques in an Obstacle-Free 3D Space.
Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, 2020

2016
Designing Spacecraft Command Loops Using Two-Dimension Vehicle Routing.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2016

2015
Solving Large MultiZenoTravel Benchmarks with Divide-and-Evolve.
Proceedings of the Learning and Intelligent Optimization - 9th International Conference, 2015

Using hybrid planning for plan reparation.
Proceedings of the 2015 European Conference on Mobile Robots, 2015

2014
HiPOP: Hierarchical Partial-Order Planning.
Proceedings of the STAIRS 2014, 2014

2013
Quality Measures of Parameter Tuning for Aggregated Multi-Objective Temporal Planning.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Problem Splitting Using Heuristic Search in Landmark Orderings.
Proceedings of the IJCAI 2013, 2013

Pareto-Based Multiobjective AI Planning.
Proceedings of the IJCAI 2013, 2013

Multi-objective AI Planning: Comparing Aggregation and Pareto Approaches.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2013

Multi-objective AI Planning: Evaluating DaE YAHSP on a Tunable Benchmark.
Proceedings of the Evolutionary Multi-Criterion Optimization, 2013

2012
The Landmark-based Meta Best-First Search Algorithm for Classical Planning.
Proceedings of the STAIRS 2012, 2012

2011
Parallel divide-and-evolve: experiments with OpenMP on a multicore machine.
Proceedings of the 13th Annual Genetic and Evolutionary Computation Conference, 2011

Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Adaptive K-Parallel Best-First Search: A Simple but Efficient Algorithm for Multi-Core Domain-Independent Planning.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

On the generality of parameter tuning in evolutionary planning.
Proceedings of the Genetic and Evolutionary Computation Conference, 2010

On the Benefit of Sub-optimality within the Divide-and-Evolve Scheme.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2010

An Evolutionary Metaheuristic Based on State Decomposition for Domain-Independent Satisficing Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
Reasoning from last conflict(s) in constraint programming.
Artif. Intell., 2009

2008
Divide-and-Evolve: a Sequential Hybridization Strategy Using Evolutionary Algorithms.
Proceedings of the Advances in Metaheuristics for Hard Optimization, 2008

2007
Recording and Minimizing Nogoods from Restarts.
J. Satisf. Boolean Model. Comput., 2007

Nogood Recording from Restarts.
Proceedings of the IJCAI 2007, 2007

Exploiting Past and Future: Pruning by Inconsistent Partial State Dominance.
Proceedings of the Principles and Practice of Constraint Programming, 2007

Transposition Tables for Constraint Satisfaction.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Branching and pruning: An optimal temporal POCL planner based on constraint programming.
Artif. Intell., 2006

Les ressources et la planification temporelle.
Proceedings of the Actes du XXIVème Congrès INFORSID, Hammamet, Tunisie, 31 mai, 2006

Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2006

Last Conflict Based Reasoning.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

2005
Solving Simple Planning Problems with More Inference and No Search.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
A Lookahead Strategy for Heuristic Search Planning.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

2003
A lookahead strategy for solving large planning problems.
Proceedings of the IJCAI-03, 2003

2001
Least commitment in Graphplan.
Artif. Intell., 2001

2000
New Results about LCGP, a Least Committed GraphPlan.
Proceedings of the Fifth International Conference on Artificial Intelligence Planning Systems, 2000

1999
Total Order Planning is More Efficient than we Thought.
Proceedings of the Sixteenth National Conference on Artificial Intelligence and Eleventh Conference on Innovative Applications of Artificial Intelligence, 1999


  Loading...