最优控制问题的微分反stigmergy算法

2018 22nd International Conference on System Theory, Control and Computing (ICSTCC) Pub Date : 2018-10-01 DOI:10.1109/ICSTCC.2018.8540767

A. Serbencu, V. Mînzu

{"title":"最优控制问题的微分反stigmergy算法","authors":"A. Serbencu, V. Mînzu","doi":"10.1109/ICSTCC.2018.8540767","DOIUrl":null,"url":null,"abstract":"The objective of this paper is to show how the Differential Ant-Stigmergy Algorithm (DASA) can be used to solve an Optimal Control Problem (OCP). A version of this algorithm devoted to search a good solution for an OCP is presented. Because this kind of problems has usually a large computational complexity, a technique to reduce it is presented. This one exploits a particularity of DASA related to the coding of the problem's solution. In the first phase, DASA find out a good solution in a small number of iteration by adopting a rough coding of the control input. The second phase is a kind of zoom of the search space around this solution, which becomes initial solution, with a finer coding of the control input.","PeriodicalId":308427,"journal":{"name":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","volume":"126 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Differential Ant-Stigmergy Algorithm for Optimal Control Problems\",\"authors\":\"A. Serbencu, V. Mînzu\",\"doi\":\"10.1109/ICSTCC.2018.8540767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The objective of this paper is to show how the Differential Ant-Stigmergy Algorithm (DASA) can be used to solve an Optimal Control Problem (OCP). A version of this algorithm devoted to search a good solution for an OCP is presented. Because this kind of problems has usually a large computational complexity, a technique to reduce it is presented. This one exploits a particularity of DASA related to the coding of the problem's solution. In the first phase, DASA find out a good solution in a small number of iteration by adopting a rough coding of the control input. The second phase is a kind of zoom of the search space around this solution, which becomes initial solution, with a finer coding of the control input.\",\"PeriodicalId\":308427,\"journal\":{\"name\":\"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)\",\"volume\":\"126 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICSTCC.2018.8540767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSTCC.2018.8540767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文的目的是展示如何使用微分反污名算法(DASA)来解决最优控制问题(OCP)。给出了该算法的一个版本，用于搜索一个OCP的好解。由于此类问题通常具有较大的计算复杂度，因此提出了一种降低计算复杂度的方法。它利用了与问题解决方案编码相关的DASA的特殊性。在第一阶段，DASA通过对控制输入进行粗略编码，在少量迭代中找到较好的解决方案。第二阶段是围绕这个解决方案的搜索空间的一种缩放，它成为初始解决方案，具有更精细的控制输入编码。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Differential Ant-Stigmergy Algorithm for Optimal Control Problems

The objective of this paper is to show how the Differential Ant-Stigmergy Algorithm (DASA) can be used to solve an Optimal Control Problem (OCP). A version of this algorithm devoted to search a good solution for an OCP is presented. Because this kind of problems has usually a large computational complexity, a technique to reduce it is presented. This one exploits a particularity of DASA related to the coding of the problem's solution. In the first phase, DASA find out a good solution in a small number of iteration by adopting a rough coding of the control input. The second phase is a kind of zoom of the search space around this solution, which becomes initial solution, with a finer coding of the control input.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2018 22nd International Conference on System Theory, Control and Computing (ICSTCC)

自引率

0.00%

发文量