Skip to main content

Efficient Graph Matching with Application to Cognitive Automation

  • Conference paper
Book cover Applications of Graph Transformations with Industrial Relevance (AGTIVE 2007)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 5088))

Abstract

Cognitive automation has proven to be an applicable approach to handle increasing complexity in automation. Although fielded prototypes have already been demonstrated, the real time performance of the underlying software framework COSA is currently a limiting factor with respect to a further increase of the application complexity. In this paper we describe a cognitive framework with increased performance for the use in cognitive systems for vehicle guidance automation tasks. It uses a combination of several existing graph transformation algorithms and techniques. We show, that for our approach, the incremental rule matching that we propose yields a performance gain over the non-incremental algorithm and a large increase over the existing generic cognitive framework COSA for a typical application.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Billings, C.E.: Human centered automation: A concept and guidelines (1991)

    Google Scholar 

  2. Bunke, H., Glauser, T., Tran, T.-H.: An efficient implementation of graph grammar based on the RETE-matching algorithm. In: Ehrig, H., Kreowski, H.-J., Rozenberg, G. (eds.) Graph Grammars 1990. LNCS, vol. 532. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  3. Doorenbos, R.B.: Combining Left and Right Unlinking for Matching a Large Number of Learned Rules. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA (1994)

    Google Scholar 

  4. Dörr, H.: Efficient Graph Rewriting and Its Implementation. LNCS, vol. 922. Springer, Heidelberg (1995)

    MATH  Google Scholar 

  5. Ermel, C., Rudolf, M., Taentzer, G.: The AGG-approach: Language and tool environment. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) Handbook on Graph Grammars and Computing by Graph Transformation, vol. 2. World Scientific, Singapore (1999)

    Google Scholar 

  6. Fischer, T., Niere, J., Torunski, L.: Story diagrams: A new graph rewrite language based on the unified modeling language. In: Ehrig, H., Engels, G., Kreowski, H.-J., Rozenberg, G. (eds.) TAGT 1998. LNCS, vol. 1764, pp. 296–309. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Forgy, C.L.: RETE: A fast algorithm for the many pattern/many object match problem. Arificial Intelligence (1982)

    Google Scholar 

  8. Habel, A., Heckel, H., Taentzer, G.: Graph grammars with negative application conditions. Fundamenta Informaticae 26(3/4), 287–313 (1996)

    MathSciNet  MATH  Google Scholar 

  9. Hudson, S.E.: Incremental attribute evaluation: an algorithm for lazy evaluation in graphs. Technical Report, 87-20, University of Arizona (1987)

    Google Scholar 

  10. Kriegel, M., Meitinger, C., Schulte, A.: Operator assistance and semi-autonomous functions as key elements of future systems for multiple UAV guidance. In: 7th Conference on Engineering Psychology and Cognitive Ergonomics, in conjunction with HCI International, Beijing, China (2007)

    Google Scholar 

  11. Laird, J.E., Newell, A., Rosenbloom, P.S.: Soar: An architecture for general intelligence. Arificial Intelligence 33, 1–64 (1987)

    Article  Google Scholar 

  12. Larrosa, J., Valiente, G.: Graph pattern matching using constraint satisfaction. In: International Workshop on Graph Transformation, Berlin, pp. 189–196 (2000)

    Google Scholar 

  13. McGregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Information Sciences 19, 229–250 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  14. Meitinger, C., Schulte, A.: Cognitive machine co-operation as basis for guidance of multiple UAVs. In: NATO RTO HFM Symposium on Human Factors of Uninhabited Military Vehicles as Force Multipliers, Biarritz, France (2006)

    Google Scholar 

  15. Meitinger, C., Schulte, A.: Human-centered automation for UAV guidance: Oxymoron of tautology? The potential of cognitive and co-operative systems. In: 1st Moving Autonomy Forward Conference, Grantham, UK (2006)

    Google Scholar 

  16. Messmer, B.T.: Efficient Graph Matching Algorithms for Preprocessed Model Graphs. PhD thesis, Universität Bern (1995)

    Google Scholar 

  17. Miranker, D.P.: TREAT: A better match algorithm for AI production systems. In: AAAI 1987 Sixth National Conference on Artificial Intelligence, Los Altos, CA, vol. 1, pp. 42–47 (1987)

    Google Scholar 

  18. Platts, J.T.: Final report of the GARTEUR flight mechanics (FM) AG-14. Autonomy in UAVs (in press, 2007)

    Google Scholar 

  19. Putzer, H., Onken, R.: COSA - a generic cognitive system architecture based on a cognitive model of human behavior. In: 8th European Conference on Cognitive Science Approaches to Process Control CSAPC 2001, Universität der Bundeswehr, München (2001)

    Google Scholar 

  20. Varró, G., Varró, D., Schürr, A.: Incremental graph pattern matching. Electronic Communications of the EASST: Graph and Model Transformation 2006 4 (2006)

    Google Scholar 

  21. Wiener, E.L.: Human Factors in Aviation. Academic Press, San Diego (1993)

    Google Scholar 

  22. Zündorf, A.: Graph pattern matching in PROGRES. In: Cuny, J., Engels, G., Ehrig, H., Rozenberg, G. (eds.) Graph Grammars 1994. LNCS, vol. 1073, pp. 454–468. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matzner, A., Minas, M., Schulte, A. (2008). Efficient Graph Matching with Application to Cognitive Automation. In: Schürr, A., Nagl, M., Zündorf, A. (eds) Applications of Graph Transformations with Industrial Relevance. AGTIVE 2007. Lecture Notes in Computer Science, vol 5088. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89020-1_21

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89020-1_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89019-5

  • Online ISBN: 978-3-540-89020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics