Artificial Life最新文献_第2页

Book Review: New Directions (and Insights) in Braitenberg Vehicles and Cognitive Science 书评：布里滕贝格车辆与认知科学的新方向（和新见解）

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_r_00452

Bradly Alicea

引用次数: 0

Reviewers of Volume 30 第30卷审稿人

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_x_00465

引用次数: 0

Evolving Novel Gene Regulatory Networks for Structural Engineering Designs 为结构工程设计开发新的基因调控网络

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_a_00448

Rahul Dubey;Simon Hickinbotham;Andrew Colligan;Imelda Friel;Edgar Buchanan;Mark Price;Andy M. Tyrrell

{"title":"Evolving Novel Gene Regulatory Networks for Structural Engineering Designs","authors":"Rahul Dubey;Simon Hickinbotham;Andrew Colligan;Imelda Friel;Edgar Buchanan;Mark Price;Andy M. Tyrrell","doi":"10.1162/artl_a_00448","DOIUrl":"10.1162/artl_a_00448","url":null,"abstract":"Engineering design optimization poses a significant challenge, usually requiring human expertise to discover superior solutions. Although various search techniques have been employed to generate diverse designs, their effectiveness is often limited by problem-specific parameter tuning, making them less generalizable and scalable. This article introduces a framework inspired by evolutionary and developmental (evo-devo) concepts, aiming to automate the evolution of structural engineering designs. In biological systems, evo-devo governs the growth of single-cell organisms into multicellular organisms through the use of gene regulatory networks (GRNs). GRNs are inherently complex and highly nonlinear, and this article explores the use of neural networks and genetic programming as artificial representations of GRNs to emulate such behaviors. To evolve a wide range of Pareto fronts for artificial GRNs, this article introduces a new technique, a real value–encoded neuroevolutionary method termed real-encoded NEAT (RNEAT). The performance of RNEAT is compared with that of two well-known evolutionary search techniques across different 2-D and 3-D problems. The experimental results demonstrate two key findings. First, the proposed framework effectively generates a population of GRNs that can produce diverse structures for both 2-D and 3-D problems. Second, the proposed RNEAT algorithm outperforms its competitors on more than 50% of the problems examined. These results validate the proof of concept underlying the proposed evo-devo-based engineering design evolution.","PeriodicalId":55574,"journal":{"name":"Artificial Life","volume":"30 4","pages":"466-485"},"PeriodicalIF":1.6,"publicationDate":"2024-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141992505","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Heterogeneous Thresholds, Social Ranking, and the Emergence of Vague Categories 异质阈值、社会排名和模糊类别的出现。

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_a_00442

Jonathan Lawry

引用次数: 0

Artificial Life Needs More Translational Research 人工生命需要更多的转化研究。

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_e_00464

Alan Dorin;Susan Stepney

引用次数: 0

Outsourcing Control Requires Control Complexity 外包控制要求控制复杂。

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_a_00443

Carlotta Langer;Nihat Ay

引用次数: 0

Emergence and Criticality in Spatiotemporal Synchronization: The Complementarity Model 时空同步中的新兴性和临界性：互补模型。

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-11-05 DOI: 10.1162/artl_a_00440

Alessandro Scirè

引用次数: 0

Evolvability in Artificial Development of Large, Complex Structures and the Principle of Terminal Addition. 大型复杂结构人工开发中的可进化性和末端加法原理。

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-10-31 DOI: 10.1162/artl_a_00460

Alessandro Fontana, Borys Wróbel

{"title":"Evolvability in Artificial Development of Large, Complex Structures and the Principle of Terminal Addition.","authors":"Alessandro Fontana, Borys Wróbel","doi":"10.1162/artl_a_00460","DOIUrl":"https://doi.org/10.1162/artl_a_00460","url":null,"abstract":"Epigenetic tracking (ET) is a model of development that is capable of generating diverse, arbitrary, complex three-dimensional cellular structures starting from a single cell. The generated structures have a level of complexity (in terms of the number of cells) comparable to multicellular biological organisms. In this article, we investigate the evolvability of the development of a complex structure inspired by the \"French flag\" problem: an \"Italian Anubis\" (a three-dimensional, doglike figure patterned in three colors). Genes during development are triggered in ET at specific developmental stages, and the fitness of individuals during simulated evolution is calculated after a certain stage. When this evaluation stage was allowed to evolve, genes that were triggered at later stages of development tended to be incorporated into the genome later during evolutionary runs. This suggests the emergence of the property of terminal addition in this system. When the principle of terminal addition was explicitly incorporated into ET, and was the sole mechanism for introducing morphological innovation, evolvability improved markedly, leading to the development of structures much more closely approximating the target at a much lower computational cost.","PeriodicalId":55574,"journal":{"name":"Artificial Life","volume":" ","pages":"1-13"},"PeriodicalIF":1.6,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142559566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Network Bottlenecks and Task Structure Control the Evolution of Interpretable Learning Rules in a Foraging Agent. 网络瓶颈和任务结构控制着觅食机器人可解释学习规则的演化

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-10-31 DOI: 10.1162/artl_a_00458

Emmanouil Giannakakis, Sina Khajehabdollahi, Anna Levina

引用次数: 0

Investigating the Limits of Familiarity-Based Navigation. 研究基于熟悉度的导航的局限性

IF 1.6 4区计算机科学

Artificial Life Pub Date : 2024-10-31 DOI: 10.1162/artl_a_00459

Amany Azevedo Amin, Efstathios Kagioulis, Norbert Domcsek, Thomas Nowotny, Paul Graham, Andrew Philippides

{"title":"Investigating the Limits of Familiarity-Based Navigation.","authors":"Amany Azevedo Amin, Efstathios Kagioulis, Norbert Domcsek, Thomas Nowotny, Paul Graham, Andrew Philippides","doi":"10.1162/artl_a_00459","DOIUrl":"https://doi.org/10.1162/artl_a_00459","url":null,"abstract":"Insect-inspired navigation strategies have the potential to unlock robotic navigation in power-constrained scenarios, as they can function effectively with limited computational resources. One such strategy, familiarity-based navigation, has successfully navigated a robot along routes of up to 60 m using a single-layer neural network trained with an Infomax learning rule. Given the small size of the network that effectively encodes the route, here we investigate the limits of this method, challenging it to navigate longer routes, investigating the relationship between performance, view acquisition rate and dimension, network size, and robustness to noise. Our goal is both to determine the parameters at which this method operates effectively and to explore the profile with which it fails, both to inform theories of insect navigation and to improve robotic deployments. We show that effective memorization of familiar views is possible for longer routes than previously attempted, but that this length decreases for reduced input view dimensions. We also show that the ideal view acquisition rate must be increased with route length for consistent performance. We further demonstrate that computational and memory savings may be made with equivalent performance by reducing the network size-an important consideration for applicability to small, lower-power robots-and investigate the profile of memory failure, demonstrating increased confusion across the route as it extends in length. In this extension to previous work, we also investigate the form taken by the network weights as training extends and the areas of the image on which visual familiarity-based navigation most relies. Additionally, we investigate the robustness of familiarity-based navigation to view variation caused by noise.","PeriodicalId":55574,"journal":{"name":"Artificial Life","volume":" ","pages":"1-17"},"PeriodicalIF":1.6,"publicationDate":"2024-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142559567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0