Skip to main content

Coordinated Road Network Search for Multiple UAVs Using Dubins Path

  • Conference paper

Abstract

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.

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   169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   219.99
Price excludes VAT (USA)
  • Durable hardcover 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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Gibbons, A.: Algorithmic Graph Theory. Cambridge University Press, Cambridge (1999)

    Google Scholar 

  2. Ahr, D.: Contributions to Multiple Postmen Problems. PhD thesis, Heidelberg University (2004)

    Google Scholar 

  3. Gross, J.L., Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton (2003)

    Book  Google Scholar 

  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. 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. 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)

    Article  Google Scholar 

  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. 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. 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)

    MATH  Google Scholar 

  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. Salva, K., Frazzoli, E., Bullo, F.: Traveling salesperson problems for the dubins vehicle. IEEE Trans. on Automatic Control 53(6), 1378–1391 (2008)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  MathSciNet  MATH  Google Scholar 

  15. http://maps.google.co.uk/maps

  16. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM Journal on Computing 7, 178–193 (1978)

    Article  MathSciNet  Google Scholar 

  17. Edmonds, J., Johnson, E.L.: Matching, euler tours, and the chinese postman. Mathematical Programming 5, 88–124 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  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)

    Article  Google Scholar 

  19. http://www.coin-or.org/SYMPHONY

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Oh, H., Shin, H.S., Tsourdos, A., White, B.A., Silson, P. (2011). Coordinated Road Network Search for Multiple UAVs Using Dubins Path. In: Holzapfel, F., Theil, S. (eds) Advances in Aerospace Guidance, Navigation and Control. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19817-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-19817-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-19816-8

  • Online ISBN: 978-3-642-19817-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics