An algorithm based on rolling to generate smooth interpolating curves on ellipsoids

Krzysztof Krakowski; Fátima Silva Leite

Kybernetika (2014)

  • Volume: 50, Issue: 4, page 544-562
  • ISSN: 0023-5954

Abstract

top
We present an algorithm to generate a smooth curve interpolating a set of data on an n -dimensional ellipsoid, which is given in closed form. This is inspired by an algorithm based on a rolling and wrapping technique, described in [11] for data on a general manifold embedded in Euclidean space. Since the ellipsoid can be embedded in an Euclidean space, this algorithm can be implemented, at least theoretically. However, one of the basic steps of that algorithm consists in rolling the ellipsoid, over its affine tangent space at a point, along a curve. This would allow to project data from the ellipsoid to a space where interpolation problems can be easily solved. However, even if one chooses to roll along a geodesic, the fact that explicit forms for Euclidean geodesics on the ellipsoid are not known, would be a major obstacle to implement the rolling part of the algorithm. To overcome this problem and achieve our goal, we embed the ellipsoid and its affine tangent space in ℝ n + 1 equipped with an appropriate Riemannian metric, so that geodesics are given in explicit form and, consequently, the kinematics of the rolling motion are easy to solve. By doing so, we can rewrite the algorithm to generate a smooth interpolating curve on the ellipsoid which is given in closed form.

How to cite

top

Krakowski, Krzysztof, and Silva Leite, Fátima. "An algorithm based on rolling to generate smooth interpolating curves on ellipsoids." Kybernetika 50.4 (2014): 544-562. <http://eudml.org/doc/262020>.

@article{Krakowski2014,
abstract = {We present an algorithm to generate a smooth curve interpolating a set of data on an $n$-dimensional ellipsoid, which is given in closed form. This is inspired by an algorithm based on a rolling and wrapping technique, described in [11] for data on a general manifold embedded in Euclidean space. Since the ellipsoid can be embedded in an Euclidean space, this algorithm can be implemented, at least theoretically. However, one of the basic steps of that algorithm consists in rolling the ellipsoid, over its affine tangent space at a point, along a curve. This would allow to project data from the ellipsoid to a space where interpolation problems can be easily solved. However, even if one chooses to roll along a geodesic, the fact that explicit forms for Euclidean geodesics on the ellipsoid are not known, would be a major obstacle to implement the rolling part of the algorithm. To overcome this problem and achieve our goal, we embed the ellipsoid and its affine tangent space in $\mathbb \{R\}^\{n+1\}$ equipped with an appropriate Riemannian metric, so that geodesics are given in explicit form and, consequently, the kinematics of the rolling motion are easy to solve. By doing so, we can rewrite the algorithm to generate a smooth interpolating curve on the ellipsoid which is given in closed form.},
author = {Krakowski, Krzysztof, Silva Leite, Fátima},
journal = {Kybernetika},
keywords = {rolling; group of isometries; ellipsoid; kinematic equations; interpolation; interpolating curve; curve on surface; rolling; ellipsoid; kinematic equation; geodesic; continuity; algorithm},
language = {eng},
number = {4},
pages = {544-562},
publisher = {Institute of Information Theory and Automation AS CR},
title = {An algorithm based on rolling to generate smooth interpolating curves on ellipsoids},
url = {http://eudml.org/doc/262020},
volume = {50},
year = {2014},
}

TY - JOUR
AU - Krakowski, Krzysztof
AU - Silva Leite, Fátima
TI - An algorithm based on rolling to generate smooth interpolating curves on ellipsoids
JO - Kybernetika
PY - 2014
PB - Institute of Information Theory and Automation AS CR
VL - 50
IS - 4
SP - 544
EP - 562
AB - We present an algorithm to generate a smooth curve interpolating a set of data on an $n$-dimensional ellipsoid, which is given in closed form. This is inspired by an algorithm based on a rolling and wrapping technique, described in [11] for data on a general manifold embedded in Euclidean space. Since the ellipsoid can be embedded in an Euclidean space, this algorithm can be implemented, at least theoretically. However, one of the basic steps of that algorithm consists in rolling the ellipsoid, over its affine tangent space at a point, along a curve. This would allow to project data from the ellipsoid to a space where interpolation problems can be easily solved. However, even if one chooses to roll along a geodesic, the fact that explicit forms for Euclidean geodesics on the ellipsoid are not known, would be a major obstacle to implement the rolling part of the algorithm. To overcome this problem and achieve our goal, we embed the ellipsoid and its affine tangent space in $\mathbb {R}^{n+1}$ equipped with an appropriate Riemannian metric, so that geodesics are given in explicit form and, consequently, the kinematics of the rolling motion are easy to solve. By doing so, we can rewrite the algorithm to generate a smooth interpolating curve on the ellipsoid which is given in closed form.
LA - eng
KW - rolling; group of isometries; ellipsoid; kinematic equations; interpolation; interpolating curve; curve on surface; rolling; ellipsoid; kinematic equation; geodesic; continuity; algorithm
UR - http://eudml.org/doc/262020
ER -

References

top
  1. Agrachev, A., Sachkov, Y., Control Theory from the Geometric Viewpoint., In: Encyclopaedia of Mathematical Sciences 87 (2004), Springer-Verlag. Zbl1062.93001MR2062547
  2. Camarinha, M., The Geometry of Cubic Polynomials on Riemannian Manifolds., PhD. Thesis, Departamento de Matemática, Universidade de Coimbra 1996. 
  3. Crouch, P., Kun, G., Leite, F. S., 10.1023/A:1021770717822, J. Dyn. Control Syst. 5 (1999), 3, 397-429. Zbl0961.53027MR1706785DOI10.1023/A:1021770717822
  4. Crouch, P, Leite, F. S., Geometry and the dynamic interpolation problem., In: Proc. American Control Conference Boston 1991, pp. 1131-1137. 
  5. Crouch, P., Leite, F. S., 10.1007/BF02254638, J. Dyn. Control Syst. 1 (1995), 2, 177-202. Zbl0946.58018MR1333770DOI10.1007/BF02254638
  6. Fedorov, Y. N., Jovanović, B., 10.1007/s00332-004-0603-3, J. Nonlinear Sci. 14 (2004), 4, 341-381. Zbl1125.37045MR2076030DOI10.1007/s00332-004-0603-3
  7. Giambó, R., Giannoni, F., Piccione, P., Fitting smooth paths to spherical data., IMA J. Math. Control Inform. 19 (2002), 445-460. MR1949013
  8. Hüper, K., Kleinsteuber, M., Leite, F. S., Rolling Stiefel manifolds., Int. J. Systems Sci. 39 (2008), 8, 881-887. Zbl1168.53007MR2437853
  9. Hüper, K., Krakowski, K. A., Leite, F. S., Rolling Maps in a Riemannian Framework., In: Mathematical Papers in Honour of Fátima Silva Leite, Textos de Matemática 43, Department of Mathematics, University of Coimbra 2011, pp. 15-30. Zbl1254.53018MR2894254
  10. Hüper, K., Leite, F. S., Smooth interpolating curves with applications to path planning., In: 10th IEEE Mediterranean Conference on Control and Automation (MED 2002), Lisbon 2002. 
  11. Hüper, K., Leite, F. S., 10.1007/s10883-007-9027-3, J. Dyn. Control Syst. 13 (2007), 4, 467-502. MR2350231DOI10.1007/s10883-007-9027-3
  12. Jupp, P., Kent, J., 10.2307/2347843, Appl. Statist. 36 (1987), 34-46. Zbl0613.62086MR0887825DOI10.2307/2347843
  13. Jurdjevic, V., Zimmerman, J., Rolling problems on spaces of constant curvature., In: Lagrangian and Hamiltonian methods for nonlinear control 2006, Proc. 3rd IFAC Workshop 2006 (F. Bullo and K. Fujimoto, eds.), Nagoya 2007, Lect. Notes Control Inform. Sciences, Springer, pp. 221-231. Zbl1136.49028MR2376942
  14. Krakowski, K., Leite, F. S., Smooth interpolation on ellipsoids via rolling motions., In: PhysCon 2013, San Luis Potosí, Mexico 2013. 
  15. Krakowski, K. A., Leite, F. S., Why controllability of rolling may fail: a few illustrative examples., In: Pré-Publicações do Departamento de Matemática, No. 12-26, University of Coimbra 2012, pp. 1-30. 
  16. Lee, J. M., Riemannian Manifolds: An Introduction to Curvature., In? Graduate Texts in Mathematics No. 176, Springer-Verlag, New York 1997. Zbl0905.53001MR1468735
  17. Machado, L., Leite, F. S., Krakowski, K., 10.1007/s10883-010-9080-1, J. Dyn. Control Syst. 16 (2010), 1, 121-148. Zbl1203.65028MR2580471DOI10.1007/s10883-010-9080-1
  18. Noakes, L., Heinzinger, G., Paden, B., 10.1093/imamci/6.4.465, IMA J. Math. Control Inform. 6 (1989), 465-473. Zbl0698.58018MR1036158DOI10.1093/imamci/6.4.465
  19. Nomizu, K., 10.2748/tmj/1178229921, Tôhoku Math. J. 30 (1978), 623-637. Zbl0395.53005MR0516894DOI10.2748/tmj/1178229921
  20. Park, F., Ravani, B., Optimal control of the sphere S n rolling on E n ., ASME J. Mech. Design 117 (1995), 36-40. 
  21. Samir, C., Absil, P.-A., Srivastava, A., Klassen, E., 10.1007/s10208-011-9091-7, Found. Comput. Math. 12 (2012), 49-73. Zbl1245.65017MR2886156DOI10.1007/s10208-011-9091-7
  22. Sharpe, R. W., Differential Geometry: Cartan's Generalization of Klein's Erlangen Program., In: Graduate Texts in Mathematics, No. 166. Springer-Verlag, New York 1997. Zbl0876.53001MR1453120
  23. Zimmerman, J., 10.1007/s00498-004-0143-2, Math. Control Signals Systems 17 (2005), 1, 14-37. Zbl1064.49021MR2121282DOI10.1007/s00498-004-0143-2

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.