Mathematical foundations of discrete and functional systems with strong and weak anticipations

111Citations
Citations of this article
46Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper deals with some mathematical developments to model anticipatory capabilities in discrete and continuous systems. The paper defines weak anticipation and strong anticipation and introduces the concepts of incursive and hyperincursive discrete processes as an extension to recursion. Functional systems represented by differential difference equations with anticipation and/or delay seem to be a very useful tool for describing strong anticipation. Anticipation and delay play a complementary role and synchronization mechanisms seem to be a powerful way to anticipate the evolution of systems with delay. This paper shows finally that the modelling of anticipation in predictive control is the basic mechanism for enhancing the control of the trajectory of systems toward a target.

Cite

CITATION STYLE

APA

Dubois, D. M. (2003). Mathematical foundations of discrete and functional systems with strong and weak anticipations. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2684, pp. 110–132). Springer Verlag. https://doi.org/10.1007/978-3-540-45002-3_7

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free