DOI QR코드

DOI QR Code

Design and Implementation of a friendly maze program for early childhood based on a path searching algorithm

  • Yun, Unil (Dept. of Computer Engineering, Sejong University) ;
  • Yu, Eun Mi (Dept. of Infantile Education, Baekseok Art University)
  • Received : 2017.01.07
  • Accepted : 2017.06.07
  • Published : 2017.06.30

Abstract

Robots, games and life applications have been developed while computer areas are developed. Moreover, various applications have been utilized for various users including the early childhood. Recently, smart phones have been dramatically used by various users including early childhood. Many applications need to find a path from a starting point to destinations. For example, without using real maps, users can find the direct paths for the destinations in realtime. Specifically, path exploration in game programs is so important to have accurate results. Nowadays, with these techniques, diverse applications for educations of early childhood have been developed. To deal with the functions, necessity of efficient path search programs with high accuracy becomes much higher. In this paper, we design and develop a friendly maze program for early childhood based on a path searching algorithm. Basically, the path of lineal distance from a starting location to destination is considered. Moreover, weight values are calculated by considering heuristic weighted h(x). In our approach, A* algorithm searches the path considering weight values. Moreover, we utilize depth first search approach instead of breadth first search in order to reduce the search space. so it is proper to use A* algorithm in finding efficient paths although it is not optimized paths.

Keywords

References

  1. Hart, P. E., Nilsson, N. J., & Raphael, B. (1968). A formal basis for the heuristic determination of minimum cost paths. Systems Science and Cybernetics, IEEE Transactions on, 4(2), 100-107. https://doi.org/10.1109/TSSC.1968.300136
  2. Dijkstra, E. W. (1959). A note on two problems in connection with graphs. Numerische mathematik, 1(1), 269-271. https://doi.org/10.1007/BF01386390
  3. AlShawi, I. S., Yan, L., Pan, W., & Luo, B. (2012). Lifetime enhancement in wireless sensor networks using fuzzy approach and A-star algorithm. Sensors Journal, IEEE, 12(10), 3010-3018. https://doi.org/10.1109/JSEN.2012.2207950
  4. H. Kim, K. Kim (2013). Post Processing Algorithm Proposal of Platform Game Artificial Intelligence for A* Path Planning Application. KIISE conference, 643-645.
  5. S. Lee (2004). Units' Path-finding Method Proposal for A* Algorithm in the Tilemap. KSCI, 9(3), 71-77.
  6. G. Song, J. Lee (2012). Path Generation for Autonomous Vehicle using A* Algorithm. ICROS, 125-126.
  7. J. Kim, D. Jo (2010). VTA* Algorithm. KIICE, 14(3), 663-668.
  8. S. Lee, G. Lee, B. Hwang, W. Jung (2002). Modified Bidirectional A* Algorithm for Optimal Car Route Guidance Search. Korea Society For Internet Information, conference, 3(1), 42-45.
  9. B. Ha , S. Kim (2012). A* Algorithm for Optimal Intra-bay Container Pre-marshalling Plan. Journal of the Korean Institute of Industrial Engineers, 38(2), 157-172. https://doi.org/10.7232/JKIIE.2012.38.2.157
  10. S. Han (2013). Implementation of Active Location Detecting System using A-Star Algorithm. KIITORKR, 11(11), 133-140.
  11. J. Go, S. Park (2013). AGV Integrated System Using A-Star Algorithm in Random Space. KIITORKR, 11(12), 227-235.
  12. H. Jo, D. Kim, J. Lee, J. Park (2010). Implementation of Active Location Detecting System In 3D. KIISE conference, 37(1), 157-172.
  13. Cheng LP, Liu CX, Yan B, Improved hierarchical A-star algorithm for optimal parking path planning of the large parking lot. In: 2014 IEEE international conference on information and automation, 2016, pp. 695- 698.
  14. Akshay Kumar Guruji, Himansh Agarwal, D.K. Parsediya, Time-efficient A* Algorithm for Robot Path Planning, 3rd International Conference on Innovations in Automation and Mechatronics Engineering 2016, ICIAME 2016, pp. 144-14