REVIEW 8 cited by
Errors are Useful Prompts: Instruction Guided Task Programming with Verifier-Assisted Iterative Prompting
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Generating low-level robot task plans from high-level natural language instructions remains a challenging problem. Although large language models have shown promising results in generating plans, the accuracy of the output remains unverified. Furthermore, the lack of domain-specific language data poses a limitation on the applicability of these models. In this paper, we propose CLAIRIFY, a novel approach that combines automatic iterative prompting with program verification to ensure programs written in data-scarce domain-specific language are syntactically valid and incorporate environment constraints. Our approach provides effective guidance to the language model on generating structured-like task plans by incorporating any errors as feedback, while the verifier ensures the syntactic accuracy of the generated plans. We demonstrate the effectiveness of CLAIRIFY in planning chemistry experiments by achieving state-of-the-art results. We also show that the generated plans can be executed on a real robot by integrating them with a task and motion planner.
Forward citations
Cited by 8 Pith papers
-
AEGIS: Assay-Aware Protocol Validation and Runtime Monitoring for Open-Source Liquid Handling Robots
AEGIS combines a rule-guided LLM protocol validator with a PCA/VLM visual runtime monitor to catch silent liquid-handling failures on the Opentrons OT-2, reporting adjusted F1 0.97 and average precision 0.89 on small ...
-
Learning Decentralized LLM Collaboration with Multi-Agent Actor Critic
Multi-agent actor-critic methods with a centralized critic improve decentralized LLM collaboration over Monte Carlo baselines in long-horizon and sparse-reward settings.
-
Prime the search: Using large language models for guiding geometric task and motion planning by warm-starting tree search
STaLM warm-starts a hybrid-action Monte Carlo tree search with task plans generated by a single LLM query, outperforming pure search and prior LLM planners on six geometric task and motion planning problems.
-
Collision- and Reachability-Aware Multi-Robot Control with Grounded LLM Planners
RLVR fine-tuning teaches small LLMs to reason about reachability and collisions, letting them beat far larger ungrounded LLMs on multi-robot box-moving tasks.
-
ReFF: Reinforcing Format Faithfulness in Language Models across Varied Tasks
FormatBench evaluates LLM format adherence across ten tasks, and REFF uses format-checker rewards in PPO to raise format faithfulness substantially while keeping content quality roughly stable.
-
Learning Game-Playing Agents with Generative Code Optimization
LLM-guided refinement of Python policies reaches competitive Atari scores with fewer environment interactions than standard deep RL, on Pong, Breakout, and Space Invaders.
-
El Agente: An Autonomous Agent for Quantum Chemistry
A hierarchical multi-agent LLM system autonomously plans, executes, and debugs quantum chemistry calculations, achieving over 87% success on six benchmark exercise types and two case studies.
-
TimelyLLM: Segmented LLM Serving System for Time-sensitive Robotic Applications
TimelyLLM segments LLM-generated robot plans into executable pieces and schedules those pieces by urgency, reducing response delays for time-critical robot tasks.
Discussion (0). Continue with ORCID to comment.