We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in a given class, for discrete-time systems with control and state constraints. We show that the tracking domain of attraction is exactly equal to the domain of attraction, say the set of states which can be brought to the origin by a proper feedback law. For constant reference signals we establish a connection between the convergence speed of the stabilization problem and tracking convergence which turns out to be independent of the reference signal. We also show that the tracking controller can be inferred from the stabilizing (possibly nonlinear) controller associated with the domain of attraction. The full version of this paper (SIAM J. Contr. Optim., Vol.38 (2000)) includes the continuous-time case, proofs and extensions.
对于具有控制和状态约束的离散时间系统，我们面临的问题是确定一个吸引的跟踪域，即一组初始状态，从这些初始状态开始可以跟踪给定类中的参考信号。我们证明了引力的跟踪域与引力域是完全相等的，即可以通过适当的反馈律带到原点的状态集。对于恒定的参考信号，我们建立了稳定问题的收敛速度与跟踪收敛之间的联系，证明了跟踪收敛与参考信号无关。我们还证明了跟踪控制器可以从与吸引域相关的稳定(可能是非线性)控制器中推断出来。本文全文(SIAM J. control . Optim。， Vol.38(2000))包括连续时间的情况，证明和推广。
{"title":"Any domain of attraction for a linear constrained system is a tracking domain of attraction","authors":"F. Blanchini, S. Miani","doi":"10.1109/CDC.2001.914745","DOIUrl":"https://doi.org/10.1109/CDC.2001.914745","url":null,"abstract":"We face the problem of determining a tracking domain of attraction, say the set of initial states starting from which it is possible to track reference signals in a given class, for discrete-time systems with control and state constraints. We show that the tracking domain of attraction is exactly equal to the domain of attraction, say the set of states which can be brought to the origin by a proper feedback law. For constant reference signals we establish a connection between the convergence speed of the stabilization problem and tracking convergence which turns out to be independent of the reference signal. We also show that the tracking controller can be inferred from the stabilizing (possibly nonlinear) controller associated with the domain of attraction. The full version of this paper (SIAM J. Contr. Optim., Vol.38 (2000)) includes the continuous-time case, proofs and extensions.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116341931","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Target detection and azimuth determination is accomplished in the enroute air traffic control radar beacon system with a sliding window processor. Due to missed replies and the presence of interference the center mark is not deterministic, and can only be described in a statistical sense. A novel approach is taken which introduces a class of input/output sequences that establish the validity of a target start. An expression for the center mark distribution is developed around these "valid chains". The resulting analytic tool is used to examine sliding window performance in several current and projected ATC environments and is available to determine optimal sliding window parameter settings. An important finding is that the centermark estimate is biased; for low reply probability or high interferencerates this term is a significant source of error.
{"title":"Performance of a sliding window detector in a high interference air traffic environment","authors":"B. Rubinger","doi":"10.1109/CDC.1974.270420","DOIUrl":"https://doi.org/10.1109/CDC.1974.270420","url":null,"abstract":"Target detection and azimuth determination is accomplished in the enroute air traffic control radar beacon system with a sliding window processor. Due to missed replies and the presence of interference the center mark is not deterministic, and can only be described in a statistical sense. A novel approach is taken which introduces a class of input/output sequences that establish the validity of a target start. An expression for the center mark distribution is developed around these \"valid chains\". The resulting analytic tool is used to examine sliding window performance in several current and projected ATC environments and is available to determine optimal sliding window parameter settings. An important finding is that the centermark estimate is biased; for low reply probability or high interferencerates this term is a significant source of error.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1974-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134469633","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In this paper, a comprehensive look is taken at the Newton-Raphson method of solving the algebraic matrix Riccati equation. Its important numerical properties and computational requirements are also discussed.
本文对求解代数矩阵里卡蒂方程的牛顿-拉夫逊方法进行了全面的研究。讨论了其重要的数值性质和计算要求。
{"title":"Numerical solution of the algebraic matrix Riccati equation","authors":"F. Man","doi":"10.1109/CDC.1973.269223","DOIUrl":"https://doi.org/10.1109/CDC.1973.269223","url":null,"abstract":"In this paper, a comprehensive look is taken at the Newton-Raphson method of solving the algebraic matrix Riccati equation. Its important numerical properties and computational requirements are also discussed.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"152 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1973-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132921514","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The problem of constructing an "observer" to enable us to implement an approximate optimal control for a distributed parameter system is examined where the state is measured at a few pre-specified points. The observer is formulated as the output of a dynamical system described by a set of ordinary differential equations. Both distributed and boundary control problems are studied and the observer-formulation is set up for both cases. Some reasonable assumptions have been made in order that the approximation introduced by the eigenfunction expansion technique be satisfactory. For the case of the boundary control problem, a simple example is solved to illustrate the method.
{"title":"Design of optimal controllers for distributed systems using finite dimensional state observers","authors":"P. Stavroulakis, P. Sarachik","doi":"10.1109/CDC.1973.269140","DOIUrl":"https://doi.org/10.1109/CDC.1973.269140","url":null,"abstract":"The problem of constructing an \"observer\" to enable us to implement an approximate optimal control for a distributed parameter system is examined where the state is measured at a few pre-specified points. The observer is formulated as the output of a dynamical system described by a set of ordinary differential equations. Both distributed and boundary control problems are studied and the observer-formulation is set up for both cases. Some reasonable assumptions have been made in order that the approximation introduced by the eigenfunction expansion technique be satisfactory. For the case of the boundary control problem, a simple example is solved to illustrate the method.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1973-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132689383","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper summarizes two high-speed, adaptive modems for voice-band channels. The first is a 4800 bps, MOS/LSI modem which is almost entirely contained on 5 to 8 MOS/LSI chips, depending upon the version. The second modem is experimental and employs advanced, novel techniques for automatic equalization, carrier recovery, timing recovery, and jitter correction. Partial response, SSB signaling provides both high bandwidth efficiency and error correction without digit redundancy. Measured performance curves, including bit error rates, show that, under various transmission conditions, this modem provides outstanding performance. Implementation on a few MOS/ LSI chips or in an inexpensive signal processor is feasible.
{"title":"Adaptive high speed data modems","authors":"E. Gibson","doi":"10.1109/CDC.1973.269164","DOIUrl":"https://doi.org/10.1109/CDC.1973.269164","url":null,"abstract":"This paper summarizes two high-speed, adaptive modems for voice-band channels. The first is a 4800 bps, MOS/LSI modem which is almost entirely contained on 5 to 8 MOS/LSI chips, depending upon the version. The second modem is experimental and employs advanced, novel techniques for automatic equalization, carrier recovery, timing recovery, and jitter correction. Partial response, SSB signaling provides both high bandwidth efficiency and error correction without digit redundancy. Measured performance curves, including bit error rates, show that, under various transmission conditions, this modem provides outstanding performance. Implementation on a few MOS/ LSI chips or in an inexpensive signal processor is feasible.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1973-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132206695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
This paper describes different types of patterning which exist in such diverse types of data as speech, text, and pictorial scenes. Several programs which process such data are discussed in terms of contextual, syntactic, semantic, and problem-domain dependent factors. Each of these factors constitutes a potential level of computer processing. By introducing different processing levels each having certain special characteristics (success on some data, inability to resolve other data) we isolate a general technique for producing a level adaptive program system.
{"title":"Pattern recognition programs with level adaptation","authors":"A. Klinger","doi":"10.1109/CDC.1973.269136","DOIUrl":"https://doi.org/10.1109/CDC.1973.269136","url":null,"abstract":"This paper describes different types of patterning which exist in such diverse types of data as speech, text, and pictorial scenes. Several programs which process such data are discussed in terms of contextual, syntactic, semantic, and problem-domain dependent factors. Each of these factors constitutes a potential level of computer processing. By introducing different processing levels each having certain special characteristics (success on some data, inability to resolve other data) we isolate a general technique for producing a level adaptive program system.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1973-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133703176","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
The concept of Pareto optimality and the concept of max-inf condition are used to give a new definition of optimality for a coalition of players. A necessary condition and a sufficient condition are proven for a class of topological games by using the approach of the theory of reachability for perturbed systems.
{"title":"On Pareto optimal decisions for a coalition of a subset of players","authors":"A. Haurie","doi":"10.1109/CDC.1972.269017","DOIUrl":"https://doi.org/10.1109/CDC.1972.269017","url":null,"abstract":"The concept of Pareto optimality and the concept of max-inf condition are used to give a new definition of optimality for a coalition of players. A necessary condition and a sufficient condition are proven for a class of topological games by using the approach of the theory of reachability for perturbed systems.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133426779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A computer simulation of muscular energetics during exercise has been developed and tested. The model and results are described.
运动过程中肌肉能量学的计算机模拟已经开发和测试。描述了模型和结果。
{"title":"A mathematical model of muscular respiratory dynamics","authors":"H. Borovetz, M. Weissman","doi":"10.1109/CDC.1972.268930","DOIUrl":"https://doi.org/10.1109/CDC.1972.268930","url":null,"abstract":"A computer simulation of muscular energetics during exercise has been developed and tested. The model and results are described.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1972-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133404314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
A method for accelerating the convergence in model reference adaptive control systems is presented. The novel feature is to feedback an appropriate function of the parameter misalignment signal to each adjusting mechanism channel. The adaptive loops incorporating feedback can be synthesized either directly from a Liapunov Function or indirectly from the minimization of a Liapunov function along the steepest descent path. In both cases, the derivative of the Liapunov function is negative definite in error and parameter misalignment, whereas it is only semi-definite in previous work. The advantages are easy implementation, and rapid convergence to zero of both the system response error and the errors of the adjustable parameters. Simulation studies on a second order system confirm the theoretical predictions.
{"title":"Accelerated model reference adaptation via Liapunov and Steepest descent design techniques","authors":"H. Shahein, M. Ghonaimy, D. Shen","doi":"10.1109/CDC.1971.270989","DOIUrl":"https://doi.org/10.1109/CDC.1971.270989","url":null,"abstract":"A method for accelerating the convergence in model reference adaptive control systems is presented. The novel feature is to feedback an appropriate function of the parameter misalignment signal to each adjusting mechanism channel. The adaptive loops incorporating feedback can be synthesized either directly from a Liapunov Function or indirectly from the minimization of a Liapunov function along the steepest descent path. In both cases, the derivative of the Liapunov function is negative definite in error and parameter misalignment, whereas it is only semi-definite in previous work. The advantages are easy implementation, and rapid convergence to zero of both the system response error and the errors of the adjustable parameters. Simulation studies on a second order system confirm the theoretical predictions.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1971-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134305938","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
During the last decade, system analysis has moved into a more dominant role in transportation planning. Many of the larger cities have followed the lead of Detroit and Chicago in establishing citywide planning activities based on comprehensive statistics and systematic use of mathematical models. Attempts at regional planning have been seen in the Penn-Jersey study and the Northeast Corridor Project and a recent national effort was undertaken by the U.S. Department of Transportation for the 1972 National Transportation Report to Congress. In all of these an extensive use of mathematical modeling has been employed to describe intercity transportation.
{"title":"Modeling transportation systems: An overview","authors":"G. Zames, G. Kovatch","doi":"10.1109/CDC.1971.271002","DOIUrl":"https://doi.org/10.1109/CDC.1971.271002","url":null,"abstract":"During the last decade, system analysis has moved into a more dominant role in transportation planning. Many of the larger cities have followed the lead of Detroit and Chicago in establishing citywide planning activities based on comprehensive statistics and systematic use of mathematical models. Attempts at regional planning have been seen in the Penn-Jersey study and the Northeast Corridor Project and a recent national effort was undertaken by the U.S. Department of Transportation for the 1972 National Transportation Report to Congress. In all of these an extensive use of mathematical modeling has been employed to describe intercity transportation.","PeriodicalId":411031,"journal":{"name":"IEEE Conference on Decision and Control","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1971-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134627163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：