Antoine Vigneron

About

Antoine Vigneron is a leading researcher in computational geometry, with a primary focus on path planning, motion planning, and geometric optimization. His most influential work addresses the fundamental challenge of computing shortest paths under complex constraints. His 2008 paper on "Approximate Shortest Paths in Anisotropic Regions" (31 citations) provides a landmark algorithm for navigating a point robot through planar subdivisions where distances vary by direction and region, a problem critical to robotics and geographic information systems. Vigneron has also made significant contributions to understanding reachability under curvature constraints, notably in his 2000 and 2011 papers on paths of bounded curvature within convex polygons (totaling 26 citations), which characterize the set of points reachable by a robot with turning limitations. More recently, he has tackled coordinated multi-robot path planning, applying local search and simulated annealing to solve complex collision-free navigation problems on integer grids. His work bridges theoretical guarantees with practical algorithmic design, earning him recognition in the computational geometry community and providing foundational tools for autonomous navigation and spatial computing.

Research Focus

Key Achievements

Top Papers

1. 1
   Approximate Shortest Paths in Anisotropic Regions

   31 citations · 2008
2. 2
   Reachability by paths of bounded curvature in a convex polygon

   15 citations · 2011
3. 3
   Reachability by paths of bounded curvature in convex polygons

   11 citations · 2000
4. 4
   Coordinated Path Planning through Local Search and Simulated Annealing

   2 citations · 2022

Key Collaborators

Contact & Links