Reachable Sets for Safe, Real-Time Manipulator Trajectory Design

For robotic arms to operate in arbitrary environments, especially near people, it is critical to certify the safety of their motion planning algorithms. However, there is often a trade-off between safety and real-time performance; one can either carefully design safe plans, or rapidly generate potentially-unsafe plans. This work presents a receding-horizon, real-time trajectory planner with safety guarantees, called ARMTD (Autonomous Reachability-based Manipulator Trajectory Design). The method first computes (offline) a reachable set of parameterized trajectories for each joint of an arm. Each trajectory includes a fail-safe maneuver (braking to a stop). At runtime, in each receding-horizon planning iteration, ARMTD constructs a reachable set of the entire arm in workspace and intersects it with obstacles to generate sub-differentiable and provably-conservative collision-avoidance constraints on the trajectory parameters. ARMTD then performs trajectory optimization for an arbitrary cost function on the parameters, subject to these constraints. On a 6 degree-of-freedom arm, ARMTD outperforms CHOMP in simulation and completes a variety of real-time planning tasks on hardware, all without collisions.

[1]  Thierry Fraichard,et al.  Guaranteeing motion safety for robots , 2012, Auton. Robots.

[2]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[3]  Leonidas J. Guibas,et al.  Zonotopes as bounding volumes , 2003, SODA '03.

[4]  Russ Tedrake,et al.  Funnel libraries for real-time robust feedback motion planning , 2016, Int. J. Robotics Res..

[5]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[6]  Daniel King,et al.  Fetch & Freight : Standard Platforms for Service Robot Applications , 2016 .

[7]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[8]  Elijah Polak,et al.  Optimization: Algorithms and Consistent Approximations , 1997 .

[9]  Nikolaus Correll,et al.  Reducing the Barrier to Entry of Complex Robotic Software: a MoveIt! Case Study , 2014, ArXiv.

[10]  Nancy M. Amato,et al.  Approximate convex decomposition of polyhedra , 2004, Symposium on Solid and Physical Modeling.

[11]  Matthew Johnson-Roberson,et al.  Bridging the gap between safety and real-time performance in receding-horizon trajectory design for mobile robots , 2018, Int. J. Robotics Res..

[12]  Mike Stilman,et al.  Time-Optimal Trajectory Generation for Path Following with Bounded Acceleration and Velocity , 2012, Robotics: Science and Systems.

[13]  Roberto Tempo,et al.  Proceedings of 2015 IEEE 54th Annual Conference on Decision and Control (CDC) , 2015, CDC 2015.

[14]  M. Althoff,et al.  Effortless creation of safe robots from modules through self-programming and self-verification , 2019, Science Robotics.

[15]  Petter Nilsson,et al.  Online Active Safety for Robotic Manipulators , 2019, 2019 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[16]  Pieter Abbeel,et al.  Motion planning with sequential convex optimization and convex collision checking , 2014, Int. J. Robotics Res..

[17]  Kris K. Hauser On responsiveness, safety, and completeness in real-time motion planning , 2012, Auton. Robots.

[18]  Mo Chen,et al.  FaSTrack: A modular framework for fast and guaranteed safe motion planning , 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC).

[19]  Morgan Quigley,et al.  ROS: an open-source Robot Operating System , 2009, ICRA 2009.

[20]  Ramanarayan Vasudevan,et al.  Safe, Aggressive Quadrotor Flight via Reachability-based Trajectory Design , 2019, Volume 3, Rapid Fire Interactive Presentations: Advances in Control Systems; Advances in Robotics and Mechatronics; Automotive and Transportation Systems; Motion Planning and Trajectory Tracking; Soft Mechatronic Actuators and Sensors; Unmanned Ground and.

[21]  Donald Meagher,et al.  Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[22]  Andrea Giusti,et al.  Efficient Computation of Interval-Arithmetic-Based Robust Controllers for Rigid Robots , 2017, 2017 First IEEE International Conference on Robotic Computing (IRC).

[23]  Alexander Verl,et al.  Real-time path planning for a robot arm in changing environments , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[25]  George Konidaris,et al.  Robot Motion Planning on a Chip , 2016, Robotics: Science and Systems.

[26]  Brad Paden,et al.  Globally asymptotically stable ‘PD+’ controller for robot manipulators , 1988 .

[27]  Stewart Worrall,et al.  Towards Provably Not-at-Fault Control of Autonomous Robots in Arbitrary Dynamic Environments , 2019, Robotics: Science and Systems.

[28]  Mo Chen,et al.  Decomposition of Reachable Sets and Tubes for a Class of Nonlinear Systems , 2016, IEEE Transactions on Automatic Control.

[29]  Stephen P. Boyd,et al.  Subgradient Methods , 2007 .

[30]  Chonhyon Park,et al.  ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments , 2012, ICAPS.

[31]  Matthias Althoff,et al.  Reachability Analysis and its Application to the Safety Assessment of Autonomous Cars , 2010 .

[32]  Antoine Girard,et al.  Reachability of Uncertain Linear Systems Using Zonotopes , 2005, HSCC.

[33]  Siddhartha S. Srinivasa,et al.  CHOMP: Covariant Hamiltonian optimization for motion planning , 2013, Int. J. Robotics Res..

[34]  Friedrich Pfeiffer,et al.  A concept for manipulator trajectory planning , 1987, IEEE J. Robotics Autom..

[35]  Amir Ali Ahmadi,et al.  Control and verification of high-dimensional systems with DSOS and SDSOS programming , 2014, 53rd IEEE Conference on Decision and Control.

[36]  Matthias Althoff,et al.  An Introduction to CORA 2015 , 2015, ARCH@CPSWeek.

[37]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..