Planning and Acting While the Clock Ticks (2403.14796v1)
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.
- Temporal Planning with Preferences and Time-Dependent Continuous Costs. In Proceedings of ICAPS.
- Thinking Fast and Slow in AI. In AAAI 2021, 15042–15046. AAAI Press.
- Temporal Planning while the Clock Ticks. In Proceedings of ICAPS, 39–46.
- Replanning for Situated Robots. In ICAPS.
- ROSPlan: Planning in the Robot Operating System. In ICAPS 2015, 333–341. AAAI Press.
- Strong temporal planning with uncontrollable durations. Artif. Intell., 256: 1–34.
- Forward-Chaining Partial-Order Planning. In Proceedings of ICAPS, 42–49.
- Planning with Timed Literals and Deadlines. In Proceedings of 22nd Workshop of the UK Planning and Scheduling Special Interest Group, 23–35.
- de Pomaine, E. 1930. French Cooking in Ten Minutes: Adapting to the Rhythm of Modern Life. North Point Press.
- Deadline-Aware Search Using On-Line Measures of Behavior. In Proceedings of the Symposium on Combinatorial Search (SoCS).
- PDDL2.2: The Language for the Classical Part of the 4th International Planning Competition. Technical Report 195, University of Freiburg.
- A Formal Metareasoning Model of Concurrent Planning and Execution. In AAAI 2023.
- Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning. In ICAPS 2009. AAAI.
- PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains. Journal of Artificial Intelligence Research (JAIR), 20: 61–124.
- Planning Through Stochastic Local Search and Temporal Action Graphs in LPG. J. Artif. Intell. Res., 20: 239–290.
- When to Commit to an Action in Online Planning and Search. In Proceedings of the Fifteenth International Symposium on Combinatorial Search, SOCS 2022, Vienna, Austria, July 21-23, 2022, 83–90. AAAI Press.
- Interleaving Temporal Planning and Execution in Robotics Domains. In AAAI 2004, 617–622. AAAI Press / The MIT Press.
- Morris, P. H. 2016. The Mathematics of Dispatchability Revisited. In ICAPS 2016, 244–252. AAAI Press.
- The RoboCup Logistics League as a Benchmark for Planning in Robotics. In ICAPS Workshop on Planning and Robotics (PlanRob).
- ITSAT: An Efficient SAT-Based Temporal Planner. J. Artif. Intell. Res., 53: 541–632.
- Principles of Metareasoning. Artificial Intelligence, 49(1-3): 361–395.
- Allocating Planning Effort When Actions Expire. In AAAI 2019, 2371–2378. AAAI Press.
- Situated Temporal Planning Using Deadline-aware Metareasoning. In ICAPS 2021, 340–348. AAAI Press.
- Semimyopic Measurement Selection for Optimization Under Uncertainty. IEEE Trans. Systems, Man, and Cybernetics, Part B, 42(2): 565–579.
- Vidal, V. 2004. A Lookahead Strategy for Heuristic Search Planning. In ICAPS 2004, 150–160. AAAI.
- Branching and pruning: An optimal temporal POCL planner based on constraint programming. Artif. Intell., 170(3): 298–335.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
