Skip to main navigation Skip to search Skip to main content

Optimization on the space of rigid and flexible motions: An alternative manifold optimization approach

  • Pirooz Vakili
  • , Hanieh Mirzaei
  • , Shahrooz Zarbafian
  • , Ioannis Ch Paschalidis
  • , Dima Kozakov
  • , Sandor Vajda
  • Boston University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In this paper we consider the problem of minimization of a cost function that depends on the location and poses of one or more rigid bodies, or bodies that consist of rigid parts hinged together. We present a unified setting for formulating this problem as an optimization on an appropriately defined manifold for which efficient manifold optimizations can be developed. This setting is based on a Lie group representation of the rigid movements of a body that is different from what is commonly used for this purpose. We illustrate this approach by using the steepest descent algorithm on the manifold of the search space and specify conditions for its convergence.

Original languageEnglish
Title of host publication53rd IEEE Conference on Decision and Control,CDC 2014
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages5825-5830
Number of pages6
EditionFebruary
ISBN (Electronic)9781479977468
DOIs
StatePublished - 2014
Event2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014 - Los Angeles, United States
Duration: Dec 15 2014Dec 17 2014

Publication series

NameProceedings of the IEEE Conference on Decision and Control
NumberFebruary
Volume2015-February
ISSN (Print)0743-1546
ISSN (Electronic)2576-2370

Conference

Conference2014 53rd IEEE Annual Conference on Decision and Control, CDC 2014
Country/TerritoryUnited States
CityLos Angeles
Period12/15/1412/17/14

Fingerprint

Dive into the research topics of 'Optimization on the space of rigid and flexible motions: An alternative manifold optimization approach'. Together they form a unique fingerprint.

Cite this