Skip to main content
SpringerLink
Log in

Labyrinth Arrangement Analysis Based on Image Processing

  • Conference paper
  • First Online:
Mendel 2015 (ICSC-MENDEL 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 378))

Included in the following conference series:

Abstract

The approach described in this paper has been developed as a supporting tool for practical exercises based on a teaching aid; however, its application is far from being limited to be used only in the education process. The main task of the approach is extraction of information about structure of a working environment from color images and its transformation to an appropriate form suitable for path-planning. The working environment considered in this paper is a labyrinth. Since the information is to be used further by path-planning, its expression in the form of a graph is required, or, more precisely, the adjacency matrix is required as the output. The transformation of the real world into a discreet representation is based on the exact cell decomposition in this approach. The approach employs the well-known image processing algorithms; however, the procedure of the labyrinth layout analysis as well as the transformation of the acquired information into the adjacency matrix has been developed and tested in this work. The approach has been realized and verified in MATLAB using the Image Processing Toolbox.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Cruz-Martín, A., Fernández-Madrigal, J.A., Galindo, C., González-Jiménez, J., Stockmans-Daou, C., Blanco, J.L.: A LEGO Mindstorms NXT approach for teaching at data acquisition, control systems engineering and real-time systems undergraduate courses. Comput. Educ. 59(3), 974–988 (2012)

    Article  Google Scholar 

  2. Cuéllar, M.P., Pegalajar, M.C.: Design and implementation of intelligent systems with LEGO Mindstorms for undergraduate computer engineers. Comput. Appl. Eng. Educ. 22(1), 153–166 (2014)

    Article  Google Scholar 

  3. Diestel, R.: Graph Theory, Graduate texts in mathematics, vol. 173, 4th edn. Springer (2012)

    Google Scholar 

  4. Gonzalez, R., Woods, R.E., Eddins, S.: Digital Image Processing Using MATLAB. Prentice-Hall, Inc. (2003)

    Google Scholar 

  5. Gonzalez, R., Woods, R.: Digital Image Processing, 3rd edn. Pearson Prentice Hall (2009)

    Google Scholar 

  6. Inanc, T., Dinh, H.: A low-cost autonomous mobile robotics experiment: control, vision, sonar, and handy board. Comput. Appl. Eng. Educ. 20(2), 203–213 (2012)

    Article  Google Scholar 

  7. Inc., T.M.: Matlab 2013b, Image Processing Toolbox. 3 Apple Hill Drive, Natick (2013). http://www.mathworks.com/help/images/

  8. Jara, C.A., Candelas, F.A., Puente, S.T., Torres, F.: Hands-on experiences of undergraduate students in automatics and robotics using a virtual and remote laboratory. Comput. Educ. 57(4), 2451–2461 (2011)

    Article  Google Scholar 

  9. Khatib, O.: Real-time obstacle avoidance for manipulators and mobile robots. Int. J. Robot. Res. 5(1), 90–98 (1986)

    Article  MathSciNet  Google Scholar 

  10. Kulich, M., Chudoba, J., Košnar, K., Krajník, T., Faigl, J., Přeučil, L.: SyRoTek - distance teaching of mobile robotics. IEEE Trans. Educ. 56(1), 18–23 (2013)

    Article  Google Scholar 

  11. Siegwart, R., Nourbakhsh, I.: Introduction to Autonomous Mobile Robots. Bradford Book (2004)

    Google Scholar 

  12. Škrabánek, P.: Time efficient graph version of the A* algorithm optimized for matlab. In: Proceedings of Mendel 2014: 20th International Conference on Soft Computing, pp. 299–304 (2014)

    Google Scholar 

Download references

Acknowledgments

I would like to offer my special thanks to the government of India as well as to the ambassador of India in Czech Republic, mr. Shri Ashok Venkatesan and to the first secretary of the embassy, mr. Somnath Chatterjee, for the support of my studies about image processing at the Indian Institute of Remote Sensing in Dehradun via the ITEC scholarship. The knowledge gained within the studies was very helpful for the solving of the problem described in the paper.

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering and Informatics, University of Pardubice, Studentská 95, 532 10, Pardubice, Czech Republic

    Pavel Škrabánek

Authors
  1. Pavel Škrabánek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pavel Škrabánek .

Editor information

Editors and Affiliations

  1. Faculty of Mechanical Engineering, Department of Applied Computer Science, Brno University of Technology, Brno, Czech Republic

    Radek Matoušek

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Škrabánek, P. (2015). Labyrinth Arrangement Analysis Based on Image Processing. In: Matoušek, R. (eds) Mendel 2015. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 378. Springer, Cham. https://doi.org/10.1007/978-3-319-19824-8_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19824-8_25

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19823-1

  • Online ISBN: 978-3-319-19824-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation