1 / 10

A survey of common techniques used for developing CBR systems

A survey of common techniques used for developing CBR systems. Ahmad Atta. Knowledge Representation. Case Representation Case base representation. General definition [ Kolodner , 1993]. Problem Description Goals Constraints on the goals Problem situation Solution Solutions

bradley-humphrey
Download Presentation

A survey of common techniques used for developing CBR systems

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. A survey of common techniques used for developing CBR systems Ahmad Atta

  2. Knowledge Representation • Case Representation • Case base representation

  3. General definition [Kolodner, 1993] • Problem Description • Goals • Constraints on the goals • Problem situation • Solution • Solutions • Reasoning steps • Outcome • Outcome • Expected failure • Repair strategy

  4. Case(behavior) in Darmok • The declarative part • A goal • Preconditions • Alive conditions • The procedural part • Basic actions • sub goal • The state of behavior • Pending , executing, succeeded , or failed. • The state of goal • Open , Ready , Waiting.

  5. Case presentation in CBR-BDI Agents • P = < E, o , o’ , R , R’> where : • E is the environment (e.g. game state) • O the objectives of agent. • O’ the results achieved by the plan • R the total resources !! • R’ the resources consumed by the agent

  6. Case base representation • Case base memory in Darmok consists of two elements: • Snippet The procedural part of the behavior. • Episode e = ( P , G , S , O) where e.P is the snippet, e.G is the goal, e.S is the situation , and e.O is the outcome of applying e.P in e.S to achieve e,G.

  7. Case memory structure • Episodic Memory Organization packets • The Category & Exemplar Model

  8. Case Retrieval • Case Retrieval in Darmok • Episode relevance measure ER ( e, S, G) • ER( e, S, G) = GS(e.G, G) + (1-0) SS(e.S , S) • Retrieve the episodes with maximum relevance RE(p, S, G) = {e1, ……, ek} • Define the predicted performance for each snippets

  9. Adaptation • Plan Dependency Graph Generation • Precondition-success condition matcher (ps-matcher). • Removal of unnecessary actions • Adaptation for unsatisfied preconditions

More Related