This paper presents an approach for approximating the reachable space of robotic manipulators based on convex polytopes. The proposed approach predicts the reachable space over a given time horizon based on the robot’s actuation limits and kinematic constraints. The approach is furthermore extended to integrate the robot’s environment, assuming it can be expressed in a form of linear constraints, and to account for the robot’s link geometry. The accuracy of the proposed method is evaluated using simulations of robot’s nonlinear dynamics and it is compared against the cartesian space limits, usually provided by manufacturers in standard datasheets. The accuracy analysis results show that the proposed method has good performance for the time horizons up to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$t_h\!\le $$\end{document}250 ms, encapsulating most of the simulated robot’s reachable space while maintaining comparable volume. For a 7 dof robot, the method has an average execution time of 50ms, independent of the horizon time, potentially enabling real-time applications.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Approximating Robot Reachable Space Using Convex Polytopes


    Additional title:

    Springer Proceedings in Advanced Robotics


    Contributors:

    Conference:

    International Workshop on Human-Friendly Robotics ; 2022 ; Delft, The Netherlands September 22, 2022 - September 23, 2022



    Publication date :

    2023-01-02


    Size :

    16 pages





    Type of media :

    Article/Chapter (Book)


    Type of material :

    Electronic Resource


    Language :

    English




    Morphological Decomposition of Convex Polytopes and its Application in Discrete Image Space

    Ohn, S. Y. / Wong, E. K. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    REACHABLE RANGE CALCULATION DEVICE, REACHABLE RANGE CALCULATION METHOD, AND REACHABLE RANGE CALCULATION PROGRAM

    HIROSE TOMOHIRO / ITO YOICHI / YASUSHI MITSUO et al. | European Patent Office | 2019

    Free access

    Tunnel-MILP: Path Planning with Sequential Convex Polytopes

    Vitus, Michael / Pradeep, Vijay / Hoffmann, Gabriel et al. | AIAA | 2008


    Optimal Aircraft Trajectories in Maximum Reachable Air Space Analysis

    Sheu, D. L. | British Library Conference Proceedings | 1993


    Collision avoidance for UAVs using reachable sets

    Lin, Yucong / Saripalli, Srikanth | IEEE | 2015