Optimization techniques for robot path planning

Citations of this article
Mendeley users who have this article in their library.
Get full text


We present a method for robot path planning in the robot’s configuration space, in the presence of fixed obstacles. Our method employs both combinatorial and gradient-based optimization techniques, but most distinguishably, it employs a Multi-sphere Scheme purposefully developed for two and three-dimensional packing problems. This is a singular feature which not only enables us to use a particularly high-grade implementation of a packing-problem solver, but can also be utilized as a model to reduce computational effort with other path-planning or obstacle avoidance methods.




Shurbevski, A., Hirosue, N., Hirosue, N., & Nagamochi, H. (2014). Optimization techniques for robot path planning. In Advances in Intelligent Systems and Computing (Vol. 231, pp. 111–120). Springer Verlag. https://doi.org/10.1007/978-3-319-01466-1_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free