Maximum entropy searching

This study presents a new perspective for autonomous mobile robots path searching by proposing a biasing direction towards causal entropy maximisation during random tree generation. Maximum entropy-biased rapidly-exploring random tree (ME-RRT) is proposed where the searching direction is computed from random path sampling and path integral approximation, and the direction is incorporated into the existing rapidly-exploring random tree (RRT) planner. Properties of ME-RRT including degenerating conditions and additional time complexity are also discussed. The performance of the proposed approach is studied, and the results are compared with conventional RRT/RRT* and goal-biased approach in 2D/3D scenarios. Simulations show that trees are generated efficiently with fewer iteration numbers, and the success rate within limited iterations has been greatly improved in complex environments.

[1]  Xuemin Shen,et al.  Real-Time Path Planning Based on Hybrid-VANET-Enhanced Transportation System , 2015, IEEE Transactions on Vehicular Technology.

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

[3]  Abdullah Al Mamun,et al.  Hierarchical Incremental Path Planning and Situation-Dependent Optimized Dynamic Motion Planning Considering Accelerations , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[4]  Didier Devaurs,et al.  Optimal Path Planning in Complex Cost Spaces With Sampling-Based Algorithms , 2016, IEEE Transactions on Automation Science and Engineering.

[5]  Amir Khajepour,et al.  Direction-dependent optimal path planning for autonomous vehicles , 2015, Robotics Auton. Syst..

[6]  Shuzhi Sam Ge,et al.  Role Playing Learning for Socially Concomitant Mobile Robot Navigation , 2017, CAAI Trans. Intell. Technol..

[7]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

[8]  Dan Halperin,et al.  Asymptotically near-optimal RRT for fast, high-quality, motion planning , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

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

[10]  Marin Kobilarov,et al.  Cross-entropy motion planning , 2012, Int. J. Robotics Res..

[11]  Woojin Chung,et al.  Kinodynamic Planner Dual-Tree RRT (DT-RRT) for Two-Wheeled Mobile Robots Using the Rapidly Exploring Random Tree , 2015, IEEE Transactions on Industrial Electronics.

[12]  David Hsu,et al.  Narrow passage sampling for probabilistic roadmap planning , 2005, IEEE Transactions on Robotics.

[13]  A D Wissner-Gross,et al.  Causal entropic forces. , 2013, Physical review letters.

[14]  Peter Stone,et al.  Intrinsically motivated model learning for developing curious robots , 2017, Artif. Intell..

[15]  Ron Alterovitz,et al.  Asymptotically Optimal Motion Planning for Learned Tasks Using Time-Dependent Cost Maps , 2015, IEEE Transactions on Automation Science and Engineering.

[16]  I. Parberry,et al.  Optimal Path Planning for Mobile Robot Navigation , 2008, IEEE/ASME Transactions on Mechatronics.

[17]  Michaël Soulignac,et al.  Feasible and Optimal Path Planning in Strong Current Fields , 2011, IEEE Transactions on Robotics.

[18]  Qiong Wu,et al.  Curiosity , 2013, ACM Comput. Surv..

[19]  Kostas J. Kyriakopoulos,et al.  Nonholonomic navigation and control of cooperating mobile manipulators , 2003, IEEE Trans. Robotics Autom..

[20]  Kostas E. Bekris,et al.  Asymptotically Near-Optimal Planning With Probabilistic Roadmap Spanners , 2013, IEEE Transactions on Robotics.

[21]  S. LaValle,et al.  Randomized Kinodynamic Planning , 2001 .

[22]  Shuzhi Sam Ge,et al.  New potential functions for mobile robot path planning , 2000, IEEE Trans. Robotics Autom..