Abstract
Dependable cyber-physical systems strive to deliver anticipative, multi-objective performance anytime, facing deluges of inputs with varying and limited resources. This is even more challenging for life-long learning rational agents as they also have to contend with the varying and growing know-how accumulated from experience. These issues are of crucial practical value, yet have been only marginally and unsatisfactorily addressed in AGI research. We present a value-driven computational model of anytime bounded rationality robust to variations of both resources and knowledge. It leverages continually learned knowledge to anticipate, revise and maintain concurrent courses of action spanning over arbitrary time scales for execution anytime necessary.
Cite
CITATION STYLE
Nivel, E., Thórisson, K. R., Steunebrink, B., & Schmidhuber, J. (2015). Anytime bounded rationality. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9205, pp. 121–130). Springer Verlag. https://doi.org/10.1007/978-3-319-21365-1_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
