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

Md. Sadman Sakib, Yu Sun
{"title":"Consolidating Trees of Robotic Plans Generated Using Large Language Models to Improve Reliability","authors":"Md. Sadman Sakib, Yu Sun","doi":"10.1142/s2972335324500029","DOIUrl":null,"url":null,"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.","PeriodicalId":516715,"journal":{"name":"International Journal of Artificial Intelligence and Robotics Research","volume":" 56","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Artificial Intelligence and Robotics Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1142/s2972335324500029","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

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.
整合使用大型语言模型生成的机器人计划树以提高可靠性
大型语言模型(LLMs)固有的概率性质引入了不可预测因素,从而引发了对其输出中潜在差异的担忧。本文介绍了一种创新方法,旨在为现实世界中的各种需求和场景生成正确、最优的机器人任务计划。LLM 已被用于生成任务计划,但它们并不可靠,可能包含错误、可疑或高成本的步骤。所提出的方法利用 LLM 生成若干树状任务计划,并通过删除有问题的路径将它们合并成图。然后,可以检索出最优任务树,以规避有问题和高成本的节点,从而提高计划的准确性和执行效率。通过结合大型知识网络,该方法得到了进一步改进。通过进一步利用 GPT-4,高级任务计划被转换为机器人可执行的低级规划域定义语言(PDDL)计划。评估结果表明,与任务规划领域以前的方法相比,我们的方法具有更高的准确性和效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信