Abstract
This paper presents a novel approach for online motion planning of mobile robots in distinctive homotopic classes. The approach contains two parts. Firstly, a local planner called TC-SQP (timed control and sequential quadratic programming) is proposed. An optimal trajectory is deformed from an initial path from a global planner, considering collision avoidance, time optimality and kino-dynamic constraints. Our approach takes the control variables rather than position variables as optimization variables in a time horizon. Hence, TC-SQP requires fewer optimization variables (3/4 comparing to the state-of-art method) and parameters. And the transition time is reduced by 14% from the global path. Then, to overcome the issue that there exist several trajectories of local minimum cost, a candidate of global paths of different homotopic classes is maintained by using a sparse graph spanner. These global paths are optimized in parallel, and the lowest cost trajectory is selected as the final trajectory. Our method can generate enough homotopic candidates, and it needs much fewer queries comparing with a Probability Road Map. Besides the simulations, some results are also proved theoretically.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Fox, D., Burgard, W., Thrun, S.: The dynamic window approach to collision avoidance. IEEE Robot. Autom. Mag. 4(1), 23–33 (1997)
Quinlan, S.: Real-time Modification of Collision-Free Paths. Stanford University, Stanford (1995)
Kurniawati, H., Fraichard, T.: From path to trajectory deformation. In: IEEE-RSJ International Conference on Intelligent Robots and Systems, San Diego, états-Unis (2007)
Rösmann, C., et al.: Trajectory modification considering dynamic constraints of autonomous robots. In: Robotics; Proceedings of ROBOTIK 2012; 7th German Conference on VDE (2012)
Rösmann, C., Hoffmann, F., Bertram, T.: Kinodynamic trajectory optimization and control for car-like robots. In: IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Vancouver, BC, Canada (2017)
Gu, T., Atwood, J., Dong, C., Dolan, J.M., Lee, J.-W.: Tunable and stable real-time trajectory planning for urban autonomous driving. In: IEEE International Conference on Intelligent Robots and Systems, pp. 250–256 (2015)
Lau, B., Sprunk, C., Burgard, W.: Kinodynamic motion planning for mobile robotsusing splines. In: Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), St. Louis, MO, USA, pp. 2427–2433 (2009)
Sprunk, C., Lau, B., Pfaff, P., Burgard, W.: Online generation of kinodynamic trajectories for non-circular omnidirectional robots. In: Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Shanghai, China, pp. 72–77 (2011)
Kuderer, M., Sprunk, C., Kretzschmar, H., Burgard, W.: Online generation of homotopically distinct navigation paths. In: IEEE International Conference on Robotics and Automation, Hong Kong, China, pp. 6462–6467 (2014)
Rösmann, C., Hoffmann, F., Bertram, T.: Integrated online trajectory planning and optimization in distinctive topologies. Robot. Auton. Syst. 88, 142–153 (2016)
Schmitzberger, E., Bouchet, J., Dufaut, M., Wolf, D., Husson, R.: Capture of homotopy classes with probabilistic road map. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, vol. 3, pp. 2317–2322 (2002)
Jaillet, L., Simeon, T.: Path deformation roadmaps: compact graphs with useful cycles for motion planning. Int. J. Robot. Res. 27(11–12), 1175–1188 (2008)
LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)
Bhattacharya, S., Kumar, V., Likhachev, M.: Search-based path planning with homotopy class constraints. In: Proceedings of National Conference on Artificial Intelligence (2010)
Pokorny, F.T., Hawasly, M., Ramamoorthy, S.: Multiscale topological trajectory classification with persistent homology. In: Proceedings of Robotics: Science and Systems, Berkeley, USA (2014)
Marble, J.D., Bekris, K.E.: Asymptotically near-optimal is good enough for motion planning. In: Christensen, H., Khatib, O. (eds.) Robotics Research. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-29363-9_24
Zucker, M., et al.: CHOMP: covariant Hamiltonian optimization for motion planning. Int. J. Robot. Res. 32(9-10), 1164–1193 (2013)
Dobson, A., Krontiris, A., Bekris, K.E.: Sparse roadmap spanners. In: Frazzoli, E., Lozano-Perez, T., Roy, N., Rus, D. (eds.) Algorithmic Foundations of Robotics X, vol. 86. Springer, Heidelberg (2013). https://doi.org/10.1007/978-3-642-36279-8_17
Lu, D.V., Hershberger, D.: Smart, W.D.: Layered costmaps for context-sensitive navigation. In: IEEE/RSJ International Conference on Intelligent Robots & Systems (2014)
Park, J.-S., et al.: A new concave hull algorithm and concaveness measure for n-dimensional datasets. J. Inf. Sci. Eng. 28, 587–600 (2012)
Rösmann, C., Hoffmann, F., Bertram, T.: Planning of multiple robot trajectories in distinctive topologies. In: IEEE 2015 European Conference on Mobile Robots (ECMR) - Lincoln, United Kingdom, 2–4 September 2015, pp. 1–6. European Conference on Mobile Robots IEEE (2015)
Acknowledgement
This work was funded by the National Key Research and Development Plan of China (2017YFE0112200) and National Science and Technology Major Project of China (2017ZX04005001-004).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Zhang, X., Zhang, B., Qi, C., Li, Z., Li, H. (2019). An Online Motion Planning Approach of Mobile Robots in Distinctive Homotopic Classes by a Sparse Roadmap. In: Yu, H., Liu, J., Liu, L., Ju, Z., Liu, Y., Zhou, D. (eds) Intelligent Robotics and Applications. ICIRA 2019. Lecture Notes in Computer Science(), vol 11743. Springer, Cham. https://doi.org/10.1007/978-3-030-27538-9_62
Download citation
DOI: https://doi.org/10.1007/978-3-030-27538-9_62
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27537-2
Online ISBN: 978-3-030-27538-9
eBook Packages: Computer ScienceComputer Science (R0)