Abstract

Limiting factors on achievable performance in the continuous- and discrete-time fixed-lag smoothing problems are shown to include geometric constraints, inherited from the fixed-interval (Linfin) problem, and analytic constraints, affected by the preview interval. Thus, the fixed-lag problem is viewed as a constrained version of its fixed-interval counterpart. The analysis sheds light on the dependence of achievable performance on the preview length and, in particular, on the generic presence of performance saturation at a finite preview interval.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.