Test Strips

In artificial intelligence, STRIPS (Stanford Research Institute Problem Solver) is an automated planner invented by Richard Fikes and Nils Nilsson in 1971. The same name was later used to refer to the formal language of the inputs to this planner. more...

Home
Bath & Body
Dietary Supplements,...
Hair Care
Hair Removal
Health Care
Massage
Medical, Special Needs
Bathroom Safety
Braces, Supports
Hearing Assistance
Incontinence Aids
Mobility Equipment
Monitoring, Testing
Blood Pressure
Arm
Other
Wrist
Diabetes
Accu-Chek
Glucose Monitors
Lancets
Monitoring Kits
OneTouch
Other
Test Strips
Other Monitoring, Testing
Stethoscopes
Thermometers
Orthotics, Insoles
Other
Positioning Equipment
Respiratory Aids
Nail
Natural Therapies
Oral Care
Other Health & Beauty Items
Skin Care
Tattoos, Body Art
Vision Care
Weight Management
Wholesale Lots

This language is the base for most of the languages for expressing automated planning problem instances in use today. This article only describes the language, not the planner.

Definition

A STRIPS instance is composed of:

An initial state;; The specification of the goal states – situations which the planner is trying to reach;; A set of actions. For each action, the following are included:

preconditions (what must be established before the action is performed);; postconditions (what is established after the action is performed).;

Mathematically, a STRIPS instance is a quadruple P is a set of conditions (i.e., propositional variables);; O is a set of operators (i.e., actions); each operator is itself a quadruple I is the initial state, given as the set of conditions that are initially true (all others are assumed false);; G is the specification of the goal state; this is given as a pair A plan for such a planning instance is a sequence of operators that can be executed from the initial state and that leads to a goal state.

Formally, a state is a set of conditions: a state is represented by the set of conditions that are true in it. Transitions between states are modeled by a transition function, which is a function mapping states into new states that result from the execution of actions. Since states are represented by sets of actions, the transition function relative to the STRIPS instance

where 2^P is the set of all subsets of P, and is therefore the set of all possible states.

The transition function can be defined as follows, in the assumption that actions can always be executed but they do not have effects if their preconditions are not met (this is a simplifying assumption):

The function Read more at Wikipedia.org