Browse Prior Art Database

Robot Artificial Intelligence

IP.com Disclosure Number: IPCOM000035347D
Original Publication Date: 1989-Jul-01
Included in the Prior Art Database: 2005-Jan-28
Document File: 2 page(s) / 42K

Publishing Venue

IBM

Related People

O'Callaghan, TJ: AUTHOR

Abstract

A method of developing software that will "remember" which previous retry worked the best on each specific pallet and hole and then attempt that retry first is described herein.

This text was extracted from a PDF file.
At least one non-text object (such as an image or picture) has been suppressed.
This is the abbreviated version, containing approximately 93% of the total text.

Page 1 of 2

Robot Artificial Intelligence

A method of developing software that will "remember" which previous retry worked the best on each specific pallet and hole and then attempt that retry first is described herein.

If the most ideal retry is not effective, then the second most successful retry is attempted, and so forth, until the robot finds the correct position. The robot then adds the successful retry number to its "memory" for that pallet hole.

The robot's "artificial intelligence" is achieved by keeping a log in memory for each hole on each pallet in terms of which previous retry worked (see Fig. 1). Each retry offset is an entry in the log and when that retry works, the count for that retry is incremented. When the robot goes to load a hole, it looks in the log for that hole to see which retry variation has the highest count or best success, and it attempts this one first. If that does not work, then the log is checked for the second highest count, and so forth.

(Image Omitted)

Putting new pallets on the system requires all the retry logs to be zeroed and the robot must then "learn" the new pallets. With the logs zeroed, the robot will start with retry 1 (see Fig. 2) and continue until the right position is found. Learning the pallet takes only 3-4 runs to build up a somewhat reasonable entry log so that the robot will load into the right position.

In the past, retries were tried sequentially with no memory, and thus if the 20th retry was the proper one for each h...