Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorAzad, S. Kazemzadehen
dc.contributor.authorKulkarni, Anand J.en
dc.contributor.authorKale, I. R.en
dc.contributor.authorTai, K.en
dc.identifier.citationKulkarni, A. J., Kale, I. R., Tai, K.,& Azad, S. K. (2012). Discrete optimization of truss structure using Probability Collectives. 2012 12th International Conference on Hybrid Intelligent Systems (HIS), 225 - 230.en
dc.description.abstractTraditionally, complex systems were treated using centralized approaches; however, recent trends highlighted that the growing complexity can be best dealt by decomposing the entire system into subsystems and further treat them in a distributed way. The approach of Probability Collectives (PC) in Collective Intelligence (COIN) framework decomposes the entire system into a Multi-Agent System (MAS) or a collection of rational and self interested agents and further optimizes them in a distributed and decentralized way to reach the desired system objective. The complexity of the system increases when constraints are involved. The approach of PC is incorporated with a feasibility-based rule to handle the solution based on number of constraints violated, and further drives the convergence towards feasibility. Importantly for the first time, constrained PC approach has been tested solving a discrete problem such as 45-bar truss structure. The results are validated by comparing with the contemporary algorithms as well.en
dc.titleDiscrete optimization of truss structure using probability collectivesen
dc.typeConference Paperen
dc.contributor.schoolSchool of Mechanical and Aerospace Engineeringen
dc.contributor.conferenceInternational Conference on Hybrid Intelligent Systems (12th : 2012 : Pune, India)en
item.fulltextNo Fulltext-
Appears in Collections:MAE Conference Papers

Citations 20

Updated on Mar 23, 2023

Page view(s) 50

Updated on Mar 26, 2023

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.