Abstract
The reactive planning algorithms proposed by P. Maes in Artificial Intelligence for real-time decision making and other derived algorithms are empirically known to converge, but no mathematical proof has been proposed. The evolution equations of these incremental algorithms can be translated into discrete time non-linear dynamical systems. We prove the convergence of such dynamical systems, provided the necessary assumptions are fulfilled, and we give an expression for the limit.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baillon, J.B.: Non densité des itérés des directions par des matrices à coefficients positifs, ICM contract DGA/ETCA/CREA/20388-92, June 1993.
Decugis, V. and Ferber, J.: Architecture Multi-Agents de Robots Mobiles Autonomes, Journées de Rochebrune 97, Ecole Nationale Supérieure des Télécom-munications, 1997.
Giszter, S.: Reinforcement tuning of action synthesis in a virtual frog, In Cliff, D. and Husbands, P. and Meyer, J.A. and Wilson, S.W. From Animal to Animat 3 (1994) 293–300.
Maes, P.: How to do the right thing, Connection Science Journal, 1,(3) February 1990.
Maes, P.: Situated Agents Can Have Goals, Robotics and Autonomous Systems, 6 (1990) 49–70.
Tyrrell, T.: Computational Mechanisms for Action Selection, University of Edinburgh, 1993.
Tyrrell, T.: An Evaluation of Maes’s Bottom-Up Mechanism for Action Selection, Adaptive Behavior, 2(4) (1994) 307–348.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Decugis, V., Beauzamy, B. Convergence of a Reactive Planning Algorithm. Positivity 8, 215–228 (2004). https://doi.org/10.1007/s11117-004-2464-2
Issue Date:
DOI: https://doi.org/10.1007/s11117-004-2464-2