The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Task constrained motion planning in robot joint space
Abstract
We explore global randomized joint space path planning for articulated robots that are subject to task space constraints. This paper describes a representation of constrained motion for joint space planners and develops two simple and efficient methods for constrained sampling of joint configurations: Tangent Space Sampling (TS) and First-Order Retraction (FR). Constrained joint space planning is important for many real world problems involving redundant manipulators. On the one hand, tasks are designated in work space coordinates: rotating doors about fixed axes, sliding drawers along fixed trajectories or holding objects level during transport. On the other, joint space planning gives alternative paths that use redundant degrees of freedom to avoid obstacles or satisfy additional goals while performing a task. In simulation, we demonstrate that our methods are faster and significantly more invariant to problem/algorithm parameters than existing techniques.
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×
“For a more comprehensive exploration of the search space, motion planning research has headed towards feasible solutions and probabilistically complete algorithms such as PRM[ 14 ] and RRT [15][16].”
Method
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
Task Space Regions: A framework for pose-constrained manipulation planning
Berenson, D., Srinivasa, S., & Kuffner, J. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364910396389 · Cited by 368
Sampling-Based Path Planning on Configuration-Space Costmaps
Jaillet, L., Cortés, J., & Siméon, T. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2010.2049527 · Cited by 367
Manipulation planning on constraint manifolds
Berenson, D., Srinivasa, S. S., Ferguson, D., & Kuffner, J. J. (2009) · 2009 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.2009.5152399 · Cited by 296
Sung, J., Jin, S. H., & Saxena, A. (2018) · Springer Proceedings in Advanced Robotics · doi:10.1007/978-3-319-60916-4_40 · Cited by 52
“feedbacks [60, 58] to adapt exactly to the object as well as find a collision free path [49].”
Background
Metadata
- Authors
- Stilman, M.
- Venue
- 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems
- Publisher
- IEEE
- Published
- 2007-10
- Pages
- 3074-3081
- OpenAlex
- W2102128251
- Cited by
- 181
- References
- 1
- FWCI
- 9.31
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Task constrained motion planning in robot joint space. https://app.cochat.ai/papers/10.1109/iros.2007.4399305
- The paper
- Stilman, M. (2007). Task constrained motion planning in robot joint space. 2007 IEEE/RSJ International Conference on Intelligent Robots and Systems. https://doi.org/10.1109/iros.2007.4399305
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.