查詢結果分析
來源資料
相關文獻
- A Nonlinear Programming Method for Time-optimal Control of an Omni-directional Mobile Robot
- Minimum-Torque Trajectory Planning of Redundant Manipulators between Two Joint Configurations
- Neural Network Error Accommodation with Fuzzy Logic Elements in Robot Time Optimal Path Tracking
- 遺傳演算法在最小成本機械加工係數選擇問題之應用
- 臺灣引水費結構合理化之研究
- On the Improvement of Convergence Characteristics of PCPDIPA
- 狀態誤差回授法於兩混沌系統同步化之應用
- 非線性規劃(多變數無限制式)解法之探討
- 懸浮微粒改善策略評選--非線性規劃方法之發展及臺中案例研究
- Direct Collocation and Nonlinear Programming Applied on Logistics Planning
頁籤選單縮合
題 名 | A Nonlinear Programming Method for Time-optimal Control of an Omni-directional Mobile Robot=可全方位運動機器人之非線性規劃最佳時間控制法 |
---|---|
作 者 | 王世民; 吳佳儒; 魏嘉延; | 書刊名 | 修平學報 |
卷 期 | 23 2011.09[民100.09] |
頁 次 | 頁83-102 |
分類號 | 448.94 |
關鍵詞 | 時間最佳化控制; 非線性規劃; 全方位機器人; Time-optimal control; Nonlinear programming; Omni-directional robots; |
語 文 | 英文(English) |
中文摘要 | 本論文為探討一部三輪可全方位運動機器人的時間昀佳化控制問題,這裏所提出的方法為 Pontryagin的昀小原則 (PMP)。所使用的迭代法為非線性規劃 (NLP) 方法的時間昀佳化題型, NLP問題的初始值在控制過程中為常數,而取樣週期在做昀佳化過程中為變數,昀佳化的目的是希望取樣週期要比設定的昀小值更低,如此一來才可確保它的準確度。本論文所制定的 NLP問題初始可行解可由遺傳演算法(GAs) 來求得,因為初始可行解可求得,所以時間昀佳化問題便可進行計算而得到昀佳解。在這種模式下,可全方位運動機器人在空間移動時就可以找到昀佳的時間運動方式。本論文所提出的方法可經由模擬結果來作說明得到驗證。 |
英文摘要 | The time-optimal control problem of a three-wheeled omni-directional mobile robot is addressed in this paper. Different from usual cases, in which the Pontryagin’s Minimum Principle (PMP) is used, an iterative procedure is proposed to transform the time-optimal problem into a nonlinear programming (NLP) one. In the NLP problem, the count of control steps is fixed initially and the sampling period is treated as a variable in the optimization process. The optimization object is to minimize the sampling period such that it is below a specific minimum value, which is set in advance considering the accuracy of discretization. To generate initial feasible solutions of the formulated NLP problem, genetic algorithms (GAs) are adopted. Since different initial feasible solutions can be generated, the optimization process can be started from different points to find the optimal solution. In this manner, one can find a time-optimal movement of the omni-directional mobile robot between two configurations. To show the feasibility of the proposed method, simulation results are included for illustration. |
本系統中英文摘要資訊取自各篇刊載內容。