Understanding the geometry of workspace obstacles in Motion Optimization

What is it that makes movement around obstacles hard? The answer seems clear: obstacles contort the geometry of the workspace and make it difficult to leverage what we consider easy and intuitive straight-line Cartesian geometry. But is Cartesian motion actually easy? It's certainly well-understood and has numerous applications. But beneath the details of linear algebra and pseudoinverses, lies a non-trivial Riemannian metric driving the solution. Cartesian motion is easy only because the pseudoinverse, our powerhouse tool, correctly represents how Euclidean workspace geometry pulls back into the configuration space. In light of that observation, it reasons that motion through a field of obstacles could be just as easy as long as we correctly account for how those obstacles warp the geometry of the space. This paper explores extending our geometric model of the robot beyond the notion of a Cartesian workspace space to fully model and leverage how geometry changes in the presence of obstacles. Intuitively, impenetrable obstacles form topological holes and geodesics curve around them accordingly. We formalize this intuition and develop a general motion optimization framework called Riemannian Motion Optimization (RieMO) to efficiently find motions using our geometric models. Our experiments demonstrate that, for many problems, obstacle avoidance can be much more natural when placed within the right geometric context.

[1]  J. Nash The imbedding problem for Riemannian manifolds , 1956 .

[2]  Daniel E. Koditschek,et al.  The construction of analytic diffeomorphisms for exact robot navigation on star worlds , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[3]  Oussama Khatib,et al.  Elastic bands: connecting path planning and control , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[4]  L. Noakes A Global algorithm for geodesics , 1998, Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics.

[5]  Shun-ichi Amari,et al.  Natural Gradient Works Efficiently in Learning , 1998, Neural Computation.

[6]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[7]  John M. Lee Introduction to Smooth Manifolds , 2002 .

[8]  Jeff G. Schneider,et al.  Covariant Policy Search , 2003, IJCAI.

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

[10]  William H. Press,et al.  Numerical Recipes 3rd Edition: The Art of Scientific Computing , 2007 .

[11]  G. Oriolo,et al.  Robotics: Modelling, Planning and Control , 2008 .

[12]  Paul H. Siegel,et al.  Gaussian belief propagation solver for systems of linear equations , 2008, 2008 IEEE International Symposium on Information Theory.

[13]  Siddhartha S. Srinivasa,et al.  CHOMP: Gradient optimization techniques for efficient motion planning , 2009, 2009 IEEE International Conference on Robotics and Automation.

[14]  Marc Toussaint,et al.  Robot trajectory optimization using approximate inference , 2009, ICML '09.

[15]  Stefan Schaal,et al.  STOMP: Stochastic trajectory optimization for motion planning , 2011, 2011 IEEE International Conference on Robotics and Automation.

[16]  Siddhartha S. Srinivasa,et al.  Manipulation planning with goal sets using constrained trajectory optimization , 2011, 2011 IEEE International Conference on Robotics and Automation.

[17]  Chonhyon Park,et al.  ITOMP: Incremental Trajectory Optimization for Real-Time Replanning in Dynamic Environments , 2012, ICAPS.

[18]  Ran Nathan Learning Geometric Reductions for Planning and Control , 2013 .

[19]  Pieter Abbeel,et al.  Finding Locally Optimal, Collision-Free Trajectories with Sequential Convex Optimization , 2013, Robotics: Science and Systems.

[20]  S. Hassani Mathematical physics : a modern introduction to Its foundations , 2013 .

[21]  Marc Toussaint,et al.  Newton methods for k-order Markov Constrained Motion Problems , 2014, ArXiv.

[22]  Nathan D. Ratliff Multivariate Calculus II: The geometry of smooth maps , 2015 .