Consolidating Trees of Robotic Plans Generated Using Large Language Models to Improve Reliability

Md Sadman Sakib, Yu Sun
1/15/2024
cs.ROcs.AIcs.CL

No confident code implementation found for this paper. 10 possible matches can be shown below.

Abstract

The inherent probabilistic nature of Large Language Models (LLMs) introduces an element of unpredictability, raising concerns about potential discrepancies in their output. This paper introduces an innovative approach aims to generate correct and optimal robotic task plans for diverse real-world demands and scenarios. LLMs have been used to generate task plans, but they are unreliable and may contain wrong, questionable, or high-cost steps. The proposed approach uses LLM to generate a number of task plans as trees and amalgamates them into a graph by removing questionable paths. Then an optimal task tree can be retrieved to circumvent questionable and high-cost nodes, thereby improving planning accuracy and execution efficiency. The approach is further improved by incorporating a large knowledge network. Leveraging GPT-4 further, the high-level task plan is converted into a low-level Planning Domain Definition Language (PDDL) plan executable by a robot. Evaluation results highlight the superior accuracy and efficiency of our approach compared to previous methodologies in the field of task planning.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 10 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{sakib2024consolidating,
  title  = {Consolidating Trees of Robotic Plans Generated Using Large Language Models to Improve Reliability},
  author = {Md Sadman Sakib and Yu Sun},
  year   = {2024},
  eprint = {2401.07868},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2401.07868v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2401.07868.svg)](https://codeofpaper.com/paper/2401.07868)

Discussion