DOI QR코드

DOI QR Code

Efficient Exploration for Room Finding Using Wall-Following based Path Planning

벽추종 경로계획 기반의 효과적인 방 찾기 탐사

  • 박중태 (고려대학교 메카트로닉스 협동과정 대학원) ;
  • 송재복 (고려대학교 기계공학부)
  • Published : 2009.12.01

Abstract

This paper proposes an exploration strategy to efficiently find a specific place in large unknown environments with wall-following based path planning. Many exploration methods proposed so far showed good performance but they focused only on efficient planning for modeling unknown environments. Therefore, to successfully accomplish the room finding task, two additional requirements should be considered. First, suitable path-planning is needed to recognize the room number. Most conventional exploration schemes used the gradient method to extract the optimal path. In these schemes, the paths are extracted in the middle of the free space which is usually far from the wall. If the robot follows such a path, it is not likely to recognize the room number written on the wall because room numbers are usually too small to be recognized by camera image from a distance. Second, the behavior which re-explores the explored area is needed. Even though the robot completes exploration, it is possible that some rooms are not registered in the constructed map for some reasons such as poor recognition performance, occlusion by a human and so on. With this scheme, the robot does not have to visit and model the whole environment. This proposed method is very simple but it guarantees that the robot can find a specific room in most cases. The proposed exploration strategy was verified by various experiments.

Keywords

References

  1. B. Yamauchi, 'A frontier-based approach for autonomous exploration,' Proceedings of the IEEE international conforence on Robotics an Automation, monterey, CA, pp. 146-151, July 1997
  2. A. Makarenko, S. B. Williams, F. Bourgault, H. F. DurrantWhyte, 'An experiment in integrated exploration,' Proceedings of the IEEE International Conforence on Robots and Systems, EPFL, Lausanne, Switzland, vol. 1, pp. 534-539, Oct. 2002
  3. T. B Kwon and J. B. Song, 'Thinning-based topological exploration using position possibility of topological nodes,' International Journal of Advanced Robotics, vol. 22, no. 2-3, pp. 339-359(21),2008 https://doi.org/10.1163/156855308X292619
  4. H. H. Gonzalez-Banos and J.-C. Latombe, 'Navigation strategies for exploring indoor environments,' International Journal of Robotics Research, vol. 21, pp. 829-848, 2004 https://doi.org/10.1177/0278364902021010834
  5. L. Freda and G Oriolo, 'Frontier-based probabilistic strategies for sensor-based exploration,' Proceedings of the IEEE international conference on Robotics and Automation, pp. 3881-3887,2005
  6. http://www.videredesign.com/
  7. http://www.ptgrey.com/
  8. K. Konolige, 'A gradient method for realtime robot control,' Proceedings of the IEEE International Conference on Intelligent Robots and Systems, pp. 639-646, 2000
  9. J. R. Parker, Algorithms for Image Processing and Computer Vision, John Wiley & Sons, pp. 203-218,1998
  10. 권태범, 송재복, '지역 및 전역 환경에 대한 세선화 기반 위상지도의 작성,' 제어${\cdot}$자동화${\cdot}$시스템공학 논문지, vol. 4, no. 7, pp. 693-699, 2006
  11. E. W. Dijkstra, 'A note on two problems in connexion with graphs,' Numerische Mathematik 1,269-271, (1959) https://doi.org/10.1007/BF01386390