Verified Task-Space Motion Planning Under Joint-Space Constraints
Researchers propose a method to certify reachable Cartesian steps under joint limits, achieving zero violations and 100% goal reaching in adversarial scenarios.
Article intelligence
Key points
- Standard Bug2 planners violate joint limits in 6-11% of steps and fail up to 18% of the time.
- New method uses S-procedure and semidefinite programming to compute certified step sizes.
- Integrated with Bug2, it achieves zero violations and 100% goal completion.
- Certification computation is sub-millisecond.
Why it matters
This matters because standard Bug2 planners violate joint limits in 6-11% of steps and fail up to 18% of the time.
Technical impact
May affect research directions, evaluation methods, open-source reproduction, and productization paths.
[2605.22991] Verified Task-Space Motion Planning Under Joint-Space Constraints
[Submitted on 21 May 2026]
Title:Verified Task-Space Motion Planning Under Joint-Space Constraints
View a PDF of the paper titled Verified Task-Space Motion Planning Under Joint-Space Constraints, by Hanjiang Hu and 2 other authors
View PDF HTML (experimental)
Abstract:Reactive task-space planners such as Bug2 operate with fixed Cartesian step sizes and are unaware of the manipulator's joint-angle limits. When the Jacobian is poorly conditioned, even small Cartesian steps can demand joint changes that exceed admissible bounds; clipping the joints to their limits causes tracking drift and can prevent goal reaching entirely. We address this by computing, at each planning step, the largest Cartesian hyperrectangle that is \emph{certifiably reachable} under joint displacement bounds. Using a second-order polynomial approximation of the inverse kinematics and the S-procedure, we formulate a small semidefinite program whose solution yields the certified half-width~$\lambda^\star$. An equivalent bisection procedure exploiting the quadratic structure solves the certification in sub-millisecond time. Integrating this certificate with Bug2 yields a planner whose step size adapts to local kinematic conditioning. In a statistical evaluation over 94 adversarial scenarios spanning six joint-limit settings, the SOS-verified planner achieves \emph{zero} joint-limit violations with a 100\% goal-reaching rate, whereas a standard Bug2 planner violates joint limits in 6--11\% of steps and fails to reach the goal in up to 18\% of scenarios.
Subjects:
Robotics (cs.RO)
Cite as: arXiv:2605.22991 [cs.RO]
(or arXiv:2605.22991v1 [cs.RO] for this version)
https://doi.org/10.48550/arXiv.2605.22991
arXiv-issued DOI via DataCite (pending registration)
Submission history
From: Hanjiang Hu [view email] [v1] Thu, 21 May 2026 19:42:29 UTC (315 KB)
Full-text links:
Access Paper:
View a PDF of the paper titled Verified Task-Space Motion Planning Under Joint-Space Constraints, by Hanjiang Hu and 2 other authors
View PDF
HTML (experimental)
TeX Source
view license
Current browse context:
cs.RO
new | recent | 2026-05
Change to browse by:
cs
References & Citations
NASA ADS
Google Scholar
Semantic Scholar
Loading...
Data provided by:
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media
Code, Data and Media Associated with this Article
alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos
Demos
Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers
Recommenders and Search Tools
Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
Author
Venue
Institution
Topic
About arXivLabs
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)