A branch and prune algorithm for the computation of generalized aspects of parallel robots

S. Caro, D. Chablat, A. Goldsztejn, D. Ishii, C. Jermann

    Research output: Contribution to journalArticle

    11 Citations (Scopus)

    Abstract

    Parallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design. In particular, they often have parallel singularities at some poses, and the robots may become uncontrollable, and could even be damaged, in such configurations. The computation of the connected components in the set of nonsingular reachable configurations, called generalized aspects, is therefore a key issue in their design. This paper introduces a new method, based on numerical constraint programming, to compute a certified enclosure of the generalized aspects. Though this method does not allow counting their number rigorously, it constructs inner approximations of the nonsingular workspace that allow commanding parallel robots safely. It also provides a lower-bound on the exact number of generalized aspects. It is moreover the first general method able to handle any parallel robot in theory, though its computational complexity currently restricts its usage to robots with three degrees of freedom. Finally, the constraint programming paradigm it relies on makes it possible to consider various additional constraints (e.g., collision avoidance), making it suitable for practical considerations.

    Original languageEnglish
    Pages (from-to)34-50
    Number of pages17
    JournalArtificial Intelligence
    Volume211
    Issue number1
    DOIs
    Publication statusPublished - 2014

    Fingerprint

    robot
    Robots
    programming
    Collision avoidance
    Enclosures
    Computational complexity
    Robot
    paradigm
    Programming

    Keywords

    • Generalized aspects
    • Numerical constraints
    • Parallel robots
    • Singularities

    ASJC Scopus subject areas

    • Artificial Intelligence
    • Language and Linguistics
    • Linguistics and Language

    Cite this

    A branch and prune algorithm for the computation of generalized aspects of parallel robots. / Caro, S.; Chablat, D.; Goldsztejn, A.; Ishii, D.; Jermann, C.

    In: Artificial Intelligence, Vol. 211, No. 1, 2014, p. 34-50.

    Research output: Contribution to journalArticle

    Caro, S. ; Chablat, D. ; Goldsztejn, A. ; Ishii, D. ; Jermann, C. / A branch and prune algorithm for the computation of generalized aspects of parallel robots. In: Artificial Intelligence. 2014 ; Vol. 211, No. 1. pp. 34-50.
    @article{52e9f6a4aa2f461b8832a518c655d34f,
    title = "A branch and prune algorithm for the computation of generalized aspects of parallel robots",
    abstract = "Parallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design. In particular, they often have parallel singularities at some poses, and the robots may become uncontrollable, and could even be damaged, in such configurations. The computation of the connected components in the set of nonsingular reachable configurations, called generalized aspects, is therefore a key issue in their design. This paper introduces a new method, based on numerical constraint programming, to compute a certified enclosure of the generalized aspects. Though this method does not allow counting their number rigorously, it constructs inner approximations of the nonsingular workspace that allow commanding parallel robots safely. It also provides a lower-bound on the exact number of generalized aspects. It is moreover the first general method able to handle any parallel robot in theory, though its computational complexity currently restricts its usage to robots with three degrees of freedom. Finally, the constraint programming paradigm it relies on makes it possible to consider various additional constraints (e.g., collision avoidance), making it suitable for practical considerations.",
    keywords = "Generalized aspects, Numerical constraints, Parallel robots, Singularities",
    author = "S. Caro and D. Chablat and A. Goldsztejn and D. Ishii and C. Jermann",
    year = "2014",
    doi = "10.1016/j.artint.2014.02.001",
    language = "English",
    volume = "211",
    pages = "34--50",
    journal = "Artificial Intelligence",
    issn = "0004-3702",
    publisher = "Elsevier",
    number = "1",

    }

    TY - JOUR

    T1 - A branch and prune algorithm for the computation of generalized aspects of parallel robots

    AU - Caro, S.

    AU - Chablat, D.

    AU - Goldsztejn, A.

    AU - Ishii, D.

    AU - Jermann, C.

    PY - 2014

    Y1 - 2014

    N2 - Parallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design. In particular, they often have parallel singularities at some poses, and the robots may become uncontrollable, and could even be damaged, in such configurations. The computation of the connected components in the set of nonsingular reachable configurations, called generalized aspects, is therefore a key issue in their design. This paper introduces a new method, based on numerical constraint programming, to compute a certified enclosure of the generalized aspects. Though this method does not allow counting their number rigorously, it constructs inner approximations of the nonsingular workspace that allow commanding parallel robots safely. It also provides a lower-bound on the exact number of generalized aspects. It is moreover the first general method able to handle any parallel robot in theory, though its computational complexity currently restricts its usage to robots with three degrees of freedom. Finally, the constraint programming paradigm it relies on makes it possible to consider various additional constraints (e.g., collision avoidance), making it suitable for practical considerations.

    AB - Parallel robots enjoy enhanced mechanical characteristics that have to be contrasted with a more complicated design. In particular, they often have parallel singularities at some poses, and the robots may become uncontrollable, and could even be damaged, in such configurations. The computation of the connected components in the set of nonsingular reachable configurations, called generalized aspects, is therefore a key issue in their design. This paper introduces a new method, based on numerical constraint programming, to compute a certified enclosure of the generalized aspects. Though this method does not allow counting their number rigorously, it constructs inner approximations of the nonsingular workspace that allow commanding parallel robots safely. It also provides a lower-bound on the exact number of generalized aspects. It is moreover the first general method able to handle any parallel robot in theory, though its computational complexity currently restricts its usage to robots with three degrees of freedom. Finally, the constraint programming paradigm it relies on makes it possible to consider various additional constraints (e.g., collision avoidance), making it suitable for practical considerations.

    KW - Generalized aspects

    KW - Numerical constraints

    KW - Parallel robots

    KW - Singularities

    UR - http://www.scopus.com/inward/record.url?scp=84897011527&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=84897011527&partnerID=8YFLogxK

    U2 - 10.1016/j.artint.2014.02.001

    DO - 10.1016/j.artint.2014.02.001

    M3 - Article

    VL - 211

    SP - 34

    EP - 50

    JO - Artificial Intelligence

    JF - Artificial Intelligence

    SN - 0004-3702

    IS - 1

    ER -