When the total weighted completion time criterion is concerned, a useful property is proved and then a dynamic programming algorithm is developed to solve this problem optimally. 當目標函數是最小化加權完成時(shí)間之和時(shí),首先證明了最優(yōu)調度的一個(gè)性質(zhì),并據此提出了動(dòng)態(tài)規劃算法。
This paper presents the motion planning algorithm of a differential drive mobile manipulator. 提出了差動(dòng)驅動(dòng)式移動(dòng)機械手的運動(dòng)規劃算法。