{"title":"Target-Point Interpolation of a Program Control in the Approach Problem","authors":"A. V. Alekseev, A. A. Ershov","doi":"10.1134/s0965542524030035","DOIUrl":null,"url":null,"abstract":"<h3 data-test=\"abstract-sub-heading\">Abstract</h3><p>For a nonlinear controlled system, a fixed-time approach problem is considered in which the target point location becomes known only at the start of motion. According to the proposed solution method, node resolving program controls corresponding to a finite collection of target points from the set of their admissible locations are computed in advance and a refined control for the target point given at the start of motion is determined via linear interpolation of the node controls. The procedure for designing such a resolving control is formulated in the form of two algorithms, one of which is run before the start of the motion, and the other is executed in real time while the system is moving. The error in the transfer of the system’s state to the target point by applying these algorithms is estimated. As an example, we consider the approach problem for a modified Dubins car model and a target point about which only a compact set of its admissible locations is known before the start of motion.</p>","PeriodicalId":0,"journal":{"name":"","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1134/s0965542524030035","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
For a nonlinear controlled system, a fixed-time approach problem is considered in which the target point location becomes known only at the start of motion. According to the proposed solution method, node resolving program controls corresponding to a finite collection of target points from the set of their admissible locations are computed in advance and a refined control for the target point given at the start of motion is determined via linear interpolation of the node controls. The procedure for designing such a resolving control is formulated in the form of two algorithms, one of which is run before the start of the motion, and the other is executed in real time while the system is moving. The error in the transfer of the system’s state to the target point by applying these algorithms is estimated. As an example, we consider the approach problem for a modified Dubins car model and a target point about which only a compact set of its admissible locations is known before the start of motion.