Large-Language-Model-Guided State Estimation for Partially Observable Task and Motion Planning
Organizations: The University of Texas at Austin · Nanyang Technological University
Abstract
Robot planning in partially observable environments, where not all objects are known or visible, is a challenging problem, as it requires reasoning under uncertainty through partially observable Markov decision processes. During the execution of a computed plan, a robot may unexpectedly observe task-irrelevant objects, which are typically ignored by naive planners. In this work, we propose incorporating two types of common-sense knowledge: (1) certain objects are more likely to be found in specific locations; and (2) similar objects are likely to be co-located, while dissimilar objects are less likely to be found together. Manually engineering such knowledge is complex, so we explore leveraging the powerful common-sense reasoning capabilities of large language models (LLMs). Our planning and execution framework, CoCo-TAMP, introduces a hierarchical state estimation that uses LLM-guided information to shape the belief over task-relevant objects, enabling efficient solutions to long-horizon task and motion planning problems. In experiments, CoCo-TAMP achieves an average reduction of 62.7% in planning and execution time in simulation, and 72.6% in real-world demonstrations, compared to a baseline that does not incorporate either type of common-sense knowledge.
Figures & tables
| Baseline | Co-Model | LGBU | MCQA | MCQA with Co-Model | MCQA with LGBU | |
|---|---|---|---|---|---|---|
| , | Uniform | Uniform | Uniform | MCQA | MCQA | MCQA |
| co-location model | No | Yes | No | No | Yes | No |
| LLM generated update | No | No | Yes | No | No | Yes |
| 4 rooms 8 surfs | 4 rooms 16 surfs | 6 rooms 12 surfs | 6 rooms 24 surfs | 8 rooms 16 surfs | 8 rooms 32 surfs | |
|---|---|---|---|---|---|---|
| Baseline | ||||||
| Co-Model | ||||||
| MCQA | ||||||
| MCQA with Co-Model | ||||||
| LGBU | ||||||
| MCQA with LGBU |
| 4 rooms 8 surfs | 4 rooms 16 surfs | 6 rooms 12 surfs | 6 rooms 24 surfs | 8 rooms 16 surfs | 8 rooms 32 surfs | |
|---|---|---|---|---|---|---|
| Baseline | ||||||
| Co-Model | ||||||
| MCQA | ||||||
| MCQA with Co-Model | ||||||
| LGBU | ||||||
| MCQA with LGBU |
Motion Planning
Motion planning finds safe, feasible paths and trajectories for robots and vehicles amid geometric, dynamic, and task constraints.
See all 392 papers