Speeding up single-query sampling-based algorithms using case-based reasoning

Abstract We present an extension to the single-query sampling-based algorithm for improving its response time using Case-Based Reasoning (CBR) technique. Unlike traditional experience-based planners, CBR depends on a single thread execution which reduces the required computation power. Additionally, it is always biased towards exploration rather than exploitation to overcome experience-based algorithms drawbacks. Results indicate that CBR extension has significantly improved sampling-based response time for similar served queries.

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

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

[3]  Kostas E. Bekris,et al.  Improving sparse roadmap spanners , 2013, 2013 IEEE International Conference on Robotics and Automation.

[4]  Agnar Aamodt,et al.  Case-Based Reasoning: Foundational Issues, Methodological Variations, and System Approaches , 1994, AI Commun..

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

[6]  John H. Reif,et al.  Complexity of the mover's problem and generalizations , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

[7]  Emilio Frazzoli,et al.  RRTX: Asymptotically optimal single-query sampling-based motion planning with quick replanning , 2016, Int. J. Robotics Res..

[8]  Ashok K. Goel,et al.  What's Hot in Case-Based Reasoning , 2017, AAAI.

[9]  Panagiotis Tsiotras,et al.  Use of relaxation methods in sampling-based algorithms for optimal motion planning , 2013, 2013 IEEE International Conference on Robotics and Automation.

[10]  S. Chiba,et al.  Dynamic programming algorithm optimization for spoken word recognition , 1978 .

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

[12]  J. Betts.  Survey of Numerical Methods for Trajectory Optimization , 1998 .

[13]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[14]  E. Polak.  An historical survey of computational methods in optimal control. , 1973 .

[15]  Reinaldo A. C. Bianchi,et al.  Qualitative Case-Based Reasoning for Humanoid Robot Soccer: A New Retrieval and Reuse Algorithm , 2016, ICCBR.

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

[17]  Janet L. Kolodner,et al.  Case-Based Reasoning , 1989, IJCAI 1989.

[18]  Jonathan P. How,et al.  Motion planning with diffusion maps , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

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

[20]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[21]  Robert F. Sproull,et al.  Refinements to nearest-neighbor searching ink-dimensional trees , 1991, Algorithmica.

[22]  Sunil Arya,et al.  An optimal algorithm for approximate nearest neighbor searching fixed dimensions , 1998, JACM.