Multiple UAVs path planning algorithms: A comparative study

Fuzzy Optimization and Decision Making

Volumn 7, Issue 3, 2008, Pages 257-267

  Sathyaraj, B Moses ^a   Jain, L C ^a   Finn, A ^b   Drake, S ^b  

^a UNIVERSITY OF SOUTH AUSTRALIA   (Australia)

^b DEFENCE SCIENCE AND TECHNOLOGY ORGANISATION   (Australia)

Author keywords

AStar; Dijkstra; Distance vector algorithms; Pathfinding

Indexed keywords

ASTAR; COMPARATIVE STUDIES; COMPUTATION TIME; DIJKSTRA; DIJKSTRA'S ALGORITHMS; DISTANCE VECTOR ALGORITHMS; MULTIPLE UAVS; NUMBER OF NODES; PATH PLANNING; PATH-FINDING ALGORITHMS; PATH-PLANNING ALGORITHMS; PATHFINDING; SEARCH ALGORITHMS; UNMANNED AERIAL VEHICLES;

CHLORINE COMPOUNDS; LEARNING ALGORITHMS; UNMANNED AERIAL VEHICLES (UAV); UNMANNED VEHICLES;

ALGORITHMS;

EID: 49149129451     PISSN: 15684539     EISSN: 15732908     Source Type: Journal    
DOI: 10.1007/s10700-008-9035-0     Document Type: Article

References (21)

1. Cavendish, D., & Gerla, M. (1998). Internet QoS routing using the Bellman-Ford algorithm. In International Conference on High Performance Networking (HPN'98).
2. Chabini, I., & Ganupati, S. (2001). Design and implementation of parallel dynamic shortest path algorithms for intelligent transportation systems applications, Transportation Research Record No. 1771. Washington, DC: National Academy Press.
3. B.V. Cherkassky A.V. Goldberg T. Radzik 1996 Shortest paths algorithms: Theory and experimental evaluation Mathematical Programming 73 2 129 174
4. Z. Cvetanovic C. Nofsinger 1990 Parallel Astar search on message-passing architectures IEEE Computer Society 1 82 90
5. Finn, A., Kabacinski, K., & Drake, S. P. (2007). Design challenges for an autonomous cooperative of UAV's. Defence Science & Technology Organisation, Department of Defence, Australia, IDC 2007.
6. Fu, L. (1996). Real-time vehicle routing and scheduling in dynamic and stochastic traffic networks. Unpublished Ph.D. Dissertation, University of Alberta, Edmonton, Alberta.
7. Gallo G., Pallottino S. (1984). Shortest path methods. In: Florian M. (eds). Transportation planning models. Amsterdam, Elsevier Science Publishers, pp. 227-256
8. Gayraud, T., & Authie, G. (1992). A parallel algorithm for the all pairs shortest path problem. In Proceedings of the International Conference on Parallel Computing.
9. E.P. Hart N.J. Nilsson B. Raphael 1968 A formal basis for the heuristic determination of minimum cost paths IEEE Transaction, System Science and Cybernetics, SSC- 4 2 100 107
10. S.M. Hung J.J. Divoky 1988 A computational study of efficient shortest path algorithms Computers and Operations Research 15 6 567 576
11. R. Jacob M. Marathe K. Nagel 1999 A computational study of routing algorithms for realistic transportation networks Journal of Experimental Algorithmics 4 1 19
12. W.-W. Li 2005 New trends in route guidance algorithm research of intelligent transportation system Journal of Zhejiang University 39 819 824
13. J.J. Murray C.J. Cox G.G. Lendaris R. Saeks 2002 Adaptive dynamic programming IEEE Transactions on Systems, Man and Cybernetics 32 140 153
14. Newell, A., & Simon, H. A. (1972). Human problem solving. Englewood Cliffs, NJ: Prentice-Hall.
15. Nilsson J.N. (1971) Problem-solving methods in artificial intelligence. McGraw-Hill, NewYork
16. Pearl, J. (1984). Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley Publishing Company.
17. Royer, E. M., & Toh, C.-K. (1999). A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications Magazine, April 1999, 46-55.
18. Sathyaraj, B., Chellappa Doss, R. (2005). Route maintenance using mobility prediction for mobile ad hoc networks. IEEE international conference: Mobile adhoc and sensor systems conference, MASS 2005.
19. G.-Z. Tan H. He A. Sloman 2006 Global optimal path planning for mobile robot based on improved Dijkstra algorithm and ant system algorithm Journal of Central South University of Technology 13 80 86
20. V.T. Vuren G.R.M. Jansen 1988 Recent developments in path finding algorithms: A review Transportation Planning and Technology 12 57 71
21. F.B. Zhan C.E. Noon 1998 Shortest path algorithms: An evaluation using real road networks Transportation Science 32 1 65 73