FFRob: Leveraging symbolic planning for efficient task and motion planning
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Mobile manipulation problems involving many objects are challenging to solve due to the high dimensionality and multi-modality of their hybrid configuration spaces. Planners that perform a purely geometric search are prohibitively slow for solving these problems because they are unable to factor the configuration space. Symbolic task planners can efficiently construct plans involving many variables but cannot represent the geometric and kinematic constraints required in manipulation. We present the FFRob algorithm for solving task and motion planning problems. First, we introduce extended action specification (EAS) as a general purpose planning representation that supports arbitrary predicates as conditions. We adapt existing heuristic search ideas for solving strips planning problems, particularly delete-relaxations, to solve EAS problem instances. We then apply the EAS representation and planners to manipulation problems resulting in FFRob. FFRob iteratively discretizes task and motion planning problems using batch sampling of manipulation primitives and a multi-query roadmap structure that can be conditionalized to evaluate reachability under different placements of movable objects. This structure enables the EAS planner to efficiently compute heuristics that incorporate geometric and kinematic planning constraints to give a tight estimate of the distance to the goal. Additionally, we show FFRob is probabilistically complete and has a finite expected runtime. Finally, we empirically demonstrate FFRob’s effectiveness on complex and diverse task and motion planning tasks including rearrangement planning and navigation among movable objects.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 2×
“The CRG is graph ( V, E ) , which is related to a PRM (Kavraki et al. 1996), that answers reachability queries, conditioned on the poses of objects and the robot’s grasp, by lazily computing answers on demand and caching results to speed up future queries.”
BackgroundSTRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Fikes, R. E., & Nilsson, N. J. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90010-5 · Cited by 4,882 · cited 1×
“The original Shakey and STRIPS robot system Fikes & Nilsson (1971); Nilsson (1984), from which many of these symbolic planners evolved, managed to plan for an actual robot by working in a domain where all legal symbolic plans were effectively executable.”
Background
Cited by
Integrated Task and Motion Planning
Garrett, C. R., Chitnis, R., Holladay, R., Kim, B., Silver, T., Kaelbling, L. P., & Lozano-Pérez, T. (2021) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-091420-084139 · Cited by 409
Self-citationPDDLStream: Integrating Symbolic Planners and Blackbox Samplers via Optimistic Adaptive Planning
Garrett, C. R., Lozano-Pérez, T., & Kaelbling, L. P. (2020) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v30i1.6739 · Cited by 191
Self-citationAutoTAMP: Autoregressive Task and Motion Planning with LLMs as Translators and Checkers
Chen, Y., Arkin, J., Dawson, C., Zhang, Y., Roy, N., & Fan, C. (2023) · arXiv · doi:10.48550/arxiv.2306.06531 · Cited by 146
Weihs, L., Deitke, M., Kembhavi, A., & Mottaghi, R. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00586 · Cited by 98
“Our work can be considered as an instance of joint task and motion planning [25, 43, 35, 17, 12] since solving the rearrangement task requires low-level motion planning to plan a sequence of actions and high-level task planning to recover the goal state from the initial state of the scene.”
BackgroundInteractive Task Planning with Language Models
Li, B., Wu, P., Abbeel, P., & Malik, J. (2023) · arXiv · doi:10.48550/arxiv.2310.10645 · Cited by 41
Metadata
- Authors
- Garrett, C. R., Lozano-Pérez, T., & Kaelbling, L. P.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2017-11-12
- Volume
- 37
- Issue
- 1
- Pages
- 104-136
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2490090381
- Cited by
- 135
- References
- 2
- FWCI
- 4.94
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: FFRob: Leveraging symbolic planning for efficient task and motion planning. https://app.cochat.ai/papers/10.1177/0278364917739114
- The paper
- Garrett, C. R., Lozano-Pérez, T., & Kaelbling, L. P. (2018). FFRob: Leveraging symbolic planning for efficient task and motion planning. The International Journal of Robotics Research. https://doi.org/10.1177/0278364917739114
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.