Towards schema-based, constructivist robot learning: Validating an evolutionary search algorithm for schema chunking

In this paper, we lay the groundwork for extending our previously developed ASyMTRe architecture to enable constructivist learning for multi-robot team tasks. The ASyMTRe architecture automatically configures schemas within, and across, robots to form the highest utility solution that achieves a given multi-robot team task. We believe that the schema- based approach used in ASyMTRe is a useful abstraction not only for forming heterogeneous coalitions, but also for enabling constructivist learning, in which chunks of schemas that solve intermediate subproblems are learned and then made available for future task solutions. However, the existing ASyMTRe search algorithm for finding configurations of schemas that completely solve given tasks (Centralized ASyMTRe - CA) is not well-suited for identifying useful chunks of schemas that could solve intermediate subtasks that may be useful in the future. Thus, in this current work, we explore an Evolutionary Learning (EL) technique for the offline learning of schema chunks that could be saved and used later in an online search (using the regular CA algorithm) for coalition configurations. However, we do not want to sacrifice solution quality in making use of the evolutionary search technique. Thus, we compare the solutions discovered by the EL algorithm with those that are found using CA, as well as with a third algorithm that randomizes the CA algorithm, called RA. Four different applications in simulation are used to evaluate the EL, CA, and RA techniques. Our results show that the EL approach indeed finds solutions of comparable quality to the CA technique, while also providing the added benefit of learning highly fit partial solutions, or schema chunks, that may be beneficial for future tasks via constructivist learning. We conclude by arguing that the combination of the online CA search for solving current multi-robot tasks can be combined with the offline EL approach that can identify intermediate solutions (or schema chunks) that may be useful for future team tasks. This combination should lead to an overall efficiency improvement for identifying coalition formations, as well as for continual learning.

[1]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

[2]  Marco C. Bettoni,et al.  Made-Up Minds: A Constructivist Approach to Artificial Intelligence , 1993, IEEE Expert.

[3]  Harold H. Chaput and Benjamin Kuipers and Risto Miikkulainen Constructivist Learning: A Neural Implementation of the Schema Mechanism , 2003 .

[4]  Lynne E. Parker,et al.  ASyMTRe: Automated Synthesis of Multi-Robot Task Solutions through Software Reconfiguration , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[5]  Fang Tang,et al.  Coalescent multi-robot teaming through ASyMTRe: a formal analysis , 2005, ICAR '05. Proceedings., 12th International Conference on Advanced Robotics, 2005..

[6]  Michael A. Arbib,et al.  Schema theory , 1998 .

[7]  Lynne E. Parker,et al.  Distributed multi-robot coalitions through ASyMTRe-D , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[8]  P. L. Adams THE ORIGINS OF INTELLIGENCE IN CHILDREN , 1976 .

[9]  Lynne E. Parker,et al.  Building Multirobot Coalitions Through Automated Task Solution Synthesis , 2006, Proceedings of the IEEE.

[10]  Risto Miikkulainen,et al.  The constructivist learning architecture: a model of cognitive development for robust autonomous robots , 2004 .

[11]  J. Bruner Acts of meaning , 1990 .

[12]  Sarit Kraus,et al.  Feasible Formation of Coalitions Among Autonomous Agents in Nonsuperadditive Environments , 1999, Comput. Intell..