首页 /研究 /Robustness, evolvability and complexity in Boolean network robots
OTHER

Robustness, evolvability and complexity in Boolean network robots

Andrea Roli, Stefano Benedettini, Mauro Birattari, Carlo Pinciroli, Roberto Serra, Marco Villani

发表年份
2011
引用次数
3

摘要

In this work, we present the results of a thorough analysis of the BN-robot's dynamics. We analysed the trajectories followed by the BN-robot in the space of the BN states. We found that the best performing BNs show the capability of maintaining previous learned behaviours (robustness), while adapting to new tasks to perform (evolvability). This property seems also to be positively correlated with a measure of the complexity of the BN.

关键词

EvolvabilityRobustness (evolution)Computer scienceBoolean networkRobotTheoretical computer scienceBoolean functionArtificial intelligenceAlgorithm

相关论文

查看 OTHER 分类全部论文