Skip to main content

Robot Path Planning for Human Search in Indoor Environments

  • Conference paper
  • First Online:
  • 2002 Accesses

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 710))

Abstract

Aiming at the problem of a mobile robot searching human in home environments, a gird model is built and a path planning method based on a modified genetic algorithm and an improved A* algorithm is proposed. First, the grid map is divided into several unit regions using Boustrophedon cellular decomposition. Then, a unit region planning method based on a genetic algorithm is applied to generate a region transition sequence, and an effective strategy to search every region is adjusted according to the robot’s sensors. Meanwhile, the optimal path between two points is generated by an improved A* algorithm, so that the path is much shorter and the number of turns is greatly reduced. Finally, the simulation results verify that this method can provide an optimized path in known home environments effectively, based on that the robot can find human in the shortest possible time.

This work was supported by the National Natural Science Foundation of China under Grant 61328302, and it is also supported by the National Science Foundation (NSF) Grant CISE/IIS 1231671 and CISE/IIS 1427345, the Open Research Project of the State Key Laboratory of Industrial Control Technology, Zhejiang University, China (No. ICT1600217).

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

Buying options

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

Learn about institutional subscriptions

References

  1. Souligma, M.: Feasible and optimal path planning in strong current field. IEEE Trans. Robot. 27, 89–98 (2011)

    Article  Google Scholar 

  2. Acar, E.U., Choset, H., Lee, J.Y.: Sensor-based coverage with extended range detectors. IEEE Trans. Robot. 22, 189–198 (2006)

    Article  Google Scholar 

  3. Acar, E.U., Choset, H., Zhang, Y.G., et al.: Path planning for robotic demining: robust sensor-based coverage of unstructured environments and probabilistic methods. Int. J. Robot. Res. 22, 441–466 (2003)

    Article  Google Scholar 

  4. Jin, X., Ray, A.: Navigation of autonomous vehicles for oil spill cleaning in dynamic and uncertain environments. Int. J. Control 87, 787–801 (2014)

    Article  MATH  Google Scholar 

  5. Tapus, A., Mataric, M.J., Scassellati, B.: The grand challenges in socially assistive robotics. IEEE Robot. Autom. Mag. Spec. Issue Grand Challenges Robot. 14, 1–7 (2007)

    Google Scholar 

  6. Dillow, C.: Children’s Hospital Boston Sends Telepresence Robots Home With Post-Op Patients (2013). http://www.popsci.com/technology/article/2011-12/childrens-hospital-boston-sends-telepresence-robots-post-op-patient-care

  7. Desai, M., Tsui, K.M., Yanco, H.A., Uhlik, C.: Essential features of telepresence robots. In: 2011 IEEE Conference on Technologies for Practical Robot Applications, pp. 15–20 (2011)

    Google Scholar 

  8. Li, Y., Liu, M., Sheng, W.: Indoor human tracking and state estimation by fusing environmental sensors and wearable sensors. In: 2015 IEEE International Conference on Cyber Technology in Automation, Control, and Intelligent Systems (CYBER), pp. 1468–1473 (2015)

    Google Scholar 

  9. Choset, H., Pignon, P.: Coverage path planning: the boustrophedon cellular decomposition. In: Zelinsky, A. (ed.) Field and Service Robotics, pp. 203–209. Springer, London (1998)

    Chapter  Google Scholar 

  10. Arumugam, R., et al.: DAvinCi: a cloud computing framework for service robots. In: 2010 IEEE International Conference on Robotics and Automation, pp. 3084–3089 (2010)

    Google Scholar 

  11. Homaifar, A., Guan, S., Liepins, G.E.: Schema analysis of the traveling salesman problem using genetic algorithms. Complex Syst. 6, 183–217 (1992)

    MathSciNet  MATH  Google Scholar 

  12. Zhu, L., Fan, J., Zhao, J., et al.: Global path planning and local obstacle avoidance of searching robot in mine disasters based on grid method. J. Cent. South Univ. (Sci. Technol.) 42, 3421–3428 (2011)

    Google Scholar 

  13. Grefenstette, J.J., Gopal, R., Rosmaita, B., et al.: Genetic algorithm for TSP. In: Proceedings of the First International Conference on Genetic Algorithms and their Applications, pp. 160–168 (1985)

    Google Scholar 

  14. Lixin, T.: Improved Genetic Algorithms for TSP. J. Northeast. Univ. (Nat. Sci.) 20 (1999)

    Google Scholar 

  15. Yap, P.: Grid-based path-finding. In: Cohen, R., Spencer, B. (eds.) AI 2002. LNCS, vol. 2338, pp. 44–55. Springer, Heidelberg (2002). doi:10.1007/3-540-47922-8_4

    Chapter  Google Scholar 

  16. Xin, Y., Liang, H.W., Du, M.B., et al.: An improved A* algorithm for searching infinite neighbourhoods. Robot 36, 627–633 (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Meiqin Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Tang, Y., Liu, M., Sheng, W., Zhang, S. (2017). Robot Path Planning for Human Search in Indoor Environments. In: Sun, F., Liu, H., Hu, D. (eds) Cognitive Systems and Signal Processing. ICCSIP 2016. Communications in Computer and Information Science, vol 710. Springer, Singapore. https://doi.org/10.1007/978-981-10-5230-9_32

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-5230-9_32

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-5229-3

  • Online ISBN: 978-981-10-5230-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics