Coordinated Road Network Search for Multiple UAVs Using Dubins Path

  • Hyondong Oh
  • H. S. Shin
  • A. Tsourdos
  • B. A. White
  • P. Silson


This paper proposes a coordinated road network search algorithm for multiple heterogeneous unmanned aerial vehicles (UAVs). The road network search problem can be interpreted as the problem to seek minimum-weight postman tours with a graphic representation of the road network. Therefore, the conventional Chinese Postman Problem (CPP) is first presented. We, then, consider physical constraints of UAVs into the search problem, since they cannot be addressed in the typical CPP. This modified search problem is formulated as Multi-choice Multidimensional Knapsack Problem (MMKP), which is to find an optimal solution minimising flight time. The Dubins path planning produces the shortest and flyable paths in consideration of physical constraints, so that the Dubins path is used to calculate the cost function of the modified search problem. The performance of the proposed multiple UAVs road network search algorithm is verified via numerical simulation for a given map.


Road Network Travel Salesman Problem Travel Salesman Problem Search Problem Ground Vehicle 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1999)Google Scholar
  2. 2.
    Ahr, D.: Contributions to Multiple Postmen Problems. PhD thesis, Heidelberg University (2004)Google Scholar
  3. 3.
    Gross, J.L., Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton (2003)CrossRefGoogle Scholar
  4. 4.
    Bektas, T.: The multiple traveling salesman problem: An overview of formulations and solution procedures. The International Journal of Management Science 34(3), 209–219 (2006)Google Scholar
  5. 5.
    Bellingham, J., Tillerson, M., Richards, A., How, J.: Multi-Task Allocation and Path Planning for Cooperating UAVs, Cooperative Control: Models, Applications and Algorithms. Kluwer Academic Publishers, Dordrecht (2003)Google Scholar
  6. 6.
    Jin, Y., Liao, Y., Minai, A., Polycarpou, M.: Balancing search and target response in cooperative unmanned aerial vehicle(uav) teams. IEEE Transactions on Systems, Man, and Cybernetics-Part B: Cybernetics 36(3), 571–587 (2006)CrossRefGoogle Scholar
  7. 7.
    Chandler, P.R., Pachter, M., Swaroop, D., hwlett, J.M., Rasmussen, S., Schumacher, C., Nygard, K.: Compexity in uav cooperation control. In: American Control Conference, Anchorage, AK (2002)Google Scholar
  8. 8.
    Ryan, J., Bailey, T., Moore, J., Carlton, W.: Reactive tabu search in unmanned aerial reconnaissance simulations. In: 30th Conference on Winter Simulation, Washington, DC (1998)Google Scholar
  9. 9.
    Perrier, N., Langevin, A., Campbell, J.F.: A survey of models and algorithms for winter road maintenance. Computers and Operational Research, Part IV: Vehicle Routing and Fleet Sizing for Plowing and Snow Disposal 34, 258–294 (2007)zbMATHGoogle Scholar
  10. 10.
    Easton, K., Burdick, J.: A coverage algorithm for multi-robot boundary inspection. In: IEEE International Conference on Robotics and Automation (2005)Google Scholar
  11. 11.
    Salva, K., Frazzoli, E., Bullo, F.: Traveling salesperson problems for the dubins vehicle. IEEE Trans. on Automatic Control 53(6), 1378–1391 (2008)CrossRefGoogle Scholar
  12. 12.
    Rathinam, S., Sengupta, R., Darbha, S.: A resource allocation algorithm for multi-vehicle systems with non holonomic constraints. IEEE Transactions on Automation Sciences and Engineering 4(1), 98–104 (2007)CrossRefGoogle Scholar
  13. 13.
    Hifi, M., Michrafy, M., Sbihi, A.: A reactive local search-based algorithm for the multiple-choice multi-dimensional knapsack problem. Computational Optimization and Applications 33, 271–285 (2006)MathSciNetzbMATHCrossRefGoogle Scholar
  14. 14.
    Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. American Journal of Mathematics 79(3), 497–516 (1957)MathSciNetzbMATHCrossRefGoogle Scholar
  15. 15.
  16. 16.
    Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM Journal on Computing 7, 178–193 (1978)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Edmonds, J., Johnson, E.L.: Matching, euler tours, and the chinese postman. Mathematical Programming 5, 88–124 (1973)MathSciNetzbMATHCrossRefGoogle Scholar
  18. 18.
    Shanmugavel, M., Tsourdos, A., White, B.A., Zbikowski, R.: Differential geometric path planning of multiple uavs. Journal of Dynamic Systems, Measurement and Control 129, 620–632 (2007)CrossRefGoogle Scholar
  19. 19.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Hyondong Oh
    • 1
  • H. S. Shin
    • 1
  • A. Tsourdos
    • 1
  • B. A. White
    • 1
  • P. Silson
    • 1
  1. 1.Autonomous Systems Group, Department of Informatics and Systems EngineeringCranfield UniversitySwindonUnited Kingdom

Personalised recommendations