![]() ![]() The technique behind the agent is: first use Generate & Test to generate a possible state, then use Means-Ends Analysis to choose the best state to move to. ![]() This Python project implements an agent that can solve Block World problems optimally(in the minimum number of moves) for an arbitrary initial arrangement of blocks (A-Z, 26 blocks maximum). A block may not be moved if there is another block on top of it. ![]() Only one block may be moved at a time, it may be placed either on the table or on top of another block. The goal is to build one or more vertical stacks of blocks, turn the initial state into the goal state. The block world problem is one of the most famous planning domains in artificial intelligence. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |