Servet B. Bayraktar
Papers
1
Total Citations
4
H-Index
1
About
Servet B. Bayraktar is a roboticist whose work lies at the intersection of motion planning, manipulation, and combinatorial reasoning. His primary research focus is on developing efficient algorithms for complex rearrangement problems—tasks where objects must be moved into target configurations, often under physical constraints like occlusion or limited workspace. In his most-cited work, "Solving Rearrangement Puzzles Using Path Defragmentation in Factored State Spaces" (2023, 4 citations), Bayraktar introduces a novel approach that treats rearrangement puzzles—where objects are logically linked—as factored state spaces. By decomposing the problem into smaller, manageable subproblems and using a path-defragmentation strategy, his method dramatically reduces computational complexity compared to traditional planning. This contribution is significant because it bridges the gap between theoretical motion planning and practical manipulation in cluttered environments, with potential applications in warehouse automation, home robotics, and assembly tasks. Bayraktar’s work is notable for its elegant combination of graph theory and robotics, offering a scalable framework that could inspire future research in task-and-motion planning.
Research Focus
Key Achievements
Top Papers
- 1