Christine Solnon

Université Claude Bernard Lyon 1, Institut National des Sciences Appliquées de Lyon

Papers

Total Citations

H-Index

About

Christine Solnon is a leading researcher in combinatorial optimization and graph algorithms, with a particular focus on robotics applications. Her work bridges theoretical computer science and practical engineering, most notably through her contributions to path planning for tethered robots—a critical area for underwater and disaster recovery missions. In her highly cited 2013 paper, she developed polynomial algorithms for open plane graph and subgraph isomorphisms, establishing foundational methods for graph matching. More recently, Solnon has pioneered coverage path planning (CPP) for tethered robots, addressing the complex challenge of cable constraints and forbidden zones. Her 2023 work on non-crossing anonymous multi-agent path finding (MAPF) introduces novel solutions for coordinating multiple tethered robots while maintaining safety distances, achieving minimal makespan. With papers accumulating citations in the tens, Solnon's research has direct impact on autonomous systems operating in constrained environments. Her algorithms enable robots to navigate efficiently while tethered, solving real-world problems in exploration and rescue operations. Solnon's work exemplifies how graph theory and optimization can drive practical robotics innovations.