PDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning
arXiv:1802.08705
Abstract
Many planning applications involve complex relationships defined on high-dimensional, continuous variables. For example, robotic manipulation requires planning with kinematic, collision, visibility, and motion constraints involving robot configurations, object poses, and robot trajectories. These constraints typically require specialized procedures to sample satisfying values. We extend PDDL to support a generic, declarative specification for these procedures that treats their implementation as black boxes. We provide domain-independent algorithms that reduce PDDLStream problems to a sequence of finite PDDL problems. We also introduce an algorithm that dynamically balances exploring new candidate plans and exploiting existing ones. This enables the algorithm to greedily search the space of parameter bindings to more quickly solve tightly-constrained problems as well as locally optimize to produce low-cost solutions. We evaluate our algorithms on three simulated robotic planning domains as well as several real-world robotic tasks.
International Conference on Automated Planning and Scheduling (ICAPS) 2020
Cited by in corpus (9)
- Learning to Search in Task and Motion Planning with Streams
- Deliberative Acting, Online Planning and Learning with Hierarchical Operational Models
- Hierarchical Planning for Long-Horizon Manipulation with Geometric and Symbolic Scene Graphs
- Extended Tree Search for Robot Task and Motion Planning
- SORNet: Spatial Object-Centric Representations for Sequential Manipulation
- OCRTOC: A Cloud-Based Competition and Benchmark for Robotic Grasping and Manipulation
- Elephants Don't Pack Groceries: Robot Task Planning for Low Entropy Belief States
- Deep Affordance Foresight: Planning Through What Can Be Done in the Future
- A Task-Motion Planning Framework Using Iteratively Deepened AND/OR Graph Networks