Parameter Matching Analysis of Hydraulic Hybrid Excavators Based on Dynamic Programming Algorithm
نویسندگان
چکیده
منابع مشابه
Introduction of Product Introduction of PC200-8 Hybrid Hydraulic Excavators
A goal has been set to make a contribution to society in challenging global warming, especially to reduce the emissions of CO2, by developing a hybrid system that drives the swing device of a hydraulic excavator by electric drive, to significantly reduce fuel consumption. Reductions in emissions of greenhouse gases are not making satisfactory progress and regulation of the construction industry...
متن کاملBlock - Matching Algorithm Based on Dynamic Search
Dynamic search window adjustment for block-matching algorithm(BMA) based on the block similarity to overcome the computational complexity of full search BMA is presented. The proposed method for adjustment of the size of search window is performed with three steps:(1)Set new search origin based on block similarity and displaced block diierence(DBD), as a displacement of the block which has smal...
متن کاملParameter Estimation of Loranz Chaotic Dynamic System Using Bees Algorithm
An important problem in nonlinear science is the unknown parameters estimation in Loranz chaotic system. Clearly, the parameter estimation for chaotic systems is a multidimensional continuous optimization problem, where the optimization goal is to minimize mean squared errors (MSEs) between real and estimated responses for a number of given samples. The Bees algorithm (BA) is a new member of me...
متن کاملSimulation Techniques for Improving the Fuel Efficiency of Hydraulic Excavators
Simulation techniques to reduce the fuel consumption in hydraulic excavators are presented in three categories: first, a strongly non-linear dynamic simulation technique for a coupling system with a non-linear hydraulic system and a linkage system; second, a technique for evaluating fuel consumption in the engine when the engine powers the hydraulic pump in a digging operation performed by a hy...
متن کاملA versatile matching algorithm based on dynamic programming with circular order preserving
This paper presents an assignment algorithm with circular order preserving constraint. Given a cost affinity matrix and the desired percentage of correspondences, the algorithm implemented using dynamic programming determines the correspondence of type one-to-one of minimum global cost. Here, it was applied to optimize the global matching between two sets of ordered points that represent the co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2013
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2013/615608