Max Robotics — Global Service Robot Directory + US Certification

About

Aleksandar Shurbevski is a researcher specializing in combinatorial optimization and robotics, with a particular focus on approximation algorithms for routing problems in automated manufacturing. His major contributions center on the development of constant-factor approximation algorithms for repetitive routing problems involving grasp-and-delivery robots in printed circuit board (PC board) assembly lines. In his most-cited work, "An Approximation Algorithm with Factor Two for a Repetitive Routing Problem of Grasp-and-Delivery Robots" (2011, 4 citations), Shurbevski addresses the challenge of efficiently arranging identical pins during transitions, achieving a provable factor-two performance guarantee. His subsequent papers, including "Constant Factor Approximation Algorithms for Repetitive Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit Boards" (2012, 3 citations) and "Approximating Cyclic Routing Problems of Grasp-and-Delivery Robots in Production of Printed Circuit Boards" (2011, 3 citations), extend these results to multi-board scenarios and cyclic routing, demonstrating robust theoretical foundations for practical automation. While his citation counts are modest, Shurbevski’s work is notable for bridging theoretical computer science with real-world industrial applications, offering provably optimal solutions that enhance efficiency in electronics manufacturing. His research is particularly valuable for students and engineers interested in algorithm design for robotics and logistics.