TY - GEN
T1 - Morphogenesis as a Collective Decision of Agents Competing for Limited Resource: a Plants Approach
AU - Zahadat, Payam
AU - Hofstadler, Daniel Nicolas
AU - Schmickl, Thomas
PY - 2018
Y1 - 2018
N2 - Competition for limited resource is a common concept in many artificial and natural collective systems. In plants, the common resources -water, minerals and the products of photosynthesis - are a subject of competition for individual branches striving for growth. The competition is realized via a dynamic vascular system resulting in the dynamic morphology of the plant that is adapting to its environment. In this paper, a distributed morphogenesis algorithm inspired by the competition for limited resources in plants is described and is validated in directing the growth of a physical structure made out of braided modules. The effects of different parameters of the algorithm on the growth behavior of the structure are discussed analytically and similar effects are demonstrated in the physical system.
AB - Competition for limited resource is a common concept in many artificial and natural collective systems. In plants, the common resources -water, minerals and the products of photosynthesis - are a subject of competition for individual branches striving for growth. The competition is realized via a dynamic vascular system resulting in the dynamic morphology of the plant that is adapting to its environment. In this paper, a distributed morphogenesis algorithm inspired by the competition for limited resources in plants is described and is validated in directing the growth of a physical structure made out of braided modules. The effects of different parameters of the algorithm on the growth behavior of the structure are discussed analytically and similar effects are demonstrated in the physical system.
U2 - 10.1007/978-3-030-00533-7_7
DO - 10.1007/978-3-030-00533-7_7
M3 - Article in proceedings
T3 - Lecture Notes in Computer Science
SP - 84
EP - 96
BT - 11th International Conference, ANTS 2018, Rome, Italy, October 29–31, 2018, Proceedings
PB - Springer
ER -