Skip to main content

Using a Hybrid Evolutionary-A* Approach for Learning Reactive Behaviours

  • Conference paper
  • First Online:
Book cover Real-World Applications of Evolutionary Computing (EvoWorkshops 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1803))

Included in the following conference series:

Abstract

A hybrid approach for learning reactive behaviours is presented in this work. This approach is based on combining evolutionary algorithms (EAs) with the A* algorithm. Such combination is done within the framework of Dynastically Optimal Forma Recombination, and tries to exploit the positive features of EAs and A* (e.g., implicit parallelism, accuracy and use of domain knowledge) while avoiding their potential drawbacks (e.g., premature convergence and combinatorial explosion). The resulting hybrid algorithm is shown to provide better results, both in terms of quality and in terms of generalisation.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. Ali and A. Goel. Combining navigational planning and reactive control. In Theories of Action, Planning, and Robot Control. Bridging the Gap: Proceedings of the 1996 AAAI Workshop, pages 1–9, Menlo Park, CA, 1996. AAAI Press.

    Google Scholar 

  2. C.T.C. Arsene and A.M.S. Zalzala. Control of autonomous robots using fuzzy logic controllers tuned by genetic algorithms. In Proceedings of the 1999 Congress on Evolutionary Computation, pages 428–435. IEEE NNC-EP Society-IEE, 1999.

    Google Scholar 

  3. T.D. Barfoot and D’Eleuterio G.M.T. An evolutionary approach to multiagent heap formation. In Proceedings of the 1999 Congress on Evolutionary Computation, pages 420–427. IEEE NNC-EP Society-IEE, 1999.

    Google Scholar 

  4. C. Cotta, E. Alba, and J.M. Troya. Utilising dynastically optimal forma recombination in hybrid genetic algorithms. In A.E. Eiben, Th. Bäck, M. Schoenauer, and H.-P. Schwefel, editors, Parallel Problem Solving From Nature V, volume 1498 of Lecture Notes in Computer Science, pages 305–314. Springer-Verlag, Berlin, 1998.

    Chapter  Google Scholar 

  5. C. Cotta and J.M. Troya. Tackling epistatic problems using dynastically optimal recombination. In B. Reusch, editor, Computational Intelligence. Theory and Applications, volume 1625 of Lecture Notes in Computer Science, pages 197–205. Springer-Verlag, Berlin Heidelberg, 1999.

    Google Scholar 

  6. L. Davis. Handbook of Genetic Algorithms. Van Nostrand Reinhold Computer Library, New York, 1991.

    Google Scholar 

  7. J.-Y. Donnart and J.-A. Meyer. Learning reactive and planning rules in a motivationally autonomous animat. IEEE Transactions on Systems, Man, and Cybernetics, 26(3):381–195, 1996.

    Article  Google Scholar 

  8. F. Hoffmann and G. Pfister. Learning of a fuzzy control rule base using messy genetic algorithms. In F. Herrera and J.L. Verdegay, editors, Genetic Algorithms and Soft Computing, pages 279–305. Physica-Verlag, Heidelberg, 1996.

    Google Scholar 

  9. J.R. Koza. Genetic Programming. MIT Press, Cambridge MA, 1992.

    MATH  Google Scholar 

  10. N.J. Radcliffe. The algebra of genetic algorithms. Annals of Mathematics and Artificial Intelligence, 10:339–384, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  11. A.C. Schultz and J.J. Grefenstette. Using a genetic algorithm to learn behaviours for autonomous vehicles. In Proceedings of the AIAA Guidance, Navigation and Control Conference, pages 739–749, Hilton Head SC, 1992.

    Google Scholar 

  12. C. Thornton. Learning where to go without knowing where that is: the acquisition of a non-reactive mobot behaviour by explicitation. Technical Report CSRP-361, School of Cognitive and Computing Sciences, University of Sussex, 1994.

    Google Scholar 

  13. G. Weiss. Multiagents Systems: a Modern Approach to Distributed Artificial Intelligence. The MIT Press, Cambridge MA, 1999.

    Google Scholar 

  14. D.H. Wolpert and W.G. Macready. No free lunch theorems for search. Technical Report SFI-TR-95-02-010, Santa Fe Institute, 1995.

    Google Scholar 

  15. B. Yamauchi and R. Beer. Integrating reactive, sequential and learning behaviour using dynamical neural networks. In D. Cliff, P. Husbands, J.-A. Meyer, and S. Wilson, editors, From Animals to Animats 3: Proceedings of the Third International Conference on Simulation of Adaptive Behaviour, pages 382–391, Cambridge MA, 1994. MIT Press/Bradford Books.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cotta, C., Troya, J.M. (2000). Using a Hybrid Evolutionary-A* Approach for Learning Reactive Behaviours. In: Cagnoni, S. (eds) Real-World Applications of Evolutionary Computing. EvoWorkshops 2000. Lecture Notes in Computer Science, vol 1803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45561-2_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-45561-2_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67353-8

  • Online ISBN: 978-3-540-45561-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics