From an algorithm perspective, blocks world is an np-hard search and planning problem. More complicated derivatives of the problem consist of cubes in different sizes, shapes and colors. A mechanical robot arm has to pick and place the cubes. In its basic form, the blocks world problem consists of cubes in the same size which have all the color black.
This allows to compare different theories against each other. Its major advantage over more realistic AI applications is, that many algorithms and software programs are available which can handle the situation. The blocks world domain is an example for a toy problem. Toy problems were invented with the aim to program an AI which can solve it. Instead of rejecting the challenge at all the idea is to invent an easy to solve domain which is called a toy problem. The problem with most practical application is, that the engineers don't know how to program an AI system.
0 kommentar(er)
