Skip to main content

New Techniques for Inferring L-systems Using Genetic Algorithm

  • Conference paper
  • First Online:
Bioinspired Optimization Methods and Their Applications (BIOMA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10835))

Included in the following conference series:

Abstract

Lindenmayer systems (L-systems) are a formal grammar system that iteratively rewrites all symbols of a string, in parallel. When visualized with a graphical interpretation, the images have been particularly successful as a concise method for simulating plants. Creating L-systems to simulate a given plant manually by experts is limited by the availability of experts and time. This paper introduces the Plant Model Inference Tool (PMIT) that infers deterministic context-free L-systems from an initial sequence of strings generated by the system using a genetic algorithm. PMIT is able to infer more complex systems than existing approaches. Indeed, while existing approaches can infer D0L-Systems where the sum of production successors is 20, PMIT can infer those where the sum is 140. This was validated using a testbed of 28 known D0L-system models, in addition to models created artificially by bootstrapping larger models.

This research was supported in part by a grant from the Plant Phenotyping and Imaging Research Centre.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Lindenmayer, A.: Mathematical models for cellular interaction in development, parts I and II. J. Theor. Biol. 18, 280–315 (1968)

    Article  Google Scholar 

  2. Prusinkiewicz, P., Lindenmayer, A.: The Algorithmic Beauty of Plants. Springer, New York (1990). https://doi.org/10.1007/978-1-4613-8476-2

    Book  MATH  Google Scholar 

  3. University of Calgary: Algorithmic Botany

    Google Scholar 

  4. Allen, M.T., Prusinkiewicz, P., DeJong, T.M.: Using L-systems for modeling source-sink interactions, architecture and physiology of growing trees: the L-PEACH model. New Phytol. 166(3), 869–880 (2005)

    Article  Google Scholar 

  5. Prusinkiewicz, P., Crawford, S., Smith, R., Ljung, K., Bennet, T., Ongaro, V., Leyser, O.: Control of bud activation by an auxin transport switch. Proc. Nat. Acad. Sci. 106(41), 17431–17436 (2009)

    Article  Google Scholar 

  6. Nakano, R., Yamada, N.: Number theory-based induction of deterministic context-free L-system grammar. In: International Conference on Knowledge Discovery and Information Retrieval, pp. 194–199. SCITEPRESS (2010)

    Google Scholar 

  7. Runqiang, B., Chen, P., Burrage, K., Hanan, J., Room, P., Belward, J.: Derivation of L-system models from measurements of biological branching structures using genetic algorithms. In: Hendtlass, T., Ali, M. (eds.) IEA/AIE 2002. LNCS (LNAI), vol. 2358, pp. 514–524. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48035-8_50

    Chapter  Google Scholar 

  8. Prusinkiewicz, P., Mündermann, L., Karwowski, R., Lane, B.: The use of positional information in the modeling of plants. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, pp. 289–300. ACM (2001)

    Google Scholar 

  9. Jacob, C.: Genetic L-system programming: breeding and evolving artificial flowers with Mathematica. In: Proceedings of the First International Mathematica Symposium, pp. 215–222 (1995)

    Google Scholar 

  10. Mock, K.J.: Wildwood: the evolution of L-system plants for virtual environments. In: Proceedings of the 1998 IEEE World Congress on Computational Intelligence, pp. 476–480. IEEE (1998)

    Google Scholar 

  11. Bernard, J., McQuillan, I.: New techniques for inferring L-systems using genetic algorithm (2017). https://arxiv.org/abs/1712.00180

  12. Back, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, Oxford (1996)

    MATH  Google Scholar 

  13. Ben-Naoum, F.: A survey on L-system inference. INFOCOMP J. Comput. Sci. 8(3), 29–39 (2009)

    Google Scholar 

  14. Doucet, P.G.: The syntactic inference problem for DOL-sequences. In: Rozenberg, G., Salomaa, A. (eds.) L Systems. LNCS, vol. 15, pp. 146–161. Springer, Heidelberg (1974). https://doi.org/10.1007/3-540-06867-8_12

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jason Bernard .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bernard, J., McQuillan, I. (2018). New Techniques for Inferring L-systems Using Genetic Algorithm. In: Korošec, P., Melab, N., Talbi, EG. (eds) Bioinspired Optimization Methods and Their Applications. BIOMA 2018. Lecture Notes in Computer Science(), vol 10835. Springer, Cham. https://doi.org/10.1007/978-3-319-91641-5_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-91641-5_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-91640-8

  • Online ISBN: 978-3-319-91641-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics