×

A morphological adaptation approach to path planning inspired by slime mould. (English) Zbl 1338.68249

Summary: Path planning is a classic problem in computer science and robotics which has recently been implemented in unconventional computing substrates such as chemical reaction-diffusion computers. These novel computing schemes utilise the parallel spatial propagation of information and often use a two-stage method involving diffusive propagation to discover all paths and a second stage to highlight or visualise the path between two particular points in the arena. The true slime mould Physarum polycephalum is known to construct efficient transport networks between nutrients in its environment. These networks are continuously remodelled as the organism adapts its body plan to changing spatial stimuli. It can be guided towards attractant stimuli (nutrients, warm regions) and it avoids locations containing hazardous stimuli (light irradiation, repellents, or regions occupied by predatory threats). Using a particle model of slime mould we demonstrate scoping experiments which explore how path planning may be performed by morphological adaptation. We initially demonstrate simple path planning by a shrinking blob of virtual plasmodium between two attractant sources within a polygonal arena. We examine the case where multiple paths are required and the subsequent selection of a single path from multiple options. Collision-free paths are implemented via repulsion from the borders of the arena. Finally, obstacle avoidance is implemented by repulsion from obstacles as they are uncovered by the shrinking blob. These examples show proof-of-concept results of path planning by morphological adaptation which complement existing research on path planning in novel computing substrates.

MSC:

68T40 Artificial intelligence for robotics
68Q05 Models of computation (Turing machines, etc.) (MSC2010)
92C80 Plant biology
PDFBibTeX XMLCite
Full Text: DOI arXiv

References:

[1] DOI: 10.1142/S0129626407003150 · doi:10.1142/S0129626407003150
[2] DOI: 10.1142/S0129626409000109 · Zbl 1519.68081 · doi:10.1142/S0129626409000109
[3] DOI: 10.1016/S0960-0779(02)00409-5 · doi:10.1016/S0960-0779(02)00409-5
[4] DOI: 10.1007/s11047-009-9146-8 · Zbl 1209.68257 · doi:10.1007/s11047-009-9146-8
[5] DOI: 10.1016/S0167-2789(97)00049-3 · doi:10.1016/S0167-2789(97)00049-3
[6] DOI: 10.1007/978-1-4899-3683-7_32 · doi:10.1007/978-1-4899-3683-7_32
[7] DOI: 10.1162/artl.2010.16.2.16202 · doi:10.1162/artl.2010.16.2.16202
[8] DOI: 10.1007/s11047-010-9223-z · Zbl 06107150 · doi:10.1007/s11047-010-9223-z
[9] Jones J., International Journal of Unconventional Computing 7 (6) pp 423– (2011)
[10] DOI: 10.1016/j.biosystems.2010.04.005 · doi:10.1016/j.biosystems.2010.04.005
[11] DOI: 10.1007/s11047-013-9401-x · Zbl 06563810 · doi:10.1007/s11047-013-9401-x
[12] DOI: 10.1088/1748-3182/9/3/036016 · doi:10.1088/1748-3182/9/3/036016
[13] DOI: 10.1021/ja9076793 · doi:10.1021/ja9076793
[14] DOI: 10.1039/b706317m · doi:10.1039/b706317m
[15] DOI: 10.1098/rspb.2004.2856 · doi:10.1098/rspb.2004.2856
[16] DOI: 10.1038/35035159 · doi:10.1038/35035159
[17] Rambidi N. G., International Journal of Unconventional Computing 1 (2) pp 101– (2005)
[18] DOI: 10.1142/S0218127409024682 · doi:10.1142/S0218127409024682
[19] DOI: 10.1126/science.267.5199.868 · doi:10.1126/science.267.5199.868
[20] DOI: 10.1016/j.biosystems.2003.08.001 · doi:10.1016/j.biosystems.2003.08.001
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.