Alternative Paths Planner (APP) for Provably Fixed-time Manipulation Planning in Semi-structured Environments

In many applications, including logistics and manufacturing, robot manipulators operate in semi-structured environments alongside humans or other robots. These environments are largely static, but they may contain some movable obstacles that the robot must avoid. Manipulation tasks in these applications are often highly repetitive, but require fast and reliable motion planning capabilities, often under strict time constraints. Existing preprocessing-based approaches are beneficial when the environments are highly-structured, but their performance degrades in the presence of movable obstacles, since these are not modelled a priori. We propose a novel preprocessing-based method called Alternative Paths Planner (APP) that provides provably fixed-time planning guarantees in semi-structured environments. APP plans a set of alternative paths offline such that, for any configuration of the movable obstacles, at least one of the paths from this set is collision-free. During online execution, a collision-free path can be looked up efficiently within a few microseconds. We evaluate APP on a 7 DoF robot arm in semi-structured domains of varying complexity and demonstrate that APP is several orders of magnitude faster than state-of-the-art motion planners for each domain. We further validate this approach with real-time experiments on a robotic manipulator.

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

[2]  George Havas,et al.  Perfect Hashing , 1997, Theor. Comput. Sci..

[3]  S. LaValle Rapidly-exploring random trees : a new tool for path planning , 1998 .

[4]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[5]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[6]  Seth Hutchinson,et al.  A Framework for Real-time Path Planning in Changing Environments , 2002, Int. J. Robotics Res..

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

[8]  Maxim Likhachev,et al.  E-Graphs: Bootstrapping Planning with Experience Graphs , 2012, SOCS.

[9]  Dmitry Berenson,et al.  A robot path planning framework that learns from experience , 2012, 2012 IEEE International Conference on Robotics and Automation.

[10]  Lydia E. Kavraki,et al.  The Open Motion Planning Library , 2012, IEEE Robotics & Automation Magazine.

[11]  Kei Okada,et al.  Experience-based planning with sparse roadmap spanners , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[12]  Siddhartha S. Srinivasa,et al.  The YCB object and Model set: Towards common benchmarks for manipulation research , 2015, 2015 International Conference on Advanced Robotics (ICAR).

[13]  Dieter Fox,et al.  PoseCNN: A Convolutional Neural Network for 6D Object Pose Estimation in Cluttered Scenes , 2017, Robotics: Science and Systems.

[14]  Alin Albu-Schäffer,et al.  The Repetition Roadmap for Repetitive Constrained Motion Planning , 2018, IEEE Robotics and Automation Letters.

[15]  Dieter Fox,et al.  GPU-Accelerated Robotic Simulation for Distributed Reinforcement Learning , 2018, CoRL.

[16]  Yiming Yang,et al.  HDRM: A Resolution Complete Dynamic Roadmap for Real-Time Motion Planning in Complex Scenes , 2018, IEEE Robotics and Automation Letters.

[17]  Dieter Fox,et al.  A Billion Ways to Grasp: An Evaluation of Grasp Sampling Schemes on a Dense, Physics-based Grasp Data Set , 2019, ISRR.

[18]  Maxim Likhachev,et al.  Provable Infinite-Horizon Real-Time Planning for Repetitive Tasks , 2019, ArXiv.

[19]  Maxim Likhachev,et al.  Provably Constant-Time Planning and Re-planning for Real-time Grasping Objects off a Conveyor , 2020, RSS 2020.

[20]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Informed asymptotically optimal anytime search , 2017, Int. J. Robotics Res..