Biologically inspired computing

本文介绍了生物启发计算这一领域,它通过模拟自然界中的现象来解决计算问题。该领域涉及遗传算法、细胞自动机、人工生命等多个方面,并探讨了其与人工智能的关系。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

That's when people see bats they designed the RADAR. We learn from nature.

 

From Wikipedia: http://en.wikipedia.org/wiki/Biologically_inspired_computing

 

Biologically inspired computing

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Biologically inspired (often hyphenated as biologically-inspired) computing (also bio-inspired computing) is a field of study that loosely knits together subfields related to the topics of connectionism, social behaviour and emergence. It is often closely related to the field of artificial intelligence, as many of its pursuits can be linked to machine learning. It relies heavily on the fields of biology, computer science and mathematics. Briefly put, it is the use of computers to model nature, and simultaneously the study of nature to improve the usage of computers. Biologically inspired computing is a major subset of natural computation.

Contents

[hide]

[edit] Areas of research

Some areas of study encompassed under the canon of biologically inspired computing, and their biological counterparts:

[edit] Bio-inspired computing and AI

The way in which bio-inspired computing differs from traditional artificial intelligence (AI) is in how it takes a more evolutionary approach to learning, as opposed to the what could be described as 'creationist' methods used in traditional AI. In traditional AI, intelligence is often programmed from above: the programmer is the creator, and makes something and imbues it with its intelligence. Bio-inspired computing, on the other hand, takes a more bottom-up, decentralised approach; bio-inspired techniques often involve the method of specifying a set of simple rules, a set of simple organisms which adhere to those rules, and a method of iteratively applying those rules. After several generations of rule application it is usually the case that some forms of complex behaviour arise. Complexity gets built upon complexity until the end result is something markedly complex, and quite often completely counterintuitive from what the original rules would be expected to produce (see complex systems). For this reason, in neural network models, it is necessary to accurately model an in vivo network, by live collection of "noise" coefficients that can be used to refine statistical inference and extrapolation as system complexity increases [1].

Natural evolution is a good analogy to this method–the rules of evolution (selection, recombination/reproduction, mutation and more recently transposition) are in principle simple rules, yet over thousands of years have produced remarkably complex organisms. A similar technique is used in genetic algorithms.

[edit] See also

[edit] References

  1. ^ http://www.duke.edu/~jme17/Joshua_E._Mendoza-Elias/Research_Interests.html#Neuroscience_-_Neural_Plasticity_in

[edit] Further reading

(the following are presented in ascending order of complexity and depth, with those new to the field suggested to start from the top)

  • "Get A-life"
  • "Digital Biology", Peter J. Bentley.
  • "First International Symposium on Biologically Inspired Computing"
  • Emergence: The Connected Lives of Ants, Brains, Cities and Software, Steven Johnson.
  • Dr. Dobb's Journal, Apr-1991. (Issue theme: Biocomputing)
  • Turtles, Termites and Traffic Jams, Mitchel Resnick.
  • Understanding Nonlinear Dynamics, Daniel Kaplan and Leon Glass.
  • Fundamentals of Natural Computing: Basic Concepts, Algorithms, and Applications, L. N. de Castro, Chapman & Hall/CRC, June 2006.
  • "The Computational Beauty of Nature", Gary William Flake. MIT Press. 1998, hardcover ed.; 2000, paperback ed. An in-depth discussion of many of the topics and underlying themes of bio-inspired computing.
  • Kevin M. Passino, Biomimicry for Optimization, Control, and Automation, Springer-Verlag, London, UK, 2005.
  • Recent Developments in Biologically Inspired Computing, L. N. de Castro and F. J. Von Zuben, Idea Group Publishing, 2004.
  • Nancy Forbes, Imitation of Life: How Biology is Inspiring Computing, MIT Press, Cambridge, MA 2004.
  • "Biologically Inspired Computing Lecture Notes", Luis M. Rocha
  • The portable UNIX programming system (PUPS) and CANTOR: a computational envorionment for dynamical representation and analysis of complex neurobiological data, Mark A. O'Neill, and Claus-C Hilgetag, Phil Trans R Soc Lond B 356 (2001), 1259-1276
  • Going Back to our Roots: Second Generation Biocomputing, J. Timmis, M. Amos, W. Banzhaf, and A. Tyrrell, Journal of Unconventional Computing 2 (2007) 349 - 378.

[edit] External links

内容概要:本文介绍了一种利用元启发式算法(如粒子群优化,PSO)优化线性二次调节器(LQR)控制器加权矩阵的方法,专门针对复杂的四级倒立摆系统。传统的LQR控制器设计中,加权矩阵Q的选择往往依赖于经验和试错,而这种方法难以应对高维度非线性系统的复杂性。文中详细描述了如何将控制器参数优化问题转化为多维空间搜索问题,并通过MATLAB代码展示了具体实施步骤。关键点包括:构建非线性系统的动力学模型、设计适应度函数、采用对数缩放技术避免局部最优、以及通过实验验证优化效果。结果显示,相比传统方法,PSO优化后的LQR控制器不仅提高了稳定性,还显著减少了最大控制力,同时缩短了稳定时间。 适合人群:控制系统研究人员、自动化工程专业学生、从事机器人控制或高级控制算法开发的技术人员。 使用场景及目标:适用于需要精确控制高度动态和不确定性的机械系统,特别是在处理多自由度、强耦合特性的情况下。目标是通过引入智能化的参数寻优手段,改善现有控制策略的效果,降低人为干预的需求,提高系统的鲁棒性和性能。 其他说明:文章强调了在实际应用中应注意的问题,如避免过拟合、考虑硬件限制等,并提出了未来研究方向,例如探索非对角Q矩阵的可能性。此外,还分享了一些实践经验,如如何处理高频抖动现象,以及如何结合不同类型的元启发式算法以获得更好的优化结果。
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值