Constraint Manifold Optimization for Robotic Inference and Planning With Constraints

Author(s)
Zhang, Yetong
Editor(s)
Associated Organization(s)
Organizational Unit
Organizational Unit
School of Computer Science
School established in 2007
Supplementary to:
Abstract
Addressing constraints in optimization problems within robotics has posed a longstanding challenge. However, state-of-the-art constrained optimization methods still face several issues in solving large-scale constrained optimization problems. A powerful alternative to constrained optimization methods is manifold optimization, with the advantages of lower complexity and better numerical properties. This dissertation proposes a novel approach by leveraging manifold optimization to tackle constrained optimization problems in robotics. Moreover, it extends this framework to handle a broader spectrum of inequality-constrained optimization problems by extending the manifold optimization algorithm to manifolds with boundaries and corners. Finally, we enhance the efficiency of the proposed frameworks by developing infeasible optimization methods and the cost-aware retraction method. The effectiveness of our proposed framework is demonstrated through extensive experimentation across diverse robotic inference and planning scenarios under a wide variety of constraints. Results consistently illustrate that our approach outperforms traditional constrained optimization methods, yielding solutions with higher optimality and faster convergence.
Sponsor
Date
2024-07-08
Extent
Resource Type
Text
Resource Subtype
Dissertation
Rights Statement
Rights URI