Abstract
A layered algorithm of grouping search is proposed for the problem of the route with multiple restrictions based on earthquake rescue. Firstly, rescuers are divided into groups based on search width and then according to the principle of exactly dividing search region; secondly, tasks are assigned based on the principle of balanced region division; finally, the center of each square is regarded as the points in the graph and the search problem is turned into an approximate Hamiltonian problem, in which a path is designed to start from the beginning point and end at the midpoint of one line, the problem that the corners cannot be completely covered is modified with the extended “reentrant search”, and the balance of search time in groups is strengthened with the strategy “halfway conversion”. Thus we can get a search path with the shortest distance and most balanced search time for each person. The route has the search efficiency as high as 95% and can be seen as the optimal approximate solution, which improves previously known results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dai, F.S., Shao, X.H.: The heuristic route algorithm of multiple restrictions based on Quality of Service. In: The Fourth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, harbin. IEEE Xplore Digital Library, vol. 8, pp. 1441–1445 (2008)
Xiao, J.T., Wang, J.: A Type of Variation of Hamilton Path Problem with Applications. In: The 9th International Conference for Young Computer Scientists, pp. 88–93. IEEE Computer Society, New York (2008)
Yang, Y.Q., Tong, Q., Zhan, X.Y.: The best route model of disaster inspection tour. Journal of Sichuan Teachers College (Natural Science) 20, 66–73 (1999)
Qin, S.Y., Gao, S.Z.: Path planning for mobile rescue robots in disaster areas with complex environments. CAAI Transactions on Intelligent Systems 5, 414–420 (2009)
Yin, J.H., Wu, K.Y.: Graph theory and algorithm. Science and Technology of China Press, Hefei (2004)
Wang, Z.Y., Zhang, Q., Dong, Y.F.: The improvement of DNA algorithm to the directed shortest Hamilton path problem. In: IEEE Xplore Digital Library, pp. 241–244 (2009)
Aleksandrov, L., Guo, H., Sack, J.-R.: Algorithms for Approximate Shortest Path Queries on Weighted Polyhedral Surfaces. Discrete Comput. Geom. (2009)
Aleksandrov, L., Maheshwari, A., Sack, J.-R.: Determining approximate shortest paths on weighted polyhedral surfaces. J. ACM 52, 25–53 (2005)
Wu, X.J., Wu, Z.J., Wu, Y.P., Cai, Q., Han, H.: Mathematical model of ground searching. Journal of Jianghan University (Natural Sciences) 37, 19–22 (2009)
Yang, H.F., Tian, Z.W.: On Ground Search Based on Complete Coverage Path Planning. Journal of Hunan First Normal College 9, 159–162 (2009)
Liao, B., Chen, Y., Deng, Y., Lei, Y.J.: Model of Earth Surface Search. Journal of Chongqing Vocational and Technical Institute 17, 114–116 (2008)
Huang, G.A., Deng, W., Lin, H.Y.: Ground search model. Journal of Guilin College of Aerospace Technology, 250–252 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, X. (2010). The Optimization of Route Design for Grouping Search. In: Zhu, R., Zhang, Y., Liu, B., Liu, C. (eds) Information Computing and Applications. ICICA 2010. Communications in Computer and Information Science, vol 105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16336-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-16336-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16335-7
Online ISBN: 978-3-642-16336-4
eBook Packages: Computer ScienceComputer Science (R0)