Share your thoughts, 1 month free Claude Pro on usSee more
WorkDL logo mark

SG-CoT: An Ambiguity-Aware Robotic Planning Framework using Scene Graph Representations

About

Ambiguity poses a major challenge to large language models (LLMs) used as robotic planners. In this letter, we present Scene Graph-Chain-of-Thought (SG-CoT), a two-stage framework where LLMs iteratively query a scene graph representation of the environment to detect and clarify ambiguities. First, a structured scene graph representation of the environment is constructed from input observations, capturing objects, their attributes, and relationships with other objects. Second, the LLM is equipped with retrieval functions to query portions of the scene graph that are relevant to the provided instruction. This grounds the reasoning process of the LLM in the observation, increasing the reliability of robotic planners under ambiguous situations. SG-CoT also allows the LLM to identify the source of ambiguity and pose a relevant disambiguation question to the user or another robot. Extensive experimentation demonstrates that SG-CoT consistently outperforms prior methods, with a minimum of 10% improvement in question accuracy and a minimum success rate increase of 4% in single-agent and 15% in multi-agent environments, validating its effectiveness for more generalizable robot planning.

Akshat Rana, Peeyush Agarwal, K.P.S. Rana, Amarjit Malhotra• 2026

Related benchmarks

TaskDatasetResultRank
Robotic PlanningLEMMA Single-Agent Multiplicity
Success Rate (SR)77
14
Robotic PlanningLEMMA Single-Agent Absence
Success Rate (SR)96
14
Robotic PlanningLEMMA Single-Agent Underspecified
Success Rate (SR)99
14
Robotic PlanningLEMMA Single-Agent Overall
Success Rate (SR)80
14
Robotic PlanningLEMMA Stack and Pass tasks, partially observed (test)
Success Rate75
8
Robotic Task PlanningLEMMA Single-agent
Calls per Episode4.24
4
Showing 6 of 6 rows

Other info

Follow for update