Abstract
In the paper a branch-and-bound algorithm for solving shortest paths problem in a large-scale terrain-based grid network, especially designed for multiresolution movement planning and simulation is discussed. The new approach deals with a specific method for merging the geographically adjacent nodes (squares) and the planning path to a “merged” graph. The merging is done by using geographically adjacent squares of primary graph (thus, we obtain nodes of a “merged” graph) and calculating costs in the “merged” graph as longest (or shortest) of the shortest paths between some subsets of nodes belonging to “merged” nodes. The properties of the algorithm are discussed and proved. Moreover, some remarks on how to parallelize and apply the presented algorithm for finding multiresolution shortest paths are proposed.
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
Ahuja, R.K., Mehlhorn, K., Orlin, J.B., Tarjan, R.E.: Faster algorithms for the shortest path problem. Technical report 193, MIT Operations Research Center (1988)
Behnke, S.: Local Multiresolution Path Planning. In: Polani, D., Browning, B., Bonarini, A., Yoshida, K. (eds.) RoboCup 2003. LNCS (LNAI), vol. 3020, pp. 332–343. Springer, Heidelberg (2004)
Yu-Li, C., Romeijn, E., Smith, R.: Approximating Shortest Paths in Large-scale Networks with an Application to Intelligent Transportation Systems. Journal on Computing 10(2), 163–179 (1998)
Djidjev, H., Pantziou, G., Zaroliagis, C.D.: On-line and dynamic algorithms for shortest path problems. In: Mayr, E.W., Puech, C. (eds.) STACS 1995. LNCS, vol. 900, pp. 193–204. Springer, Heidelberg (1995)
Fredman, M.L., Tarjan, R.E.: Fibonacci heaps and their uses in improved network optimization algorithms. Journal of the Association for Computing Machinery 34, 596–615 (1987)
Gabow, H.N., Tarjan, R.E.: Faster scaling algorithms for network problems. SIAM Journal on Computing 18, 1013–1036 (1989)
Grama, A., Gupta, A., Karypis, G., Kumar, V.: Introduction to Parallel Computing, 2nd edn. Addison-Wesley, Reading (2003)
Johnson, D.B.: Efficient algorithm for shortest paths in sparse networks. Journal of the ACM 24, 1–13 (1977)
Kambhampati, S., Davis, L.S.: Multiresolution Path Planning for Mobile Robots. IEEE Journal of Robotics and Automation RA-2(3), 135–145 (1986)
Korf, R.E.: Artificial intelligence search algorithms. In: Algorithms Theory Computation Handbook. CRC Press, Boca Raton (1999)
Lavalle, S.: Planning algorithms. Cambridge University Press, Cambridge (2006)
Pai, D.K., Reissell, L.M.: Multiresolution Rough Terrain Motion Planning. IEEE Transactions on Robotics and Automation I, 19–33 (1998)
Petty, M.D.: Computer generated forces in Distributed Interactive Simulation. In: Proceedings of the Conference on Distributed Interactive Simulation Systems for Simulation and Training in the Aerospace Environment, The International Society for Optical Engineering, Orlando, USA, April 19-20, pp. 251–280 (1995)
Tarapata, Z.: Military route planning in battlefield simulation: effectiveness problems and potential solutions. Journal of Telecommunications and Information Technology 4, 47–56 (2003)
Tarapata, Z.: Decomposition algorithm for finding shortest paths in grid networks of large size. In: Proceedings of the 15th International Conference on Systems Science, Wroclaw, Poland, September 7-10, vol. III, pp. 209–216 (2004)
Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, Pennsylvania (1983)
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
Tarapata, Z. (2010). Multiresolution Models and Algorithms of Movement Planning and Their Application for Multiresolution Battlefield Simulation. In: Nguyen, N.T., Le, M.T., Świątek, J. (eds) Intelligent Information and Database Systems. ACIIDS 2010. Lecture Notes in Computer Science(), vol 5991. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12101-2_39
Download citation
DOI: https://doi.org/10.1007/978-3-642-12101-2_39
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12100-5
Online ISBN: 978-3-642-12101-2
eBook Packages: Computer ScienceComputer Science (R0)