Autonomous miniature blimp navigation with online motion planning and re-planning

In recent years, there has been an increasing interest in autonomous navigation for lightweight flying robots in indoor environments. Miniature airships, which are an instance of such robots, are especially challenging since they behave nonlinearly, typically are under-actuated, and also are subject to drift. These aspects, paired with their high-dimensional state space, demand efficient planning and control techniques. In this paper, we present a highly effective approach to autonomous navigation of miniature blimps in mapped environments which applies a multi-stage algorithm to accomplish strongly goal-directed tree-based kinodynamic planning. It performs path-guided sampling and optimally selects actions leading the robot towards sampled subgoals. Based on this, our approach can quickly provide a partial trajectory, which is extended and refined in the consecutive planning steps. The navigation system has been implemented and is able to reliably operate a robotic blimp in a real-world setting. Further experiments demonstrate that our approach outperforms a standard tree planner.

[1]  Wolfram Burgard,et al.  Towards an Experimental Autonomous Blimp Platform , 2007, EMCR.

[2]  Lydia E. Kavraki,et al.  On the implementation of single-query sampling-based motion planners , 2010, 2010 IEEE International Conference on Robotics and Automation.

[3]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .

[4]  Hiroaki Fukushima,et al.  Model predictive control of an autonomous blimp with input and output constraints , 2006, 2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control.

[5]  Lydia E. Kavraki,et al.  Impact of workspace decompositions on discrete search leading continuous exploration (DSLX) motion planning , 2008, 2008 IEEE International Conference on Robotics and Automation.

[6]  David K. Smith,et al.  Dynamic Programming and Optimal Control. Volume 1 , 1996 .

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

[8]  Simon Lacroix,et al.  The Autonomous Blimp Project of LAAS-CNRS: Achievements in Flight Control and Terrain Mapping , 2004, Int. J. Robotics Res..

[9]  Lydia E. Kavraki,et al.  Motion Planning in the Presence of Drift, Underactuation and Discrete System Changes , 2005, Robotics: Science and Systems.

[10]  Johannes Garimort,et al.  Humanoid navigation with dynamic footstep plans , 2011, 2011 IEEE International Conference on Robotics and Automation.

[11]  Oliver Brock,et al.  Balancing exploration and exploitation in motion planning , 2008, 2008 IEEE International Conference on Robotics and Automation.

[12]  Jon Louis Bentley,et al.  An Algorithm for Finding Best Matches in Logarithmic Expected Time , 1977, TOMS.

[13]  Wolfram Burgard,et al.  An integrated approach to goal-directed obstacle avoidance under dynamic constraints for dynamic environments , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Joel E. Chestnutt,et al.  A tiered planning strategy for biped navigation , 2004, 4th IEEE/RAS International Conference on Humanoid Robots, 2004..

[15]  Simon Parsons,et al.  Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.

[16]  Hans Joachim Ferreau,et al.  An online active set strategy to overcome the limitations of explicit MPC , 2008 .

[17]  Dario Floreano,et al.  Flying over the reality gap: From simulated to real indoor airships , 2006, Auton. Robots.

[18]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

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

[20]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[21]  Lydia E. Kavraki,et al.  Fast Tree-Based Exploration of State Space for Robots with Dynamics , 2004, WAFR.

[22]  Fazel Naghdy,et al.  Q-Learning for Navigation Control of an Autonomous Blimp , 2009 .

[23]  James P. Ostrowski,et al.  Motion planning a aerial robot using rapidly-exploring random trees with dynamic constraints , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[24]  Lydia E. Kavraki,et al.  Sampling-based robot motion planning: Towards realistic applications , 2007, Comput. Sci. Rev..

[25]  Kostas E. Bekris,et al.  Greedy but Safe Replanning under Kinodynamic Constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[26]  Lydia E. Kavraki,et al.  Discrete Search Leading Continuous Exploration for Kinodynamic Motion Planning , 2007, Robotics: Science and Systems.

[27]  Dieter Fox,et al.  Gaussian Processes and Reinforcement Learning for Identification and Control of an Autonomous Blimp , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[28]  Wolfram Burgard,et al.  OctoMap : A Probabilistic , Flexible , and Compact 3 D Map Representation for Robotic Systems , 2010 .