Next can be described in the following rather concise way to the magical, The blocks given in each state are of course always the same, as shownįor simplicity, assume that all moves from one state to the Minimal number of such intermediate states. An “optimal” solution to a blocks world problem takes you through the Go through a sequence of other states, trying to convert the Start State In making progress on the problem, you will Each block startsĪnd ends either on the table or else exactly on top of another block. Which can lift up the blocks and move them, one at a time. There is a single, magical, mechanical arm Same blocks on a table, one called the Start State and the other the Goal State! Assume you are actually given the blocks inĪnd what you need to do is move them into the Goal State. The problems are always shown with two arrangements of the Using a single mechanical arm, as pictured in Fig. Of stacked blocks on a table, which must be rearranged into some other stacks, In blocks world, you are presented with a set The “ordinary” version of it, like that used in Ch.11. We’ll get back to talking about it for that One in AI, often used as a model domain for planning. You to gain expertise in using intelligent search in a domain well suited to it.Īn A* search for a variation of the domain called “blocks world,” so that youĬan find guaranteed optimal solutions, and also so that you can find suboptimalĭomain: The basic domain “blocks world” is a famous Goal: The goal of this lab assignment is for
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |