Max Robotics — Global Service Robot Directory + US Certification

About

Frank Imeson is a leading researcher in robotic path planning and multi-robot coordination, with a focus on solving complex, high-level tasks in discrete and partially unknown environments. His major contributions include pioneering the SAT-TSP language, which integrates Boolean satisfiability constraints with the Traveling Salesman Problem to express and solve intricate path planning problems—a framework that has become foundational for specifying constraints like task allocation, ordering, and counting in robotic missions. Imeson’s work on optimal coverage path planning, particularly for non-convex environments, has advanced the efficiency of indoor robotic operations by minimizing turns, while his anytime replanning methods enable robots to adapt coverage paths in real-time as unknown obstacles are discovered. With over 80 citations across his most-cited papers, his research has had a tangible impact on the field, notably through the development of SMT-based approaches for multi-robot motion planning with complex constraints. His 2018 thesis, *Robotic Path Planning for High-Level Tasks in Discrete Environments*, synthesizes these innovations, offering robust solutions for task allocation and efficient path generation in multi-robot systems.