Trajectory Planning for Systems with Homotopy Class Constraints

There are various applications where homotopy constraints are useful in trajectory generation for mobile robots. In this paper, we present a method to generate an optimal trajectory restricted to a particular homotopy class, which is specified by a given representative trajectory. The optimality is achieved by formulating the trajectory generation problem as a Mixed-Integer Quadratic Program (MIQP). We partition the configuration space into nonoverlapping cells and model each cell in the partition with integer variables and inequality constraints. We associate with any sequence of integer variables a word, so that each trajectory can be mapped to a word. We then construct a set of all words that are homotopically equivalent to a given word. For each word, we fix the integer variables of the MIQP to find the optimal time distribution in each cell, by solving a QP for each iteration, to obtain the locally optimal trajectory in the specified homotopy class. We illustrate an example of minimum acceleration trajectory generation on a plane with different homotopy class constraints.

[1]  Gregory S. Chirikjian,et al.  Algorithmic Foundation of Robotics VIII, Selected Contributions of the Eight International Workshop on the Algorithmic Foundations of Robotics, WAFR 2008, Guanajuato, Mexico, December 7-9, 2008 , 2009, WAFR.

[2]  Ian R. Manchester,et al.  LQR-trees: Feedback Motion Planning via Sums-of-Squares Verification , 2010, Int. J. Robotics Res..

[3]  Wolfram Burgard,et al.  Robotics: Science and Systems XV , 2010 .

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

[5]  Subhrajit Bhattacharya,et al.  Search-Based Path Planning with Homotopy Class Constraints in 3D , 2010, AAAI.

[6]  Jonathan P. How,et al.  Plume Avoidance Maneuver Planning Using Mixed Integer Linear Programming , 2001 .

[7]  P. Schönemann.  On artificial intelligence , 1985, Behavioral and Brain Sciences.

[8]  Libor Preucil,et al.  European Robotics Symposium 2008 , 2008 .

[9]  Vijay Kumar,et al.  Identification and Representation of Homotopy Classes of Trajectories for Search-based Path Planning in 3D , 2011, Robotics: Science and Systems.

[10]  Michael Buro,et al.  Efficient Triangulation-Based Pathfinding , 2006, AAAI.

[11]  Ahmad A. Masoud,et al.  Kinodynamic Motion Planning , 2010, IEEE Robotics & Automation Magazine.

[12]  Fred Cohen,et al.  Sensor Beams, Obstacles, and Possible Paths , 2008, WAFR.

[13]  Didier Wolf,et al.  Capture of homotopy classes with probabilistic road map , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

[14]  Dima Grigoriev,et al.  Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane , 1998, ISSAC '98.

[15]  Bruce Randall Donald,et al.  Algorithmic and Computational Robotics: New Directions , 2001 .

[16]  John Hershberger,et al.  Computing Minimum Length Paths of a Given Homotopy Class (Extended Abstract) , 1991, WADS.

[17]  Bernd Krauskopf,et al.  Sensitivity of the Generic Transport Model upset dynamics to time delay , 2014 .

[18]  Jonathan P. How,et al.  Aircraft trajectory planning with collision avoidance using mixed integer linear programming , 2002, Proceedings of the 2002 American Control Conference (IEEE Cat. No.CH37301).