Skip to main content
Log in

Robot path planning by genetic programming

  • Original Article
  • Published:
Artificial Life and Robotics Aims and scope Submit manuscript

Abstract

This paper describes a method to determine the path of a robot that travels around between machine tools in a production line FA factory. This decision is made by the genetic algorithm with Lisp language programming. In the algorithm, the building block method to decide fitness is adopted. The method is applied to a flexible manufacturing system (FMS) that has four machine tools and a robot.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Goldberg DE (1989) Genetic algorithm in search, optimization and machine learning. Addison-Wesley, Reading

    Google Scholar 

  2. Valeckenaers P, et al. (1994) IMS test case 5. Holonic manufacturing systems. Preprints of IMS'94 2nd IFAC/IFIP/IFROS Workshop

  3. Kavraki L, Latombe J (1994) Randomized preprocessing of configuration space for fast path planning. Proceedings of the 1994 IEEE International Conference on Robotics and Automation, pp. 2138–2145

  4. Yamamoto H (1995) Simulator of flexible transfer line including genetic algorithm and its applications to buffer capacity. Preprints of IMS'95 3rd IFAC/IFIP/IFROS Workshop, pp 127–132

  5. Koza JR (1994) Genetic programming. MIT Press, Cambridge

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to H. Yamamoto.

About this article

Cite this article

Yamamoto, H. Robot path planning by genetic programming. Artificial Life and Robotics 2, 28–32 (1998). https://doi.org/10.1007/BF02471149

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02471149

Key words

Navigation