Current geometric path planners for nonholonomic parallel orienting robots generate maneuvers consisting of a sequence of moves connected by zero-velocity points. The need for these maneuvers restrains the use of this kind of parallel robots to few applications. Based on a rather old result on linear time-varying systems, this letter shows that there are infinitely differentiable paths connecting two arbitrary points in SO(3) such that the instantaneous axis of rotation along the path rest on a fixed plane. This theoretical result leads to a practical path planner for nonholonomic parallel orienting robots that generates single-move maneuvers. To present this result, we start with a path planner based on three-move maneuvers, and then we proceed by progressively reducing the number of moves to one, thus providing a unified treatment with respect to previous geometric path planners. ; Peer Reviewed ; Postprint (author's final draft)


    Access

    Download


    Export, share and cite



    Geometric path planning without maneuvers for nonholonomic parallel orienting robots

    Grosch, Patrick / Thomas, Federico | BASE | 2016

    Free access

    Nonholonomic path planning of space robots

    Nakamura, Y. / Mukherjee, R. | Tema Archive | 1989


    Nonholonomic path planning of space robots via bi-directional approach

    Nakamura, Y. / Mukherjee, R. | Tema Archive | 1990


    Motion Control for Autonomous Maneuvers of a Nonholonomic Vehicle

    Paromtchik, I. / Garnier, P. / Laugier, C. et al. | British Library Conference Proceedings | 1998


    Motion control for autonomous maneuvers of a nonholonomic vehicle

    Paromtchik, I.E. / Garnier, P. / Laugier, C. | Tema Archive | 1998