Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bhattacharya, S., Kumar, V., Likhachev, M.: Search-based path planning with homotopy class constraints. In: AAAI Conf. on Artificial Intelligence (2010)
Bhattacharya, S., Likhachev, M., Kumar, V.: Identification and representation of homotopy classes of trajectories for search-based path planning in 3D. In: Robotics: Science and Systems (2011)
Demyen, D., Buro, M.: Efficient triangulation-based pathfinding. In: National Conf. on Artificial Intelligence, pp. 942–947 (2006)
Donald, B., Xavier, P., Canny, J., Reif, J.: Kinodynamic motion planning. J. ACM 40(5), 1048–1066 (1993)
Grigoriev, D., Slissenko, A.: Polytime algorithm for the shortest path in a homotopy class amidst semi-algebraic obstacles in the plane. In: Int. Symposium on Symbolic and Algebraic Computation, pp. 17–24 (1998)
Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. Theory Appl. 4, 331–342 (1991)
Lavalle, S.M., Kuffner, J.J.: Rapidly-exploring random trees: Progress and prospects. In: Donald B.R., Lynch K.M., Rus D. (eds.) Algorithmic and Computational Robotics: New Directions, pp. 293–308. A K Peters (2001)
Richards, A., How, J.P.: Aircraft trajectory planning with collision avoidance using mixed integer linear programming. In: American Control Conf., vol. 3, pp. 1936–1941 (2002)
Richards, A., How, J.P., Schouwenaars, T., Feron, E.: Plume avoidance maneuver planning using mixed integer linear programming. In: AIAA Guidance Navigation and Control Conference (2001)
Schmitzberger, E., Bouchet, J.L., Dufaut, M., Wolf, D., Husson, R.: Capture of homotopy classes with probabilistic road map. In: IEEE/RSJ Int. Conf. on Intelligent Robots and Systems, pp. 2317–2322 (2002)
Tedrake, R., Manchester, I.R., Tobenkin, M.M., Roberts, J.W.: LQR-trees: Feedback motion planning via sums of square verification. Int. J. Robot. Res. 29(8), 1038–1052 (2010)
Tovar, B., Cohen, F., LaValle, S.: Sensor beams, obstacles, and possible paths. In: Chirikjian G., Choset H., Morales M., Murphey T. (eds.) Algorithmic Foundation of Robotics VIII. Springer Tracts in Advanced Robotics, vol. 57, pp. 317–332. Springer, Berlin/Heidelberg (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer Science+Business Media Dordrecht
About this paper
Cite this paper
Kim, S., Sreenath, K., Bhattacharya, S., Kumar, V. (2012). Trajectory Planning for Systems with Homotopy Class Constraints. In: Lenarcic, J., Husty, M. (eds) Latest Advances in Robot Kinematics. Springer, Dordrecht. https://doi.org/10.1007/978-94-007-4620-6_11
Download citation
DOI: https://doi.org/10.1007/978-94-007-4620-6_11
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-007-4619-0
Online ISBN: 978-94-007-4620-6
eBook Packages: EngineeringEngineering (R0)