Time Optimal Path Planning on Placing Ball Robot

摘要

This article contributes to solve time optimal path planning of robot applied remote real-time snooker match. According to characteristics of this problem, difficulties and key points, a new method is proposed in this paper for near minimum-time path planning of this problem which converts actual model 1 based on the problem into abstract model 2. And then Matlab program is written to calculate solution which is time optimal path of above robot. The simulation results are presented which indicate feasibility of this approach to make robot perform task of placing balls in limited time.