Combined task and motion planning through an extensible planner-independent interface layer
The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Abstract
The need for combined task and motion planning in robotics is well understood. Solutions to this problem have typically relied on special purpose, integrated implementations of task planning and motion planning algorithms. We propose a new approach that uses off-the-shelf task planners and motion planners and makes no assumptions about their implementation. Doing so enables our approach to directly build on, and benefit from, the vast literature and latest advances in task planning and motion planning. It uses a novel representational abstraction and requires only that failures in computing a motion plan for a high-level action be identifiable and expressible in the form of logical predicates at the task level. We evaluate the approach and illustrate its robustness through a number of experiments using a state-of-the-art robotics simulator and a PR2 robot. These experiments show the system accomplishing a diverse set of challenging tasks such as taking advantage of a tray when laying out a table for dinner and picking objects from cluttered environments where other objects need to be re-arranged before the target object can be reached.
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 1×
“This approach requires the motion planner to use probabilistic roadmaps (PRMs) [14] with one roadmap per movable object, and per permutation of a movable object in each gripper for robots like the PR2.”
MethodThe FF Planning System: Fast Plan Generation Through Heuristic Search
Hoffmann, J., & Nebel, B. (2001) · Journal of Artificial Intelligence Research · doi:10.1613/jair.855 · Cited by 1,838
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
The Fast Downward Planning System
Helmert, M. (2006) · Cited by 1,222
The Fast Downward Planning System
Helmert, M. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1705 · Cited by 510
Hierarchical task and motion planning in the now
Kaelbling, L. P., & Lozano-Perez, T. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980391 · Cited by 467
Automated construction of robotic manipulation programs
Takeo Kanade, A., Kuffner, J., & Diankov, R. (2010) · Cited by 458
Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization
Schulman, J., Ho, J., Lee, A., Awwal, I., Bradlow, H., & Abbeel, P. (2013) · Robotics: Science and Systems IX · doi:10.15607/rss.2013.ix.031 · Cited by 430
Self-citationPlanning with incomplete information as heuristic search in belief space
Bonet, B., & Geffner, H. (2000) · International Conference on Artificial Intelligence Planning Systems · Cited by 346
The CLARAty architecture for robotic autonomy
Volpe, R., Nesnas, I., Estlin, T., Mutz, D., Petras, R., & Das, H. (2002) · 2001 IEEE Aerospace Conference Proceedings (Cat. No.01TH8542) · doi:10.1109/aero.2001.931701 · Cited by 265
Cited by
Overcoming Exploration in Reinforcement Learning with Demonstrations
Nair, A., McGrew, B., Andrychowicz, M., Zaremba, W., & Abbeel, P. (2018) · 2018 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2018.8463162 · Cited by 712
Self-citationIntegrated 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-citationIQA: Visual Question Answering in Interactive Environments
Gordon, D., Kembhavi, A., Rastegari, M., Redmon, J., Fox, D., & Farhadi, A. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00430 · Cited by 352
Inner Monologue: Embodied Reasoning through Planning with Language Models
Huang, W., Xia, F., Xiao, T., Chan, H., Liang, J., Florence, P., Zeng, A., Tompson, J., Mordatch, I., Chebotar, Y., et al. (2022) · arXiv · doi:10.48550/arxiv.2207.05608 · Cited by 287
“Task and motion planning [22, 23] requires simultaneously solving a high-level, discrete task planning problem [24, 25, 26], and a low-level, continuous motion planning problem [27].”
ROSPlan: Planning in the Robot Operating System
Cashmore, M., Fox, M., Long, D., Magazzeni, D., Ridder, B., Carrera, A., Palomeras, N., Hurtos, N., & Carreras, M. (2015) · Proceedings of the International Conference on Automated Planning and Scheduling · doi:10.1609/icaps.v25i1.13699 · Cited by 245
“…et al. (2014) describe a configurable anytime meta-planner that drives a (PO)MDP planner, anticipating the probabilistic evolution of the system; Srivastava et al. (2014) provide an interface between task and motion planning, reasoning about geometric constraints and communicating those to a…”
BackgroundPDDLStream: 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
AutoTAMP: 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
Towards Blended Reactive Planning and Acting using Behavior Trees
Colledanchise, M., Almeida, D., & Ogren, P. (2019) · 2019 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2019.8794128 · Cited by 133
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.”
BackgroundManipulaTHOR: A Framework for Visual Object Manipulation
Ehsani, K., Han, W., Herrasti, A., VanderBilt, E., Weihs, L., Kolve, E., Kembhavi, A., & Mottaghi, R. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.00447 · Cited by 81
“Past works for visual object manipulation tend to use modular designs to solve this problem [25, 30, 14] – for instance, employing object detection models, instance segmentation models, point cloud estimators, etc. and then feeding these outputs into a planner.”
BackgroundSkillMaN — A skill-based robotic manipulation framework based on perception and reasoning
Diab, M., Pomarlan, M., Beßler, D., Akbari, A., Rosell, J., Bateman, J., & Beetz, M. (2020) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2020.103653 · Cited by 23
MPTP: Motion-Planning-Aware Task Planning for Navigation in Belief Space
Thomas, A., Mastrogiovanni, F., & Baglietto, M. (2021) · Robotics and Autonomous Systems · doi:10.1016/j.robot.2021.103786 · Cited by 21
“[3] implicitly incorporate geometric variables, performing symbolic-geometric mapping using a planner-independent interface layer.”
BackgroundMethodTian, H., Song, C., Wang, C., Zhang, X., & Pan, J. (2023) · IEEE Transactions on Robotics · doi:10.1109/tro.2022.3191596 · Cited by 15
Murali, A., Mousavian, A., Eppner, C., Fishman, A., & Fox, D. (2023) · arXiv · doi:10.48550/arxiv.2304.09302 · Cited by 14
Gan, C., Zhou, S., Schwartz, J., Alter, S., Bhandwaldar, A., Gutfreund, D., Yamins, D. L. K., DiCarlo, J. J., McDermott, J., Torralba, A., et al. (2021) · arXiv · doi:10.48550/arxiv.2103.14025 · Cited by 13
Metadata
- Authors
- Srivastava, S., Fang, E., Riano, L., Chitnis, R., Russell, S., & Abbeel, P.
- Venue
- 2014 IEEE International Conference on Robotics and Automation (ICRA)
- Publisher
- IEEE
- Published
- 2014-05
- Pages
- 639-646
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2141841102
- Cited by
- 459
- References
- 21
- FWCI
- 16.21
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.