用阻塞条件指导机器人一步步决策,实时调整行动策略。
Sequential Discrete Action Selection via Blocking Conditions and Resolutions
- 将动作选择转化为解除阻塞条件的迭代过程
- 结合状态转移图与零样本大模型生成下一步动作
- 适合需要动态适应复杂环境的自主机器人系统
本文提出一种将机器人顺序动作选择问题建模为解除阻塞条件的新策略,即阻碍任务进展的状态。该策略使机器人能够基于上下文信息逐个做出决策,并快速响应当前状况。我们首次实现该策略,结合状态转移图与零样本大语言模型(LLM)。状态转移图记录先前尝试动作的阻塞状态及可解决现有阻塞的候选动作。该图信息用于自动生成提示输入给LLM,LLM根据上下文和可用动作集选择下一步执行的动作。该选择过程迭代进行:每次执行动作后,状态转移图随之更新,持续推进直至达成目标或触发终止条件。我们在仿真测试中对比了该方法与多种LLM及传统任务规划方法的效果,验证了其有效性。结果表明,该方法在动态环境中具备更强的适应性与鲁棒性。
原文摘要 · Abstract (English)
In this work, we introduce a strategy that frames the sequential action selection problem for robots in terms of resolving \textit{blocking conditions}, i.e., situations that impede progress on an action en route to a goal. This strategy allows a robot to make one-at-a-time decisions that take in pertinent contextual information and swiftly adapt and react to current situations. We present a first instantiation of this strategy that combines a state-transition graph and a zero-shot Large Language Model (LLM). The state-transition graph tracks which previously attempted actions are currently blocked and which candidate actions may resolve existing blocking conditions. This information from the state-transition graph is used to automatically generate a prompt for the LLM, which then uses the given context and set of possible actions to select a single action to try next. This selection process is iterative, with each chosen and executed action further refining the state-transition graph, continuing until the agent either fulfills the goal or encounters a termination condition. We demonstrate the effectiveness of our approach by comparing it to various LLM and traditional task-planning methods in a testbed of simulation experiments. We discuss the implications of our work based on our results.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。