Research map / Learning theory and algorithms / Combinatorial and search optimization
BT Expansion: a Sound and Complete Algorithm for Behavior Planning of Intelligent Robots with Behavior Trees
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| Use BT expansion instead of the baseline BT-planning approach | Behavior planning · Randomly generated test sets, cases 0–9 | tree size (average): 35.3 vs 85.7; 80.6 vs 457.7; 395.6 vs 4135.0; 41.0 vs 605.2; 41.5 vs 30840.8; 62.7 vs 247.1; 99.7 vs 616.9; 430.0 vs 424 | Helped |
| Use BT expansion rather than the baseline approach | Mobile manipulator behavior planning · Simulated cargo-moving task | solution validity | Helped |
| Expand the goal BT using the sound and complete BT expansion algorithm | STRIPS-style behavior planning problems · Solvable behavior-planning problems | solution guarantee | Helped |
Closest papers by meaning
- MRBTP: Efficient Multi-Robot Behavior Tree Planning and Collaboration (AAAI 2025 · similarity 0.89)
- Tree-Guided Diffusion Planner (NeurIPS 2025 · similarity 0.83)
- Make-An-Agent: A Generalizable Policy Network Generator with Behavior-Prompted Diffusion (NeurIPS 2024 · similarity 0.83)
- In Search of Trees: Decision-Tree Policy Synthesis for Black-Box Systems via Search (AAAI 2025 · similarity 0.82)
- Learning Neuro-Symbolic Abstractions for Robot Planning and Learning (AAAI 2024 · similarity 0.82)
- RoboCerebra: A Large-scale Benchmark for Long-horizon Robotic Manipulation Evaluation (NeurIPS 2025 · similarity 0.82)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.