[Austin Adee] came into some drill bits. A lot of them actually. But when thousands of assorted sizes are delivered in one disorganized box, are they actually useful? Not unless you’re drilling holes where diameter doesn’t matter.
So two projects were at hand: finding a place to store a few hundred different sizes of bits, and tackling the actual sorting itself. In the end, he used input from a digital caliper alongside a Python script that showed him where to put them.
The start of the tray design process was a bit of a research project, establishing the common sizes and how many would fit into a given space. This data was used to spin up the layout for trays with 244 different pockets to hold the bits. The pockets were CNC milled, but getting labels for each to work with the laser engraver was a bit of a hack. In the end, filling in the letters with white crayon really makes them pop, despite [Austin’s] dissatisfaction with the level of contrast.
But wait, we promised you an epic sorting hack! Unfortunately there’s no hopper, vibration feed, and sorting gantry that did this for him (now if it were perler beads he’d have been all set). Still, the solution was still quite a clever one.
A set of digital calipers with a Bluetooth connection sends the dimension back to a python script every time you press the capture button. That script find the pocket for the nearest size and then highlights it on a map of the drill bit drawer displayed on the computer monitor. In the end the trays fit into a wide tool chest drawer, and are likely to keep things organized through exactly one project before everything is once again in disarray.
[Austin] mentions a lag of up to one second for the Bluetooth calipers to do their thing. For assembly-line style work, that adds up. We remember seeing a really snappy reaction time on these digital calipers hacked for wireless entry.
In our opinion, the primary evidence of a properly lived childhood is an enormous box of every conceivable Lego piece, from simple bricks to girders and gears, all with a small town’s worth of minifigs swimming through it. It takes years of birthdays and Christmases to accumulate a Lego collection best measured by the pound, but like anything worth doing, it’s worth overdoing.
But what to do with such a collection? Digging through it to find Just the Right Piece™ can be frustrating, and bringing order to the chaos with manual sorting is just so impractical. How about putting some of those bricks to work with a machine-vision Lego sorter built from Lego?
[Daniel West]’s approach is hardly new – we’ve even featured brick-built Lego sorters before – but we’re impressed by its architecture. First, the mechanical system is amazing. It uses a series of conveyors to transport bricks from a hopper, winnowing the stream down as it goes. The final step is a vibratory feeder that places one piece on a conveyor at a time. Those pass under a camera attached to a Raspberry Pi, where OpenCV does background subtraction from the video stream, applies bounding boxes to the parts, and runs the images through a convolutional neural network (CNN) that’s been trained on a database of every Lego part. Servo-controlled gates then direct the parts into one of 18 bins. See it in action in the video below.
We must admit that we’re not sure what the sorting criteria are, as some bins seem nearly as chaotic as the input mix. Still, we appreciate the fine engineering, and award extra style points for all the Lego goodness.
Continue reading “Lego Machine Uses Machine Learning To Sort Itself Out”
We hackers just can’t get enough of sorters for confections like Skittles and M&Ms, the latter clearly being the superior candy in terms of both sorting and snackability. Sorting isn’t just about taking a hopper of every color and making neat monochromatic piles, though. [JohnO3] noticed that all those colorful candies would make dandy pixel art, so he built a bot to build up images a Skittle at a time.
Dubbed the “Pixel8R” after the eight colors in a regulation bag of Skittles, the machine is a largish affair with hoppers for each color up top and a “canvas” below with Skittle-sized channels and a clear acrylic cover. The hoppers each have a rotating disc with a hole to meter a single Skittle at a time into a funnel which is connected to a tube that moves along the top of the canvas one column at a time. [JohnO3] has developed a software toolchain to go from image files to Skittles using GIMP and a Python script, and the image builds up a row at a time until 2,760 Skittle-pixels have been placed.
The downside: sorting the Skittles into the hoppers. [JohnO3] does this manually now, but we’d love to see a sorter like this one sitting up above the hoppers. Or, he could switch to M&Ms and order single color bags. But where’s the fun in that?
If you know anyone who does crafts, they probably have a drawer with a few million beads loose and mixed together. You’ll sort them out one day, right? Probably not. Unless, of course, you build a robot to do the dirty work for you. That’s what [Kalfalfa] did, using some Phidgets boards, a camera and Open CV. You can see a video of the cardboard machine doing its thing below.
Maybe it is because we are more electronics-minded, but we were impressed with the mechanism to grab just one bead at a time from the hopper. If you watch the video, you’ll see what we mean. However, sometimes a bead jams and a magnetic sensor figures that out so the controller can reverse a bit and try again.
Continue reading “Robot Sorts Beads By Color”
We love to see projects undertaken for the pure joy of building something new, but to be honest those builds are a dime a dozen around here. So when we see a great build that also aims to enhance productivity and push an entrepreneurial effort along, like this automated small parts counter, we sit up and take notice.
The necessity that birthed this invention is [Ryan Bates’] business of building DIY arcade game kits. The mini consoles seen in the video below are pretty slick, but kitting the nuts, bolts, spacers, and other bits together to ship out orders was an exercise in tedium. Sure, parts counting scales are a thing, but that’s hardly a walk-away solution. So with the help of some laser-cut gears and a couple of steppers, [Ryan] built a pretty capable little parts counter.
The interchangeable feed gears have holes sized to move specific parts up from a hopper to a chute. A photointerrupter counts the parts as they fall into plastic cups on an 8-position carousel, ready for bagging. [Ryan] also has a manual counter for wire crimp connectors that’s just begging to be automated, and we can see plenty of ways to leverage both solutions as he builds out his kitting system.
While we’ve seen more than a few candy sorting machines lately, it’s great to see someone building hardware to streamline the move from hobby to business like this. We’re looking forward to seeing where [Ryan] takes this from here.
Continue reading “Automated Parts Counter Helps Build A Small Business”
College engineering projects are great, because they afford budding engineers the opportunity to build interesting things without the need for financial motivation. Usually, some basic requirements are established, but students are free to get creative and build something that appeals to them personally. For our readers, mechatronics courses are ripe for these kinds of projects, as the field combines electrical engineering, mechanical engineering, and programming.
[Ethan Crane] is in just such a course, and had a final project due with only one real requirement: it had to use a PICAXE. Obviously, this gave [Ethan] quite a bit of freedom to build something unique, and what he came up with is an “Anti-Entropy Machine” designed to sort M&M candies by color. The electronics are as simple as [Ethan] could make them (a good philosophy for an engineering student to adhere to). There is an IR sensor to determine if a candy is in the hopper, an RGB sensor to determine its color, and servos to position the delivery chute based on color and operate the hopper.
Continue reading “Anti-Entropy Machine Satiates M&M OCD”
Sorting. It’s a classic problem that’s been studied for decades, and it’s a great first step towards “thinking algorithmically.” Over the years, a handful of sorting algorithms have emerged, each characterizable by it’s asymptotic order, a measure of how much longer an algorithm takes as the problem size gets bigger. While all sorting algorithms take longer to complete the more elements that must be sorted, some are slower than others.
For a sorter like bubble sort, the time grows quadradically longer for a linear increase in the number of inputs; it’s of order
O(N²).With a faster sorter like merge-sort, which is
O(N*log(N)), the time required grows far less quickly as the problem size gets bigger. Since sorting is a bit old-hat among many folks here, and since
O(N*log(N)) seems to be the generally-accepted baseline for top speed with a single core, I thought I’d pop the question: can we go faster?
In short — yes, we can! In fact, I’ll claim that we can sort in linear time, i.e a running time of
O(N). There’s a catch, though: to achieve linear time, we’ll need to build some custom hardware to help us out. In this post, I’ll unfold the problem of sorting in parallel, and then I”ll take us through a linear-time solution that we can synthesize at home on an FPGA.
Need to cut to the chase? Check out the full solution implemented in SystemVerilog on GitHub. I’ve wrapped it inside an SPI communication layer so that we can play with it using an everyday microcontroller.
To understand how it works, join us as we embark on an adventure in designing algorithms for hardware. If you’re used to thinking of programming in a stepwise fashion for a CPU, it’s time to get out your thinking cap!
Continue reading “Sort Faster With FPGAs”