University of Hertfordshire

By the same authors

Look-ahead relevant information: Reducing cognitive burden over prolonged tasks

Research output: Chapter in Book/Report/Conference proceedingConference contribution


  • 904555

    Submitted manuscript, 438 KB, PDF document

View graph of relations
Original languageEnglish
Title of host publicationProcs of 2011 IEEE Symposium on Artificial Life
Number of pages8
ISBN (Print)978-161284063-5
Publication statusPublished - 2011
EventALIFE 2011 - Paris, France
Duration: 11 Apr 201115 Apr 2011

Publication series

NameSymposium Series on Computational Intelligence - IEEE ALIFE 2011


ConferenceALIFE 2011


Based on the fact that information processing is costly, we study in this paper the trade-off between performance and informational requirements. Most importantly, we are interested in how local decisions can alleviate future cognitive burden, measured by the amount of sensory information an agent processes, without conceding performance. We introduce lookahead information as a novel concept to capture the long-term informational requirements and present an iterative method to determine the value of this quantity. Using an example problem, we show how these long-term considerations enable an agent to predict future effects of its actions on its informational burden, and to shape the course of the world to achieve more informationally parsimonious behaviour.


“This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder." “Copyright IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.”

ID: 424282