The Stanford Research Institute Problem Solver (STRIPS) is a classical problem solving system which develops a list of actions which will reach a goal state from an initial state given a list of possible actions.
It is an automated planning technique that works by executing a domain and problem to find a goal. With STRIPS, you first describe the world. You do this by providing objects, actions, preconditions, and effects. These are all the types of things you can do in the game world.
Once the world is described, you then provide a problem set. A problem consists of an initial state and a goal condition. STRIPS can then search (often using A*) all possible states, starting from the initial one, executing various actions, until it reaches the goal.
Action: PushBox(x, y) Precond: BoxAt(x) Effect: BoxAt(y), ¬ BoxAt(x)
Note: ¬ indicates that the state is deleted.
|file: /Techref/method/ai/strips.htm, 2KB, , updated: 2022/6/1 11:28, local time: 2022/8/13 21:26,
|©2022 These pages are served without commercial sponsorship. (No popup ads, etc...).Bandwidth abuse increases hosting cost forcing sponsorship or shutdown. This server aggressively defends against automated copying for any reason including offline viewing, duplication, etc... Please respect this requirement and DO NOT RIP THIS SITE. Questions?|
<A HREF="http://techref.massmind.org/Techref/method/ai/strips.htm"> STRIPS</A>
|Did you find what you needed?|
Welcome to massmind.org!
Welcome to techref.massmind.org!