addressalign-toparrow-leftarrow-rightbackbellblockcalendarcameraccwcheckchevron-downchevron-leftchevron-rightchevron-small-downchevron-small-leftchevron-small-rightchevron-small-upchevron-upcircle-with-checkcircle-with-crosscircle-with-pluscrossdots-three-verticaleditemptyheartexporteye-with-lineeyefacebookfolderfullheartglobegmailgooglegroupshelp-with-circleimageimagesinstagramFill 1linklocation-pinm-swarmSearchmailmessagesminusmoremuplabelShape 3 + Rectangle 1ShapeoutlookpersonJoin Group on CardStartprice-ribbonprintShapeShapeShapeShapeImported LayersImported LayersImported Layersshieldstartickettrashtriangle-downtriangle-uptwitteruserwarningyahoo

Re: [Cleveland-AI-ML-support-group] Study Progress

From: Tim M.
Sent on: Thursday, September 1, 2011 6:41 PM
I'm not entirely sure what you mean by "search process component", but I think that chapters 7 and 11, which deal with planning agents, will show planning done in unknown and possibly dynamic environments (e.g. firefighting robot that puts out a candle in an unknown environment, ala I think you just need to be able to detect changes in your environment and re-plan as necessary.

Regarding atomic world state representation, what comes to mind is tic-tac-toe. If you code each possible board configuration as a number (state), you should be able to train a program to find one of the guaranteed-win first moves without that program even knowing that a state represents X's and O's on a 3x3 grid. The program simply knows the starting state, legal transitions from one state to another, and which states are win/loss/tie conditions. Thus, the entirety of the world is captured in a single (atomic) number. I think this also extends to chess, but the huge problem space is what disallows a brute-force solution.
Regarding your mention of a problem using a map with streets, you need to introduce some element of time. First, create a starting position. Then, for every time slice, create a new world state for every possible decision that your problem-solving agent can make. The easiest representation for this that I can think of is to allow your agent only 3 moves: go forward 1 block; turn left; and turn right. A quanta of time is a single move. Now your world states are defined as all possible combinations of those moves from your start position t your end goal. You can still define atomic world states even if you extend the world to include multiple agents and reduce the sampling time from 1 block down to a millisecond of steering time. The problem is that the number of states quickly grows beyond your ability to analyze them and necessitates a different approach.

I'm very busy the next two weeks, but hope to get more involved and committed after that. I did sign up to receive a certificate, and hope to stick with it :)


On Thu, Sep 1, 2011 at 12:01 AM, Joe <[address removed]> wrote:
 After reading the Linear Algebra review in an appendix of the AI book, I can see that the Videos and problems already posted on the wiki so far look close to sufficient for an LA prep for the AI class. The ML class wiki will need a bunch more LA videos and questions, as that class looks pretty demanding mathematically. I added more flashcards for a chapter 3 prep on O notation and NP-complete, although they use too much formal language from Wikipedia. I haven't gotten to any probability review material yet but I guess that's a good topic for week 3.

 After rereading chapter 2, I realized my earlier idea of what an agent is was mistaken. I was mixing up a 'component' of an agent with the agent itself. An agent is a useful concept of an entity that perceives and acts rationally in an environment. That's useful, because it's an accurate conceptual starting point for describing what an AI bot actually is. Upon the agent concept, a well built theoretical and pragmatic tested framework for classifying all types of AI bots is described. And the main goal of building any AI bot is logically explained-to build the components of the bot's framework in a well designed way such that the bot's behavior reasonably full fills the ideal set of rational behaviors for it's task. The full set of ideal behaviors for most tasks being too large to handle as a database.

  I think that's ultra powerful, because the book is basically giving a recipe for how to build an AI bot for any purpose. All that's needed to do that, is to understand A. the framework theory, B. how to choose the right framework system for a given a problem, and C. how to customize templates of components to create that particular framework system.

 Using that framework, I can see that search, the topic of chapter 3, is a process to make use of the information in a model based agent to select a sequence of actions to achieve a goal. That's a different way of looking at it than the algo oriented way I had previously. I was previously thinking of ch 3 as describing some new search algo twists, but now I see it as describing how search algos apply to the AI framework as a component. This AI programming specialty thing is much more developed as a coherent whole than I realized. It looks like the turning point was work done in 87 to 95 as explained a bit at the end of ch 2.

  I think a search process component only makes sense to use in a task environment that is deterministic, sequential, static, discrete and known. Does anybody see any exceptions to that? One thing I didn't understand about the beginning of ch 3 at first is the books statement that the problem-solving agent's of that chapter use atomic world state representation. Isn't a map of streets something more than atomic? I think I might know the answer to that, but first what do you all think of that question?


Please Note: If you hit "REPLY", your message will be sent to everyone on this mailing list ([address removed])
This message was sent by Joe ([address removed]) from Cleveland AI + ML support group.
To learn more about Joe, visit his/her member profile
To unsubscribe or to update your mailing list settings, click here

Meetup, PO Box 4668 #37895 New York, New York[masked] | [address removed]

Sign up

Meetup members, Log in

By clicking "Sign up" or "Sign up using Facebook", you confirm that you accept our Terms of Service & Privacy Policy