Skip to main content
SpringerLink
Log in

Algorithms for Routing Problems Involving UAVs

  • Chapter
Innovations in Intelligent Machines - 1

Part of the book series: Studies in Computational Intelligence ((SCI,volume 70))

Routing problems naturally arise in several civil and military applications involving Unmanned Aerial Vehicles (UAVs) with fuel and motion constraints. A typical routing problem requires a team of UAVs to visit a collection of targets with an objective of minimizing the total distance travelled. In this chapter, we consider a class of routing problems and review the classical results and the recent developments available to address the same.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Vazirani, V.V., 2001. Approximation algorithms, Springer

    Google Scholar 

  2. Papadimitriou, C.H., Steiglitz, K., 1998. Combinatorial optimization: algo-rithms and complexity, Dover publications

    Google Scholar 

  3. Christofides, N., 1976. Worst-case analysis of a new heuristic for the travelling salesman problem. In: J.F. Traub (Editor), Algorithms and Complexity: New Directions and Recent Results, Academic Press, pp. 441

    Google Scholar 

  4. Arora, S., 1996. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. Proceedings of the 37th Annual Symposium on the Foundations of Computer Science, pp. 2-11

    Google Scholar 

  5. Held, M., Karp, R.M., 1970. The traveling salesman problem and minimum spanning trees. Operations Research 18, pp. 1138-1162

    Article  MathSciNet  Google Scholar 

  6. Held, M., Karp, R.M., 1971. The travelling salesman problem and minimum spanning trees: Part II. Mathematical Programming 18, pp. 6-25

    Article  MathSciNet  Google Scholar 

  7. Gutin, G., Punnen, A.P. (Editors), 2002. The travelling salesman problem and its variations. Kluwer Academic Publishers

    Google Scholar 

  8. Bektas, T., 2006. The Multiple Traveling Salesman Problem: an Overview of Formulations and Solution Procedures. OMEGA: The International Journal of Management Science, 34(3), 209-219

    Article  Google Scholar 

  9. Bellmore, M., Hong, S., 1977. A note on the symmetric multiple travelling salesman problem with fixed charges. Operations Research 25, pp. 871-874

    Article  MathSciNet  Google Scholar 

  10. Rao, M.R., 1980. A note on multiple travelling salesmen problem. Operations Research 28(3), pp. 628-632

    Article  Google Scholar 

  11. GuoXing, Y., 1995. Transformation of multidepot multisalesmen problem to the standard traveling salesman problem. European Journal of Operations Research 81, pp. 557-560

    Article  Google Scholar 

  12. Rathinam, S. and Sengupta, R., 2006. Lower and upper bounds for a symmet-ric, multiple depot, multiple travelling salesman problem. Submitted to IEEE conference on Decision and Control

    Google Scholar 

  13. Darbha, S., 2005. Combinatorial motion planning of reed-shepp vehicles, Final Report, American Society for Engineering Education (ASEE)\ Airforce Office of Scientific Research(AFOSR), Summer Faculty Program, Air Force Research Laboratory, Eglin, Florida

    Google Scholar 

  14. Gavish, B., Srikanth, K., 1986. An optimal solution method for the multiple travelling salesman problem. Operations Research 34(5), pp. 698-717

    Article  MathSciNet  Google Scholar 

  15. Chandler, P.R., Pachter, 1998. m., Research issues in autonomous control of tactical UAVs. American Control Conference, pp. 394-398

    Google Scholar 

  16. Chandler, P.R., Rasmussen, S.R., Pachter, M., 2000. UAV cooperative path planning. Proceedings of the GNC, pp.1255-1265

    Google Scholar 

  17. Chandler, P.R., Pachter, M., 2001. Hierarchical control of autonomous control of tactical UAVs. Proceedings of GNC, pp. 632-642

    Google Scholar 

  18. .Chandler, P.R., Rasmussen, S.R., Pachter, M., 2001. UAV cooperative control. American Control Conference

    Google Scholar 

  19. Schumacher, C., Chandler, P.R., Rasmussen, S.R., 2001. Task allocation for wide area search munitions via network flow optimization. AIAA Guidance, Navigation, and Control Conference and Exhibit, Montreal, Canada

    Google Scholar 

  20. Chandler, P.R., Pachter, M., Swaroop, D., Fowler, J.M., Howlett, J.K., Rasmussen, S.R., Schumacher, C., Nygard, K., 2002. Complexity in UAV coop-erative control. Proceedings of the American Control Conference, Anchorage, Arkansas

    Google Scholar 

  21. Maddula, T., Minai, A.A., Polycarpou, M.M., 2002. Multi-target assign- ment and path planning for groups of UAVs. S. Butenko, R. Murphey, and P. Pardalos (Eds.), Kluwer Academic Publishers

    Google Scholar 

  22. Richards, A., Bellingham, J., Tillerson, M., How, J. P., 2002. Co-ordination and control of multiple UAVs. AIAA Guidance, Navigation, and Control Con-ference

    Google Scholar 

  23. Alighanbari, M., Kuwata, Y., How, J.P., 2003. Coordination and control of multiple UAVs with timing constraints and loitering. Proceeding of the IEEE American Control Conference

    Google Scholar 

  24. Darbha, S., 2001. Teaming Strategies for a resource allocation and coordination problem in the cooperative control of UAVs. AFRL Summer Faculty Report, Dayton, Ohio

    Google Scholar 

  25. Yang, G., Kapila, V., 2002. Optimal path planning for unmanned air vehicles with kinematic and tactical constraints. Proceedings of the 41st IEEE Confer-ence Decision and Control 2, pp. 1301-1306

    Article  Google Scholar 

  26. Savla, K., Frazzoli, E., Bullo, F., 2005. On the point-to-point and travel-ing salesperson problems for Dubin’s vehicle. American Control Conference, Portland, Oregan

    Google Scholar 

  27. Ny, J.L., Feron, E., 2005. An approximation algorithm for the curvature con-strained traveling salesman problem. Proceedings of the 43rd Annual Allerton Conference on Communications, Control and Computing

    Google Scholar 

  28. Frieze, A., Galbiati, G., Maffioli, F., 1982. On the worst-case performance of some algorithms for the asymmetric traveling salesman problem. Networks 12, pp. 23-39

    Article  MathSciNet  Google Scholar 

  29. Rathinam, S., Sengupta, R., Swaroop, D., 2005. A resource allocation algorithm for multi vehicle systems with non-holonomic constraints. Accepted in IEEE Transactions on Automation Science and Engineering

    Google Scholar 

  30. Tang, Z., Ozguner, U., 2005. Motion planning for multi-target surveillance with mobile sensor agents. IEEE Transactions of Robotics

    Google Scholar 

  31. Beard, R., Mclain, T., Goodrich, M., Anderson, E., 2002. Coordinated target assignment and intercept for unmanned air vehicles. IEEE Transactions on Robotics and Automation 18(6), pp. 911-922

    Article  Google Scholar 

  32. Mclain, T., Beard, R., 2003. Cooperative path planning for timing critical missions. Proceedings of the American Control Conference, Denver, Colorado

    Google Scholar 

  33. Dubins, L.E., 1957. 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), pp. 487-516

    Article  MathSciNet  Google Scholar 

  34. Lagoudakis, M. G., Markakis, E., Kempe, D. , Keskinocak, P., Kleywegt, A., Koenig, S., Tovey, C., Meyerson, A., and Jain, S., June 2005. Auction-Based Multi-Robot Routing. Proceedings of Robotics: Science and Systems I, Cam-bridge, USA

    Google Scholar 

  35. Hochbaum, S., July 1996. Approximation Algorithms for NP-Hard Problems

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of California, Berkeley

    Sivakumar Rathinam & Raja Sengupta

Authors
  1. Sivakumar Rathinam
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Raja Sengupta
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Defence Science and Technology Organisation, Edinburgh, South Australia, Australia

    Javaan Singh Chahl

  2. University of South Australia Mawson Lakes Campus, Adelaide, South Australia, Australia

    Lakhmi C. Jain

  3. Odonatrix Pty Ltd., Adelaide, South Australia, Australia

    Akiko Mizutani

  4. University of Tsukuba, Japan

    Mika Sato-Ilic

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Rathinam, S., Sengupta, R. (2007). Algorithms for Routing Problems Involving UAVs. In: Chahl, J.S., Jain, L.C., Mizutani, A., Sato-Ilic, M. (eds) Innovations in Intelligent Machines - 1. Studies in Computational Intelligence, vol 70. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72696-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72696-8_6

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72695-1

  • Online ISBN: 978-3-540-72696-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation