Planning and Acting While the Clock Ticks

• URL: http://arxiv.org/abs/2403.14796v1
• Date: Thu, 21 Mar 2024 19:18:47 GMT
• Title: Planning and Acting While the Clock Ticks
• Authors: Andrew Coles, Erez Karpas, Andrey Lavrinenko, Wheeler Ruml, Solomon Eyal Shimony, Shahaf Shperberg,
• Abstract summary: In some problems with time pressure, timing is too tight to complete planning before the first action must be executed. We propose a new problem setting: concurrent planning and execution, in which actions can be dispatched (executed) before planning terminates.
• Score: 15.783791140860528
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Standard temporal planning assumes that planning takes place offline and then execution starts at time 0. Recently, situated temporal planning was introduced, where planning starts at time 0 and execution occurs after planning terminates. Situated temporal planning reflects a more realistic scenario where time passes during planning. However, in situated temporal planning a complete plan must be generated before any action is executed. In some problems with time pressure, timing is too tight to complete planning before the first action must be executed. For example, an autonomous car that has a truck backing towards it should probably move out of the way now and plan how to get to its destination later. In this paper, we propose a new problem setting: concurrent planning and execution, in which actions can be dispatched (executed) before planning terminates. Unlike previous work on planning and execution, we must handle wall clock deadlines that affect action applicability and goal achievement (as in situated planning) while also supporting dispatching actions before a complete plan has been found. We extend previous work on metareasoning for situated temporal planning to develop an algorithm for this new setting. Our empirical evaluation shows that when there is strong time pressure, our approach outperforms situated temporal planning.

Related papers

• Planning with Dynamically Changing Domains [7.469995940050812]
  It is assumed that there are finitely many named objects given in advance, and only they can participate in actions and in fluents.<n>We formulate the planning problem in first-order logic, assume an initial theory is a finite consistent set of fluent literals.<n>We propose to organize search over sequences of actions that are grounded at planning time.
  arXiv  Detail & Related papers  (2025-07-26T17:34:25Z)
• Plan-R1: Safe and Feasible Trajectory Planning as Language Modeling [75.83583076519311]
  Plan-R1 is a novel two-stage trajectory planning framework that formulates trajectory planning as a sequential prediction task.<n>In the first stage, we train an autoregressive trajectory predictor via next motion token prediction on expert data.<n>In the second stage, we design rule-based rewards (e.g., collision avoidance, speed limits) and fine-tune the model using Group Relative Policy Optimization.
  arXiv  Detail & Related papers  (2025-05-23T09:22:19Z)
• A Planning Compilation to Reason about Goal Achievement at Planning Time [9.722824469961925]
  We propose a compilation that extends the original planning task with commit actions that enforce the persistence of specific goals once achieved.<n> Experimental results indicate that solving the reformulated tasks does not incur on any additional overhead both when performing optimal and suboptimal planning.
  arXiv  Detail & Related papers  (2025-03-12T17:00:37Z)
• Hindsight Planner: A Closed-Loop Few-Shot Planner for Embodied Instruction Following [62.10809033451526]
  This work focuses on building a task planner for Embodied Instruction Following (EIF) using Large Language Models (LLMs) We frame the task as a Partially Observable Markov Decision Process (POMDP) and aim to develop a robust planner under a few-shot assumption. Our experiments on the ALFRED dataset indicate that our planner achieves competitive performance under a few-shot assumption.
  arXiv  Detail & Related papers  (2024-12-27T10:05:45Z)
• Intelligent Execution through Plan Analysis [11.771743106780102]
  Planning makes assumptions about the world. When executing plans, the assumptions are usually not met. Instead, we focus on the positive impact, or opportunities to find better plans. Experiments in several paradigmatic robotic tasks show how the approach outperforms standard replanning strategies.
  arXiv  Detail & Related papers  (2024-03-18T18:23:36Z)
• Unified Task and Motion Planning using Object-centric Abstractions of Motion Constraints [56.283944756315066]
  We propose an alternative TAMP approach that unifies task and motion planning into a single search. Our approach is based on an object-centric abstraction of motion constraints that permits leveraging the computational efficiency of off-the-shelf AI search to yield physically feasible plans.
  arXiv  Detail & Related papers  (2023-12-29T14:00:20Z)
• Planning as In-Painting: A Diffusion-Based Embodied Task Planning Framework for Environments under Uncertainty [56.30846158280031]
  Task planning for embodied AI has been one of the most challenging problems. We propose a task-agnostic method named 'planning as in-painting' The proposed framework achieves promising performances in various embodied AI tasks.
  arXiv  Detail & Related papers  (2023-12-02T10:07:17Z)
• EIPE-text: Evaluation-Guided Iterative Plan Extraction for Long-Form Narrative Text Generation [114.50719922069261]
  We propose a new framework called Evaluation-guided Iterative Plan Extraction for long-form narrative text generation (EIPE-text) EIPE-text has three stages: plan extraction, learning, and inference. We evaluate the effectiveness of EIPE-text in the domains of novels and storytelling.
  arXiv  Detail & Related papers  (2023-10-12T10:21:37Z)
• Skip-Plan: Procedure Planning in Instructional Videos via Condensed Action Space Learning [85.84504287685884]
  Skip-Plan is a condensed action space learning method for procedure planning in instructional videos. By skipping uncertain nodes and edges in action chains, we transfer long and complex sequence functions into short but reliable ones. Our model explores all sorts of reliable sub-relations within an action sequence in the condensed action space.
  arXiv  Detail & Related papers  (2023-10-01T08:02:33Z)
• A Formal Metareasoning Model of Concurrent Planning and Execution [22.963769931698874]
  This work lays the foundation for a principled time-aware executive that concurrently plans and executes. We identify special cases that are solvable in time, develop greedy solution algorithms, and, through tests on instances derived from search problems, find several methods that achieve promising practical performance.
  arXiv  Detail & Related papers  (2023-03-05T13:05:26Z)
• Robust Hierarchical Planning with Policy Delegation [6.1678491628787455]
  We propose a novel framework and algorithm for hierarchical planning based on the principle of delegation. We show this planning approach is experimentally very competitive to classic planning and reinforcement learning techniques on a variety of domains.
  arXiv  Detail & Related papers  (2020-10-25T04:36:20Z)
• Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networks [28.488201307961624]
  Real-world planning problems often involve hundreds or even thousands of objects. We propose a graph neural network architecture for predicting object importance in a single inference pass. Our approach treats the planner and transition model as black boxes, and can be used with any off-the-shelf planner.
  arXiv  Detail & Related papers  (2020-09-11T18:55:08Z)
• Long-Horizon Visual Planning with Goal-Conditioned Hierarchical Predictors [124.30562402952319]
  The ability to predict and plan into the future is fundamental for agents acting in the world. Current learning approaches for visual prediction and planning fail on long-horizon tasks. We propose a framework for visual prediction and planning that is able to overcome both of these limitations.
  arXiv  Detail & Related papers  (2020-06-23T17:58:56Z)
• Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning [78.65083326918351]
  We consider alternatives to an implicit sequential planning assumption. We propose Divide-and-Conquer Monte Carlo Tree Search (DC-MCTS) for approximating the optimal plan. We show that this algorithmic flexibility over planning order leads to improved results in navigation tasks in grid-worlds.
  arXiv  Detail & Related papers  (2020-04-23T18:08:58Z)
• The Efficiency of Human Cognition Reflects Planned Information Processing [40.51474966524166]
  We make predictions about how people should plan and meta-plan as a function of the overall structure of a task. We find that people's reaction times reflect a planned use of information processing. This formulation of planning to plan provides new insight into the function of hierarchical planning, state abstraction, and cognitive control in both humans and machines.
  arXiv  Detail & Related papers  (2020-02-13T20:34:33Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.