Implementation of a solution to the Hanoi Towers Problem using an ABB robot (IRB120_3_58) and programmed in RAPID language using recursion, for the robot programming subject of my robotics MSc.
- ABB RobotStudio 2023.2 version.
- ABB RobotStudio premium license (there is a month trial for free).
- RobotWare 6.10.01
- Tool with the geometry provided by RobotStudio.
- Intelligent tool 'AspiradorInteligente', for the Pick and Place of the disks, as a vacuum gripper tool.
- Station logic, creating the necessary digital signals to communicate the robot controller and our intelligent tool.
- Hanoi Towers problem implemented using recursion, available in the 'Module1.mod' file.
- Intelligent tool components and logic: I have developed with geometry the piece with a cone, two cylinders and performed the subtraction operation in order to have a small hole in the tip to simulate the shape of the vacuum gripper. Then, it has to be used this piece to create a tool, and with this new tool, it has to be used for creating the smart component, with a Line Sensor for detecting the disks, an Attacher for holding the disks, a NOT Logic Gate, an Dettacher for placing the disks on each tower, and a Logic SR Latch, as you can see in the following figure.
- Station logic: In order to be able to communicate our intelligent tool (the vacuum gripper), we need to communicate them using signals, it is needed to create at least two signals in our controller, holding as a Digital Input, and hold as a Digital Output, which will be connected as follows in the next figure with the input and output of the intelligent tool.
My implementation basically consists in the use of the classical recursion solution, it is a general solution, so if you want to add more disks, you can place more in the first tower and change the variable N with the total number of disks to solve the problem.
However this solution is adapted to use my intelligent tool with the previously created digital signals, and taking into account six possible moves for the disk picked depending on where the disk has to be picked and where it has to be placed.
Another consideration about my implementation, is that it also takes into account the number of disks for each iteration with three global variables that count the number of disks in each tower.
The code can be visuallized in the 'Module1.mod' file.
React
Typescript
Django
Laravel
Facebook
Microsoft
Google
Alibaba
D3
Tencent