Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2506.00589

Help | Advanced Search

Computer Science > Robotics

arXiv:2506.00589 (cs)
[Submitted on 31 May 2025 ]

Title: Constrained Stein Variational Gradient Descent for Robot Perception, Planning, and Identification

Title: 约束Stein变分梯度下降法在机器人感知、规划和识别中的应用

Authors:Griffin Tabor, Tucker Hermans
Abstract: Many core problems in robotics can be framed as constrained optimization problems. Often on these problems, the robotic system has uncertainty, or it would be advantageous to identify multiple high quality feasible solutions. To enable this, we present two novel frameworks for applying principles of constrained optimization to the new variational inference algorithm Stein variational gradient descent. Our general framework supports multiple types of constrained optimizers and can handle arbitrary constraints. We demonstrate on a variety of problems that we are able to learn to approximate distributions without violating constraints. Specifically, we show that we can build distributions of: robot motion plans that exactly avoid collisions, robot arm joint angles on the SE(3) manifold with exact table placement constraints, and object poses from point clouds with table placement constraints.
Abstract: 机器人学中的许多核心问题都可以被表述为约束优化问题。通常,在这些问题上,机器人系统存在不确定性,或者识别多个高质量的可行解会很有优势。为此,我们提出了两种新颖的框架,用于将约束优化的原则应用于新的变分推理算法 Stein 变量梯度下降。我们的通用框架支持多种类型的约束优化器,并能够处理任意约束。我们在各种问题上证明了我们能够学会逼近分布而不违反约束。具体来说,我们展示了如何构建以下分布:完全避免碰撞的机器人运动计划,SE(3) 流形上的机器人手臂关节角度具有精确的桌面放置约束,以及具有桌面放置约束的点云中的对象姿态。
Subjects: Robotics (cs.RO) ; Machine Learning (cs.LG)
Cite as: arXiv:2506.00589 [cs.RO]
  (or arXiv:2506.00589v1 [cs.RO] for this version)
  https://doi.org/10.48550/arXiv.2506.00589
arXiv-issued DOI via DataCite

Submission history

From: Griffin Tabor [view email]
[v1] Sat, 31 May 2025 14:52:34 UTC (3,216 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2025-06
Change to browse by:
cs
cs.RO

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

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?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号