Jev robot object goal match

Match a fictional cleanup object to the stated goal

Describe one fictional object, the cleanup instruction and any handling restriction. Compare a goal match with a wrong or blocked object; this text exercise does not control a robot.

Does this object fit the stated cleanup goal?Live API
Try an example

Original input for the Goal match outcome. Edit the evidence to send a new request.

Source: Background discussion on X

Source and example scope

These fictional inputs and decision rules were written for this page. The linked X discussion provides background; the technical implementation follows TypeSafe's Choice contract.

Compare the object and cleanup instruction.

Decision rules and labels
Goal matchWrong objectBlockedUnclearNeed evidence
A real response from the Jev API

Edit any input to explore a different decision. No request is sent until you run it.

Your next decision

Not run yet

Choose an example or write your own input, then run it to see the ranked choices.

Results are not stored by this site. Your submitted text is processed by the API provider.

The decision

A matching noun is only part of the goal.

The cleanup target specifies an empty mug, not every object called a mug. The full-mug example checks that condition while the book supplies an obvious negative case.

A handling restriction can make an otherwise matching object ineligible. Blocked preserves that restriction as part of the supplied toy state. The model does not discover real hazards, identify physical objects from text or verify a sensor.

The source proposes a layered robot architecture. This adaptation demonstrates object-to-goal matching in fictional text only. It has no connection to a robot controller, actuator or physical safety system.

These fictional inputs and decision rules were written for this page. The linked X discussion provides background; the technical implementation follows TypeSafe's Choice contract.

Illustration of one spreadsheet row producing two separate classification results
Illustration of the decision flow.
How it works

Try the example in four steps

Use the sample to understand the rule, then test your own input for cleanup object matching.

  1. Illustration of adding the text or evidence for a decision

    Add the information to check

    Describe one fictional object, the cleanup instruction and any handling restriction.

  2. Illustration of defining a question and its allowed choices

    Confirm the question and labels

    Open the decision rules and keep the intended distinction between Goal match, Wrong object, Blocked, Unclear, Need evidence. Edit the choices only when testing your own rule.

  3. Illustration of sending one input and comparing the returned choices

    Run the decision

    Use a sample first, then try your own input. Compare the selected label with the other returned probabilities.

  4. Illustration of reviewing a result and an uncertain item before using it

    Review the next step

    Review Unclear, Need evidence before using a result. The label is a decision about the supplied information, not an executed action.

Our API test

Recorded API observations

Recorded API observations
Original inputObserved labelLeading probability
Mug on the tableGoal match100%
Book outside targetWrong object100%
Explicit restrictionBlocked100%
Unidentified vesselUnclear88.0%
Full mugWrong object100%
Missing object stateNeed evidence100%

These are six original synthetic inputs, tested once per request revision. The percentage is the leading option probability, not measured accuracy. Authored expectations and any disagreements remain in the downloadable evidence. 6 of 6 results matched the authored fixture expectations.Verified

Understand the results

Source and example scope

Compare each saved result with its authored expectation. A disagreement remains in the fixture review; the call is not repeated to obtain a preferred label.

Using the result in your application

The single-request SDK runner uses your private TYPESAFE_API_KEY. The offline consumer reads saved observations, checks request hashes and prints a pending output. It does not call the model or change any external system.

Runnable offline example

Run one sample, then inspect the local packet

View the code example
Single-request replay
npm install @typesafe-ai/sdk@0.6.0
# Set TYPESAFE_API_KEY privately in your shell.
node run-choice-sample.mjs samples.json case-1
python preview_choice_workflow.py samples.json saved-api-results.json
Scope of this demo

Where this decision fits

Useful scope

  • Testing a text-only simulated goal matcher
  • Inspecting explicit exclusions before proposing an object
  • Replaying the exact synthetic requests and inspecting their distributions

Outside this demonstration

  • Running a real robot from this window
  • Treating a model probability as physical safety validation
  • Treating six fixture expectations as measured production accuracy
Example FAQ

Questions about robot object goal match.

The rubric explains the decision; the application owns the next step.

Does Goal match mean the object is safe to pick up?

No. It only matches the supplied fictional goal and restrictions. Physical identification, motion planning and safety checks are outside this demonstration.

Why is a full mug a Wrong object?

The authored target explicitly says empty mugs only. The contents are relevant evidence, even when the object noun matches.

Does the leading probability measure production accuracy?

No. It is the model distribution for this one request. The six examples are functional checks with authored expectations, not a representative benchmark. Inspect disagreements and evaluate your own examples before using the label.

What happens when the API fails?

The window shows an error and supplies no fresh judgment. The downloadable runner sends one request without retries. Need evidence is a valid outcome about incomplete input; it does not stand in for a network or provider failure.

Try your own robot object goal match input

Edit the evidence above or use the Playground to test another bounded question.