Abstract
With recent advances in robotics, various methods and systems for robotic movement planning have gained popularity. In particular, the problem of planning of pick and move operations for the robotic sorting cells has drawn certain attention because new strategies and algorithms become a necessity as a robotic sorting systems application area extends. In the present work, a new algorithm for optimization of sorting operation sequences is proposed and results of its testing on a computer simulation are presented. The algorithm is based on the state tree search method and is aimed for performance improvement of the systems in which the input load can exceed the capacity of the robotic manipulator.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have