IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-69532-5_11.html
   My bibliography  Save this book chapter

Nonholonomic Interpolation for Kinematic Problems, Entropy and Complexity

In: Mathematical Control Theory and Finance

Author

Listed:
  • Jean-Paul Gauthier

    (Université de Bourgogne, LE2I, UMR CNRS 5158)

  • Vladimir Zakalyukin

    (Moscow State University)

Abstract

Summary Here we present the main lines of a theory we developed in a series of previous papers, about the motion planning problem in robotics. We illustrate the theory with a few academic examples. Our theory, although at its starting point, looks promising even from the “constructive” point of view. It does not mean that we have precise general algorithms, but the theory contains this potentiality. The robot is given under the guise of a set of linear kinematic constraints (a distribution). The cost is specified by a riemannian metric on the distribution. Given a non-admissible path for the robot, i.e. a path that does not satisfy the kinematic constraints), our theory allows to evaluate precisely and constructively the “metric complexity” and the “entropy” of the problem. This estimation of metric complexity provides methods for approximation of nonadmissible paths by admissible ones, while the estimation of entropy provides methods for interpolation of the nonadmissible path by admissible.

Suggested Citation

  • Jean-Paul Gauthier & Vladimir Zakalyukin, 2008. "Nonholonomic Interpolation for Kinematic Problems, Entropy and Complexity," Springer Books, in: Andrey Sarychev & Albert Shiryaev & Manuel Guerra & Maria do Rosário Grossinho (ed.), Mathematical Control Theory and Finance, pages 187-210, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-69532-5_11
    DOI: 10.1007/978-3-540-69532-5_11
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-69532-5_11. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.