Resource-aware motion planning

We address the question of how resource-aware concepts can be utilized in motion planning algorithms. Resource-awareness facilitate better resource allocation on global system level, e.g. when a humanoid robot needs to distribute and schedule a wide variety of concurrent algorithms. We present a motion planning approach that employs self-monitoring concepts in order to identify the difficulty of the planning problem. Resources are requested dynamically and adapted based on problem difficulty and current planning progress. We show how dynamic adaptation of resource allocation on algorithmic level can reduce the system workload as compared to static resource allocation while meeting Quality of Service (QoS) measures such as average workload or efficiency. We evaluate our approach both in several synthetic setups with varying difficulty and with the humanoid robot ARMAR-4.

[1]  Thierry Siméon,et al.  Adaptive tuning of the sampling domain for dynamic-domain RRTs , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[2]  Thierry Siméon,et al.  Dynamic-Domain RRTs: Efficient Exploration by Controlling the Sampling Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[3]  Sam Ade Jacobs,et al.  A scalable distributed RRT for motion planning , 2013, 2013 IEEE International Conference on Robotics and Automation.

[4]  Emilio Frazzoli,et al.  Massively parallelizing the RRT and the RRT , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  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).

[6]  Sam Ade Jacobs,et al.  A scalable method for parallelizing sampling-based motion planning algorithms , 2012, 2012 IEEE International Conference on Robotics and Automation.

[7]  Tamim Asfour,et al.  Resource-Aware Harris Corner Detection Based on Adaptive Pruning , 2014, ARCS.

[8]  Didier Devaurs,et al.  Parallelizing RRT on distributed-memory architectures , 2011, 2011 IEEE International Conference on Robotics and Automation.

[9]  Jürgen Teich,et al.  Invasive Computing: An Overview , 2011, Multiprocessor System-on-Chip.

[10]  Didier Devaurs,et al.  Parallelizing RRT on Large-Scale Distributed-Memory Architectures , 2013, IEEE Transactions on Robotics.

[11]  Kostas E. Bekris,et al.  Sampling-based roadmap of trees for parallel motion planning , 2005, IEEE Transactions on Robotics.

[12]  M. Strandberg,et al.  Augmenting RRT-planners with local trees , 2004, IEEE International Conference on Robotics and Automation, 2004. Proceedings. ICRA '04. 2004.

[13]  Tamim Asfour,et al.  Resource-Aware Programming for Robotic Vision , 2014, ETS 2014.

[14]  Sam Ade Jacobs,et al.  Blind RRT: A probabilistically complete distributed RRT , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[15]  Siddhartha S. Srinivasa,et al.  Informed RRT*: Optimal sampling-based path planning focused via direct sampling of an admissible ellipsoidal heuristic , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[16]  Tamim Asfour,et al.  ARMAR-4: A 63 DOF torque controlled humanoid robot , 2013, 2013 13th IEEE-RAS International Conference on Humanoid Robots (Humanoids).

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

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

[19]  Ron Alterovitz,et al.  Scalable Multicore Motion Planning Using Lock-Free Concurrency , 2014, IEEE Transactions on Robotics.