Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
119 tokens/sec
GPT-4o
56 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Robot Task Planning and Situation Handling in Open Worlds (2210.01287v2)

Published 4 Oct 2022 in cs.RO and cs.AI

Abstract: Automated task planning algorithms have been developed to help robots complete complex tasks that require multiple actions. Most of those algorithms have been developed for "closed worlds" assuming complete world knowledge is provided. However, the real world is generally open, and the robots frequently encounter unforeseen situations that can potentially break the planner's completeness. This paper introduces a novel algorithm (COWP) for open-world task planning and situation handling that dynamically augments the robot's action knowledge with task-oriented common sense. In particular, common sense is extracted from LLMs based on the current task at hand and robot skills. For systematic evaluations, we collected a dataset that includes 561 execution-time situations in a dining domain, where each situation corresponds to a state instance of a robot being potentially unable to complete a task using a solution that normally works. Experimental results show that our approach significantly outperforms competitive baselines from the literature in the success rate of service tasks. Additionally, we have demonstrated COWP using a mobile manipulator. The project website is available at: https://cowplanning.github.io/, where a more detailed version can also be found. This version has been accepted for publication in Autonomous Robots.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (7)
  1. Yan Ding (41 papers)
  2. Xiaohan Zhang (78 papers)
  3. Saeid Amiri (14 papers)
  4. Nieqing Cao (6 papers)
  5. Hao Yang (328 papers)
  6. Chad Esselink (5 papers)
  7. Shiqi Zhang (88 papers)
Citations (17)

Summary

We haven't generated a summary for this paper yet.