Stereo correspondence based on line matching in Hough space using dynamic programming

1994 ◽  
Vol 24 (1) ◽  
pp. 144-152 ◽  
Author(s):  
Ze-Nian Li
1989 ◽  
Vol 21 (8-9) ◽  
pp. 1057-1064 ◽  
Author(s):  
Vijay Joshi ◽  
Prasad Modak

Waste load allocation for rivers has been a topic of growing interest. Dynamic programming based algorithms are particularly attractive in this context and are widely reported in the literature. Codes developed for dynamic programming are however complex, require substantial computer resources and importantly do not allow interactions of the user. Further, there is always resistance to utilizing mathematical programming based algorithms for practical applications. There has been therefore always a gap between theory and practice in systems analysis in water quality management. This paper presents various heuristic algorithms to bridge this gap with supporting comparisons with dynamic programming based algorithms. These heuristics make a good use of the insight gained in the system's behaviour through experience, a process akin to the one adopted by field personnel and therefore can readily be understood by a user familiar with the system. Also they allow user preferences in decision making via on-line interaction. Experience has shown that these heuristics are indeed well founded and compare very favourably with the sophisticated dynamic programming algorithms. Two examples have been included which demonstrate such a success of the heuristic algorithms.


2009 ◽  
Vol 42 (12) ◽  
pp. 3215-3223 ◽  
Author(s):  
Guihuan Feng ◽  
Christian Viard-Gaudin ◽  
Zhengxing Sun

2000 ◽  
Vol 26 (5) ◽  
pp. 693-697
Author(s):  
JUN MORIMOTO ◽  
YOSHIYUKI YAMASHITA ◽  
MUTSUMI SUZUKI

1987 ◽  
Vol 109 (2) ◽  
pp. 88-96 ◽  
Author(s):  
S. Singh ◽  
M. C. Leu

The problem of optimal control of robotic manipulators is dealt with in two stages: (1) optimal trajectory planning, which is performed off-line and results in the prescription of the position and velocity of each link as a function of time along a “given” path and (2) on-line trajectory tracking, during which the manipulator is guided along the planned trajectory using a feedback control algorithm. In order to obtain a general trajectory planning algorithm which could account for various constraints and performance indices, the technique of dynamic programming is adopted. It is shown that for a given path, this problem is reduced to a search over the velocity of one moving manipulator link. The design of the algorithm for optimal trajectory planning and the relevant computational issues are discussed. Simulations are performed to test the effectiveness of this method. The use of this algorithm in conjunction with an on-line controller is also presented.


Sign in / Sign up

Export Citation Format

Share Document