Intelligent algorithms for H-optimal placement of actuators and sensors in structural control

Sergey Chemishkian, Ara - Arabyan

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)

Abstract

Four algorithms are described to search and find spatial configuration for the placement of a finite number of actuators and sensors on a continuous flexible structure to reduce deformations in the structures to a minimum in H sense. The computational cost of the optimal mapping search is reduced through four techniques. First, the computationally expensive goal function based on the complete H design is replaced by a two-step hybrid function, which performs a computationally inexpensive pass-fail test and proceeds to the complete H design only if the test was passed. Second a target H norm used in the mentioned pass-fail test is adjusted based on the already evaluated mappings in order to increase the number of failed tests and reduce the number of complete H designs. Third, the exhaustive search as the basic search technique is replaced by a more intelligent genetic algorithm. Finally, the search is implemented on a parallel computer. The algorithms are benchmarked for two test cases: a model of a simply supported beam, and a model of the UCLA Large Space Structure.

Original languageEnglish (US)
Title of host publicationProceedings of the American Control Conference
PublisherIEEE
Pages1812-1816
Number of pages5
Volume3
StatePublished - 1999
Externally publishedYes
EventProceedings of the 1999 American Control Conference (99ACC) - San Diego, CA, USA
Duration: Jun 2 1999Jun 4 1999

Other

OtherProceedings of the 1999 American Control Conference (99ACC)
CitySan Diego, CA, USA
Period6/2/996/4/99

Fingerprint

Actuators
Sensors
Flexible structures
Genetic algorithms
Costs

ASJC Scopus subject areas

  • Control and Systems Engineering

Cite this

Chemishkian, S., & Arabyan, A. . (1999). Intelligent algorithms for H-optimal placement of actuators and sensors in structural control. In Proceedings of the American Control Conference (Vol. 3, pp. 1812-1816). IEEE.

Intelligent algorithms for H-optimal placement of actuators and sensors in structural control. / Chemishkian, Sergey; Arabyan, Ara -.

Proceedings of the American Control Conference. Vol. 3 IEEE, 1999. p. 1812-1816.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Chemishkian, S & Arabyan, A 1999, Intelligent algorithms for H-optimal placement of actuators and sensors in structural control. in Proceedings of the American Control Conference. vol. 3, IEEE, pp. 1812-1816, Proceedings of the 1999 American Control Conference (99ACC), San Diego, CA, USA, 6/2/99.
Chemishkian S, Arabyan A. Intelligent algorithms for H-optimal placement of actuators and sensors in structural control. In Proceedings of the American Control Conference. Vol. 3. IEEE. 1999. p. 1812-1816
Chemishkian, Sergey ; Arabyan, Ara -. / Intelligent algorithms for H-optimal placement of actuators and sensors in structural control. Proceedings of the American Control Conference. Vol. 3 IEEE, 1999. pp. 1812-1816
@inproceedings{48bada0f05eb49d3b08786cc09ee708b,
title = "Intelligent algorithms for H∞-optimal placement of actuators and sensors in structural control",
abstract = "Four algorithms are described to search and find spatial configuration for the placement of a finite number of actuators and sensors on a continuous flexible structure to reduce deformations in the structures to a minimum in H∞ sense. The computational cost of the optimal mapping search is reduced through four techniques. First, the computationally expensive goal function based on the complete H∞ design is replaced by a two-step hybrid function, which performs a computationally inexpensive pass-fail test and proceeds to the complete H∞ design only if the test was passed. Second a target H∞ norm used in the mentioned pass-fail test is adjusted based on the already evaluated mappings in order to increase the number of failed tests and reduce the number of complete H∞ designs. Third, the exhaustive search as the basic search technique is replaced by a more intelligent genetic algorithm. Finally, the search is implemented on a parallel computer. The algorithms are benchmarked for two test cases: a model of a simply supported beam, and a model of the UCLA Large Space Structure.",
author = "Sergey Chemishkian and Arabyan, {Ara -}",
year = "1999",
language = "English (US)",
volume = "3",
pages = "1812--1816",
booktitle = "Proceedings of the American Control Conference",
publisher = "IEEE",

}

TY - GEN

T1 - Intelligent algorithms for H∞-optimal placement of actuators and sensors in structural control

AU - Chemishkian, Sergey

AU - Arabyan, Ara -

PY - 1999

Y1 - 1999

N2 - Four algorithms are described to search and find spatial configuration for the placement of a finite number of actuators and sensors on a continuous flexible structure to reduce deformations in the structures to a minimum in H∞ sense. The computational cost of the optimal mapping search is reduced through four techniques. First, the computationally expensive goal function based on the complete H∞ design is replaced by a two-step hybrid function, which performs a computationally inexpensive pass-fail test and proceeds to the complete H∞ design only if the test was passed. Second a target H∞ norm used in the mentioned pass-fail test is adjusted based on the already evaluated mappings in order to increase the number of failed tests and reduce the number of complete H∞ designs. Third, the exhaustive search as the basic search technique is replaced by a more intelligent genetic algorithm. Finally, the search is implemented on a parallel computer. The algorithms are benchmarked for two test cases: a model of a simply supported beam, and a model of the UCLA Large Space Structure.

AB - Four algorithms are described to search and find spatial configuration for the placement of a finite number of actuators and sensors on a continuous flexible structure to reduce deformations in the structures to a minimum in H∞ sense. The computational cost of the optimal mapping search is reduced through four techniques. First, the computationally expensive goal function based on the complete H∞ design is replaced by a two-step hybrid function, which performs a computationally inexpensive pass-fail test and proceeds to the complete H∞ design only if the test was passed. Second a target H∞ norm used in the mentioned pass-fail test is adjusted based on the already evaluated mappings in order to increase the number of failed tests and reduce the number of complete H∞ designs. Third, the exhaustive search as the basic search technique is replaced by a more intelligent genetic algorithm. Finally, the search is implemented on a parallel computer. The algorithms are benchmarked for two test cases: a model of a simply supported beam, and a model of the UCLA Large Space Structure.

UR - http://www.scopus.com/inward/record.url?scp=0033283479&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033283479&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3

SP - 1812

EP - 1816

BT - Proceedings of the American Control Conference

PB - IEEE

ER -