Escaping local optima in a class of multi-agent distributed optimization problems: a boosting function approach

Simple item page
dc.citation.epage3706en_US
dc.citation.spage3701en_US
dc.contributor.authorSun, X.en_US
dc.contributor.authorCassandras, C. G.en_US
dc.contributor.authorGökbayrak, Kaanen_US
dc.coverage.spatialLos Angeles, California, USAen_US
dc.date.accessioned2016-02-08T11:48:27Z
dc.date.available2016-02-08T11:48:27Z
dc.date.issued2014en_US
dc.departmentDepartment of Industrial Engineeringen_US
dc.descriptionDate of Conference: 15-17 December 2014en_US
dc.descriptionConference Name: 53rd IEEE Conference on Decision and Control, IEEE 2014en_US
dc.description.abstractWe address the problem of multiple local optima commonly arising in optimization problems for multi-agent systems, where objective functions are nonlinear and nonconvex. For the class of coverage control problems, we propose a systematic approach for escaping a local optimum, rather than randomly perturbing controllable variables away from it. We show that the objective function for these problems can be decomposed to facilitate the evaluation of the local partial derivative of each node in the system and to provide insights into its structure. This structure is exploited by defining 'boosting functions' applied to the aforementioned local partial derivative at an equilibrium point where its value is zero so as to transform it in a way that induces nodes to explore poorly covered areas of the mission space until a new equilibrium point is reached. The proposed boosting process ensures that, at its conclusion, the objective function is no worse than its pre-boosting value. However, the global optima cannot be guaranteed. We define three families of boosting functions with different properties and provide simulation results illustrating how this approach improves the solutions obtained for this class of distributed optimization problems.en_US
dc.description.provenanceMade available in DSpace on 2016-02-08T11:48:27Z (GMT). No. of bitstreams: 1 bilkent-research-paper.pdf: 70227 bytes, checksum: 26e812c6f5156f83f0e77b261a471b5a (MD5) Previous issue date: 2014en
dc.identifier.doi10.1109/CDC.2014.7039965en_US
dc.identifier.issn0743-1546en_US
dc.identifier.urihttp://hdl.handle.net/11693/27241
dc.language.isoEnglishen_US
dc.publisherIEEEen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/CDC.2014.7039965en_US
dc.source.titleProceedings of the 53rd IEEE Conference on Decision and Control, IEEE 2014en_US
dc.subjectBoostingen_US
dc.subjectLinear programmingen_US
dc.subjectSpace missionsen_US
dc.subjectOptimizationen_US
dc.subjectSensorsen_US
dc.subjectAerospace electronicsen_US
dc.titleEscaping local optima in a class of multi-agent distributed optimization problems: a boosting function approachen_US
dc.typeConference Paperen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Escaping local optima in a class of multi-agent distributed optimization problems A boosting function approachb.pdf
Size:
351.51 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download

Collections

Department of Industrial Engineering