Fast robot motion planning with collision avoidance and temporal optimization
Conference Paper, Proceedings of 15th International Conference on Control, Automation, Robotics and Vision (ICARCV '18), pp. 29 - 35, November, 2018
Abstract
Considering the growing demand of real-time motion planning in robot applications, this paper proposes a fast robot motion planner (FRMP) to plan collision-free and time-optimal trajectories, which applies the convex feasible set algorithm (CFS) to solve both the trajectory planning problem and the temporal optimization problem. The performance of CFS in trajectory planning is compared to the sequential quadratic programming (SQP) in simulation, which shows a significant decrease in iteration numbers and computation time to converge a solution. The effectiveness of temporal optimization is shown on the operational time reduction in the experiment on FANUC LR Mate 200iD/7L.
BibTeX
@conference{Lin-2018-113168,author = {Hsien-Chung Lin, Changliu Liu, Masayoshi Tomizuka},
title = {Fast robot motion planning with collision avoidance and temporal optimization},
booktitle = {Proceedings of 15th International Conference on Control, Automation, Robotics and Vision (ICARCV '18)},
year = {2018},
month = {November},
pages = {29 - 35},
}
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.