By Topic

Genetic algorithms solution for unconstrained optimal crane control

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
B. Kimiaghalam ; Dept. of Electr. Eng., North Carolina A&T State Univ., Greensboro, NC, USA ; A. Homaifar ; M. Bikdash ; G. Dozier

Crane control is a difficult problem for conventional control methods because of the highly nonlinear equations that must be satisfied. Usually the necessary conditions for solving an optimal control problem require finding the initial co-state vector. In this paper real-coded genetic algorithms are used to find the desired initial value of the costates of the system with no constraints. In our genetic representation, each chromosome represents a set of co-states and each gene (co-state) has an associated cost based on its ability to move the system to desired state after a given amount of time. The objective is to evolve a minimum cost co-state. Our results for this unconstrained crane problem are quite encouraging

Published in:

Evolutionary Computation, 1999. CEC 99. Proceedings of the 1999 Congress on  (Volume:3 )

Date of Conference:

1999