Skip to main content

Using Computer Algebra Tools to Classify Serial Manipulators

  • Conference paper
Automated Deduction in Geometry (ADG 2002)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 2930))

Included in the following conference series:

Abstract

In this paper we present a classification of 3-revolute-jointed manipulators based on the cuspidal behaviour. It was shown in a previous work [16] that this ability to change posture without meeting a singularity is equivalent to the existence of a point in the workspace, such that a polynomial of degree four depending on the parameters of the manipulator and on the cartesian coordinates of the effector has a triple root.

More precisely, from a partition of the parameters’space, such that in any connected component of this partition the number of triple roots is constant, we need to compute one sample point by cell, in order to have a full description, in terms of cuspidality, of the different possible configurations.

This kind of work can be divided into two parts. First of all, thanks to Groebner Bases computations, the goal is to obtain an algebraic set in the parameters’space describing the cuspidality behavior and then to compute a CAD adapted to this set.

In order to simplify the problem, we use strongly the fact that a manipulator cannot be constructed with exact parameters, in other words, we are just interested in the generic solutions of our problem.

This consideration leads us to work with triangular sets rather than with the global Groebner Bases and to adapt the CAD of Collins as we will just take care of the cells of maximal dimension.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Akritas, G., Bocharov, A., Strzebonski, A.: Implementation of real roots isolation algorithms in mathematica. In: Abstracts of the International Conference on Interval and Computer Algebraic Methods in Science and Ingineering, pp. 23–27 (1994)

    Google Scholar 

  2. Aubry, P., Lazard, D., Moreno Maza, M.: On the theories of triangular sets. Journal of Symbilic Computation 28, 105–124 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  3. Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 515–532. Springer, Heidelberg (1975)

    Google Scholar 

  4. Cox, D., Little, J., O’Shea, D.: Ideals, varieties, and algorithms an introduction to computational algebraic geometry and commutative algebra. Undergraduate texts in mathematics. Springer, New York (1992)

    MATH  Google Scholar 

  5. Faugère, J.-C.: A new efficient algorithm for computing gröbner bases (f4). Journal of Pure and Applied Algebra 139(1-3), 61–88 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  6. Johnson, J.R., Krandick, W.: Polynomial real roots isolation using approximate arithmetic. Advances in Applied Mathematics 17(3), 308–336 (1996)

    Article  MathSciNet  Google Scholar 

  7. Manocha, D.: Algebraic and Numeric Techniques for modeling and Robotics. PhD thesis, University of California at Berkeley (1992)

    Google Scholar 

  8. Mourrain, B., Vrahatis, M., Yakoubsohn, J.C.: On the complexity of isolating real roots and computing with certainty the topological degree. Journal of Complexity 18(2), 612–640 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  9. El Omri, J.: Analyse gomtrique et cinmatique des mcanismes de type manipulateur. PhD thesis, Universit de Nantes (February 1996)

    Google Scholar 

  10. Rouillier, F.: Algorithmes efficaces pour l’étude des zéros réels des systèmes polynomiaux. PhD thesis, Université de Rennes I (May 1996)

    Google Scholar 

  11. Rouillier, F.: Solving zero-dimensional systems through the rational univariate representation. Journal of Applicable Algebra in Engineering, Communication and Computing 9(5), 433–461 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rouillier, F., Zimmermann, P.: Efficient isolation of a polynomial real roots. Technical Report RR-4113, INRIA (2001)

    Google Scholar 

  13. Trebuchet, P.: Vers une rsolution stable et rapide des quations algbriques. PhD thesis, Universit de Paris VI (2002)

    Google Scholar 

  14. Wang, D.: Elimination Methods. Springer, New York (2001)

    MATH  Google Scholar 

  15. Wenger, P.: Classification of 3r positioning manipulators. Journal of Mechanical Design 120, 327–332 (1998)

    Article  Google Scholar 

  16. Wenger, P., El Omri, J.: Changing posture for cuspidal robot manipulators. In: Proceeding of the 1996 IEEE Int. Conf. on Robotics and Automation, pp. 3173–3178 (1996)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Corvez, S., Rouillier, F. (2004). Using Computer Algebra Tools to Classify Serial Manipulators. In: Winkler, F. (eds) Automated Deduction in Geometry. ADG 2002. Lecture Notes in Computer Science(), vol 2930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24616-9_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24616-9_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20927-0

  • Online ISBN: 978-3-540-24616-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics