A Dynamic Programming Approach for Time-Optimal Path Following of Robots Considering Speed Dependent Torque Constraints

PAMM ◽  
2017 ◽  
Vol 17 (1) ◽  
pp. 157-158
Author(s):  
Matthias Oberherber ◽  
Hubert Gattringer ◽  
Andreas Müller
Keyword(s):  
Dynamic Programming ◽  
Optimal Path ◽  
Path Following ◽  
Programming Approach ◽  
Dynamic Programming Approach ◽  
Time Optimal

scholarly journals A Compromise Decision Support Multi Objective Travelling Salesman Problem

2019 ◽  
Vol 8 (4) ◽  
pp. 10259-10262
Keyword(s):  
Dynamic Programming ◽  
Decision Support ◽  
State Space ◽  
Travelling Salesman Problem ◽  
Optimal Path ◽  
Programming Approach ◽  
Travelling Salesman ◽  
Multi Objective ◽  
Dynamic Programming Approach ◽  
Shortest Route

The multi objective travelling salesman problem simultaneously optimizes several objectives. It is also called as shortest cyclic route model with multiple objectives provides the shortest route. In this article, the compromised decision support solutions are processed for a multi objective travelling salesman problem. The dynamic programming approach for optimal path with state space tree is used to get the shortest route for the objectives. Based on decision maker's preference, the compromised solution for the multi objective travelling salesman problem is obtained. The proposed methodology is very simple and easy way to get the shortest route which is illustrated with an example.

Reliability-Based Dynamic Programming for E-Learning User Profile Assessment

2012 ◽  
Vol 8 (3) ◽  
pp. 13-21
Author(s):  
Hamed Fazlollahtabar
Keyword(s):  
Dynamic Programming ◽  
Optimal Path ◽  
User Profile ◽  
Programming Approach ◽  
Assessment Procedure ◽  
Training Environment ◽  
Place And Space ◽  
Customized Training ◽  
Dynamic Programming Approach ◽  
E Learning

Electronic learning (E-learning) has been adopted as a new learning tool overcoming time and place limitations. Although the success of e-learning architectures has been investigated by researchers, little work has been conducted to assess the success and/or effectiveness of E-learning systems. The on-line training environment enables users to undertake customized training at any time and any place. Moreover, information technology allows the users to be decoupled in terms of time, place, and space. Here, the author proposes an assessment procedure applying a dynamic programming approach to model the problem of optimal path in the user profile and using reliability to measure the inter connections among users in an e-learning network. A dynamic program is used to find the optimal path for the user in the E-learning environment. The validity and effectiveness of the proposed model are illustrated by an example.

Path constrained time-optimal trajectory planning for X-Y robots via an efficient dynamic programming method

Robotica ◽  
1998 ◽  
Vol 16 (1) ◽  
pp. 89-96 ◽  
Author(s):  
Chen-Wen V. Yen ◽  
Tsong-Zen Liu
Keyword(s):  
Dynamic Programming ◽  
Computational Cost ◽  
Experimental Studies ◽  
Path Following ◽  
Minimum Time ◽  
Programming Method ◽  
Dynamic Programming Method ◽  
Programming Approach ◽  
Control Law ◽  
Time Optimal

By exploiting an important property of the time optimal control law structure, this paper introduces a new dynamic programming approach for X-Y robot minimum time path following problem. Compared with the conventional dynamic programming method, the proposed approach significantly reduces the computational cost. The efficiency and effectiveness of the proposed approach are demonstrated via computer simulations. In addition, via experimental studies, this paper also addresses practical difficulties in implementing the minimum-time control law.

Sign in / Sign up

Export Citation Format

Share Document