Skip to main content

Buildable Objects Revisited

  • Conference paper
  • 1719 Accesses

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

Abstract

Funes and Pollack introduced the The buildable objects experiments where \(\textsc{lego}^\circledR\) structures are evolved that may carry loads. This paper re-evaluates and extends the approach. We propose a new evaluation scheme using maximum network flow algorithms and a graph representation. The obtained structures excel previous results. Furthermore, we are now able to address problems that require more than one bearing.

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

Buying options

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 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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cherkassky, B.V., Goldberg, A.V.: On implementing the push-relabel method for the maximum flow problem. Algorithmica 19, 390–410 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  2. Devert, A., Bredeche, N., Schoenauer, M.: Evolution design of buildable objects with blind builder: an empirical study. In: Pham, T.L., Le, H.K., Nguyen, X.H. (eds.) Proc. of the Third Asian-Pacific Workshop on Genetic Programming, pp. 98–109. Military Technical Academy, Hanoi (2006)

    Google Scholar 

  3. Funes, P., Pollack, J.B.: Computer evolution of buildable objects. In: Husbands, P., Harvey, I. (eds.) Fourth European Conf. on Artificial Life, pp. 358–367. MIT Press, Cambridge (1997)

    Google Scholar 

  4. Funes, P., Pollack, J.B.: Computer evolution of buildable objects. In: Bentley, P.J. (ed.) Evolutionary Design by Computers, pp. 387–403. Morgan Kaufmann, San Francisco (1999)

    Google Scholar 

  5. Funes, P.J.: Buildable evolution. SIGEVOlution 2(3), 6–19 (2007)

    Article  Google Scholar 

  6. Globus, A., Lawton, J., Wipke, T.: Automatic molecular design using evolutionary techniques. Tech. Rep. NAS-99-005, NASA Ames Research Center (1999)

    Google Scholar 

  7. Kicinger, R., Arciszewski, T., De Jong, K.A.: Evolutionary computation and structural design: a survey of the state of the art. Computers & Structures 83(23-24), 1943–1978 (2005)

    Article  Google Scholar 

  8. Petrovic, P.: Solving lego brick layout problem using evolutionary algorithms. In: Norsk Informatikkonferanse (NIK 2001), pp. 87–97 (2001)

    Google Scholar 

  9. Waßmann, M.: Physiksimulation und Evolution von LEGO®-Strukturen. Master’s thesis, HTWK Leipzig, Leipzig, Germany (2011)

    Google Scholar 

  10. Waßmann, M., Weicker, K.: Maximum flow networks for stability analysis of LEGO® structures (2012), under submission (ESA 2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Waßmann, M., Weicker, K. (2012). Buildable Objects Revisited. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds) Parallel Problem Solving from Nature - PPSN XII. PPSN 2012. Lecture Notes in Computer Science, vol 7492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32964-7_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32964-7_26

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32963-0

  • Online ISBN: 978-3-642-32964-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics