Skip to main content

AutoDrone: Shortest Optimized Obstacle-Free Path Planning for Autonomous Drones

  • Conference paper
  • First Online:
Proceedings of International Conference on Computational Intelligence, Data Science and Cloud Computing

Part of the book series: Algorithms for Intelligent Systems ((AIS))

  • 243 Accesses

Abstract

With technological advancement, drone has emerged as unmanned aerial vehicle that can be controlled by humans to fly or reach a destination. This may be autonomous as well, where the drone itself is intelligent enough to find the shortest obstacle-free path to reach the destination from a designated source. Be it a planned smart city or even a wreckage site affected by natural calamity, we may imagine the buildings, any surface-erected structure or other blockage as obstacles for the drone to fly in a straight line-of-sight path. To address such path-planning of drones, the bird’s-eye view of the whole landscape is first transformed into a graph of grid cells, where some are occupied to indicate the obstacles and some are free to indicate the free path. We propose a method to find out the shortest obstacle-free path in the coordinate system guided by GPS. The autonomous drone (AutoDrone) will thus be able to move from one place to another along the shortest path, without colliding into hindrances, while traveling in a two-dimensional space. Heuristics to extend this to long journeys and 3D space are also elaborated. Our approach can be especially beneficial in rescue operations and fast delivery or pickup in an energy-efficient way, where our algorithm will help in finding out the shortest path and angle along which it should fly. Experiments are done on different scenarios of map layouts and obstacle positions to understand the shortest feasible route, computed by the autonomous drone.

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

Access this chapter

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

References

  1. Cauchard JR, Jane LE, Zhai KY, Landay JA (2015) Drone & me: an exploration into natural human-drone interaction. In: Proceedings of the 2015 ACM international joint conference on pervasive and ubiquitous computing, pp 361–365

    Google Scholar 

  2. Bounceur A, Bezoui M, Euler R (2018) Boundaries and hulls of euclidean graphs: from theory to practice. CRC Press

    Google Scholar 

  3. Jana D (2014) C++ and object-oriented programming paradigm. PHI Learning Pvt Ltd

    Google Scholar 

  4. Deo N (2017) Graph theory with applications to engineering and computer science. Courier Dover Publications

    Google Scholar 

  5. Gallo G, Pallottino S (1988) Shortest path algorithms. Ann Oper Res 13(1):1–79

    Article  MathSciNet  Google Scholar 

  6. Johnson DB (1973) A note on Dijkstra’s shortest path algorithm. J ACM (JACM) 20(3):385–388

    Article  MathSciNet  Google Scholar 

  7. Sulaiman OK, Siregar AM, Nasution K, Haramaini T (2018) Bellman Ford algorithm—in routing information protocol (RIP). J Phys Conf Ser 1007:012009

    Google Scholar 

  8. Burfield C (2013) Floyd-Warshall algorithm. Massachusetts Institute of Technology

    Google Scholar 

  9. Chen JC (2003) Dijkstra’s shortest path algorithm. J Formalized Math 15(9):237–247

    Google Scholar 

  10. Chai D, Newsam S, Huang J (2020) Aerial image semantic segmentation using DCNN predicted distance maps. ISPRS J Photogramm Remote Sens 161:309–322

    Article  Google Scholar 

  11. Mukherjee A, Jana P, Chakraborty S, Saha SK (2020) Two stage semantic segmentation by SEEDS and fork net. In: 2020 IEEE Calcutta conference (CALCON). IEEE, pp 283–287

    Google Scholar 

  12. Chakrabarty A, Stepanyan V, Krishnakumar KS, Ippolito CA (2019) Real-time path planning for multi-copters flying in UTM-TCL4. In: AIAA Scitech 2019 forum, p 0958

    Google Scholar 

  13. Jana P (2020) Shortest path traversal by autonomous vehicles and drones in euclidean space. In: Young scientists’ conference (YSC) at 6th India International Science Festival (IISF), Govt. of India. IISF-GoI

    Google Scholar 

  14. Koch T, Körner M, Fraundorfer F (2019) Automatic and semantically-aware 3D UAV flight planning for image-based 3D reconstruction. Remote Sens 11(13):1550

    Article  Google Scholar 

  15. Sakurai M, Ueno Y, Kondo M (2021) Path planning and moving obstacle avoidance with neuromorphic computing. In: 2021 IEEE international conference on intelligence and safety for robotics (ISR). IEEE, pp 209–215

    Google Scholar 

  16. Wu G, Shao X, Guo Z, Chen Q, Yuan W, Shi X, Xu Y, Shibasaki R (2018) Automatic building segmentation of aerial imagery using multi-constraint fully convolutional networks. Remote Sens 10(3):407

    Article  Google Scholar 

  17. Kirillov A, He K, Girshick R, Rother C, DollĂ¡r P (2019) Panoptic segmentation. In: Proceedings of the IEEE/CVF conference on computer vision and pattern recognition, pp 9404–9413

    Google Scholar 

  18. Jana P, Ghosh S, Sarkar R, Nasipuri M (2017) A fuzzy C-means based approach towards efficient document image binarization. In: Proceedings of the 9th international conference on advances in pattern recognition (ICAPR). IEEE, pp 332–337

    Google Scholar 

  19. Jana P, Ghosh S, Bera SK, Sarkar R (2017) Handwritten document image binarization: an adaptive K-means based approach. In: 2017 IEEE Calcutta conference (CALCON). IEEE, pp 226–230

    Google Scholar 

  20. Rajagopal A, Stier N, Nelson W, Chandrasekaran S, Brown AP (2020) DeepOSM-3D: recognition in aerial LiDAR RGBD imagery. In: Geospatial informatics X, vol 11398. International Society for Optics and Photonics

    Google Scholar 

  21. Parajuli B, Kumar P, Mukherjee T, Pasiliao E, Jambawalikar S (2018) Fusion of aerial LiDAR and images for road segmentation with deep CNN. In: Proceedings of the 26th ACM SIGSPATIAL international conference on advances in geographic information systems, pp 548–551

    Google Scholar 

  22. Zhou H, Qi L, Wan Z, Huang H, Yang X (2020) RGB-D co-attention network for semantic segmentation. In: Proceedings of the Asian conference on computer vision (2020)

    Google Scholar 

  23. Jana P, Bhaumik S, Mohanta PP (2021) Unsupervised action localization crop in video retargeting for 3D ConvNets. In: 2021 IEEE region 10 conference (TENCON). IEEE

    Google Scholar 

  24. Yang L, Qi J, Xiao J, Yong X (2014) A literature review of UAV 3D path planning. In: Proceeding of the 11th world congress on intelligent control and automation. IEEE, pp 2376–2381

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Prithwish Jana .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jana, P., Jana, D. (2022). AutoDrone: Shortest Optimized Obstacle-Free Path Planning for Autonomous Drones. In: Mandal, L., Tavares, J.M.R.S., Balas, V.E. (eds) Proceedings of International Conference on Computational Intelligence, Data Science and Cloud Computing. Algorithms for Intelligent Systems. Springer, Singapore. https://doi.org/10.1007/978-981-19-1657-1_1

Download citation

Publish with us

Policies and ethics