Skip to main content
Log in

Multiple UAV exploration of an unknown region

  • Published:
Annals of Mathematics and Artificial Intelligence Aims and scope Submit manuscript

Abstract

In this paper, we present an exploration system for multiple unmanned aerial vehicles (UAVs) navigating through a simulated unknown region that contains obstacles of unknown shape, size, and initial position. The UAVs have to explore and monitor the region continuously. The UAVs have limited sensor and communication ranges and kinematic constraints. The environment may have blind alleys that may cause the UAV to collide with an obstacle. Since the UAVs have limited sensor range, they cannot detect whether the alleys lead to an obstacle or not. Due to the presence of multiple agents and kinematic constraints, the UAVs have to cooperate with each other in selecting their paths, otherwise they may collide with each other. The physical and sensor constraints on the UAVs, coupled with uncertainty in the environment makes the problem of multiple UAVs exploring the unknown region a difficult problem. We developed an exploration system that uses (a) an exploration algorithm to generates safe paths for travel in narrow corridors and (b) a dynamic leader selection scheme to take the presence of multiple agents into account. We also determine the minimum communication range required to ensure no collisions occur inside the narrow corridors. Monte-Carlo simulation were carried out to analyze the effect on area coverage with changes in number of agents, sensor range, and communication range.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Dudek, G., Jenkin, M., Milios, E., Wilkes, D.: A taxonomy for multiagent robotics. Auton. Robots 3(4), 375–397 (1996)

    Google Scholar 

  2. Guzzoni, D., Cheyyer, A., Julia, L., Konolige, K.: Many robots make work short. AI Mag. 18(1), 55–64 (1997)

    Google Scholar 

  3. Choset, H.: Coverage for robotics-A survey of recent results. Ann. Math. Artif. Intell. 31, 113–126 (2001)

    Article  Google Scholar 

  4. Rekleitis, I., Lee-Shue, V., New, A.P., Choset, H.: Limited communication, multi-robot team based coverage. In: Proc. of the IEEE Internation Conference on Robotics and Automation, pp. 3462–3468. New Orleans, LA (2004)

  5. Gabriely, Y., Rimon, E.: Spanning-tree based coverage of continuous areas by a mobile robot. Ann. Math. Artif. Intell. 31(1–4), 77–98 (2001)

    Article  Google Scholar 

  6. Hazon, N., Kaminka, G.A.: Redundancy, efficiency and robustness in multi-robot coverage. In: Proc. of the IEEE International Conference on Robotics and Automation (2005)

  7. Agmon, N., Hazon, N., Kaminka, G.A.: Constructing spanning trees for efficient multi-robot coverage. In: Proc. of IEEE International Conference on Robotics and Automation (2006)

  8. Hazon, N., Mieli, F., Kaminka, G.A.: Towards robust on-line multi-robot coverage. In: Proc. of IEEE International Conference on Robotics and Automation (2006)

  9. Zheng, X., Jain, S., Koenig, S., Kempe, D.: Multi robot forest coverage. In: Proc. of the IEEE/RJS Interational Conference on Intelligent Robots and Systems, pp. 3852–3857. Edmonton, Alberta, Canada (2005)

  10. Even, G., Garg, N., Konemann, J., Ravi, R., Sinha, A.: Min-max tree covers of graphs. Oper. Res. Lett. 32, 309.315 (2004)

    Article  MathSciNet  Google Scholar 

  11. Batalin, M.A., Sukhatme, G.S.: Spreading out: a local approach to multi-robot coverage. In: Proc. of Distributed Autonomous Robotic Systems, pp. 373–382. Fukuoka, Japan (2002)

  12. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robot. Autom. 15(5), 918–933 (1999)

    Article  Google Scholar 

  13. Spires, S.V., Goldsmith, S.Y.: Exhaustive geographic search with mobile robots along space-filling curves. Lect. Notes Comput. Sci. 1456, 1–12 (1998)

    Article  Google Scholar 

  14. Koenig, S., Szymanski, B., Liu, Y.: Efficient and inefficient ant coverage methods. Ann. Math. Artif. Intell. 31, 41–76 (2001)

    Article  Google Scholar 

  15. Balch, T., Arkin, R.C.: Communication in reactive multiagent robotic systems. Auton. Robots 1(1), 27–54 (1994)

    Article  Google Scholar 

  16. Roy, N., Dudek, G.: Collaborative robot exploration and rendezvous: algorithms, performance bounds and observations. Auton. Robots 11(2), 117–136 (2001)

    Article  MATH  Google Scholar 

  17. Zolt, R.M., Stentz, A., Dias, M.B., Thayer, S.: Multi-robot exploration controlled by a market economy. In: Proc. of the IEEE Conference on Robotics and Automation, pp. 3016–3023. (2002)

  18. Yamauchi, B.: Fronteir-based exploration using multiple robots. In: Proc. of the International Conference on Autonomous Agents, pp. 47–53. Minneapolis, Minnesota (1998)

  19. Burgard, W., Moors, M., Stachniss, C., Schneider, F.: Coordinated multi-robot exploration. IEEE Trans. Robot. 21(2), 376–386 (2005)

    Article  Google Scholar 

  20. Polycarpou, M., Yang, Y., Passino, K.: A cooperative search framework for distributed agents. In: Proc. of the IEEE Symposium on Intelligent Control, pp. 1–6. Mexico City, Mexico (2001)

  21. Flint, M., Gaucherand, E.F.A., Polycarpou, M.: cooperative control of UAVs searching risky environments for targets. In: Proc. of the IEEE Conference on Decision and Control, pp. 3568–3572. Maui, Hawaii (2003)

  22. Sujit, P.B., Ghose, D.: Search using multiple UAVs with flight time constraints. IEEE Trans. Aerosp. Electron. Syst. 40(2), 491–509 (2004)

    Article  Google Scholar 

  23. Beard, R.W., McLain, T.W.: Multiple UAV cooperative search under collision aviodance and limited range communication constraints. In: Proc. of the IEEE Conference on Decision and Control, pp. 2543–2548. Maui, Hawaii (2003)

  24. Pongpunwattana, A., Rysdyk, R.: Real-time planning for multiple autonomous vehicles in dynamic uncertain environments. J. Aero. Comput. Inform. Comm. 1, 580–604 (2005)

    Article  Google Scholar 

  25. De Mot, J., Kulkarni, V., Gentry, S., Gavrilets, V., Feron, E.: Coordinated path planning for a UAV cluster. AINS Symposium. Los Angeles, California (2002)

  26. Rubio, J.C., Vagners, J., Rysdyk, R.: Adaptive path planning for autonomous UAV oceanic search missions. In: Proc. of the AIAA Intelligent Systems Technical Conference (2004)

  27. Bertuccelli, L.F., How, J.P.: Search for dynamic targets with uncertain probability maps. In: Proc. of the American Control Conference. Minneapolis, Minnesota (2006)

  28. Schouwenaars, T., How, J.P., Feron, E.: Multi-vehicle path planning for non-line of sight communication. In: Proc. of the American Control Conference. Minneapolis, Minnesota (2006)

  29. Salva, K., Bullo, F., Frazzoli, E.: The coverage problem for loitering dubins vehicles. In: Proc. of the IEEE Conference on Decsion and Control (2007)

  30. Sujit, P.B., Sinha, A., Ghose, D.: Multiple UAV task allocation using team theory. In: Proc. of the IEEE Conference on Decision and Control, pp. 1497–1502. Seville, Spain (2005)

  31. Arsie, A., Frazzoli, E.: Efficient routing of multiple vehicles with no explicit communciations. Int. J. Robust Nonlinear Control 18(2), 154–164 (2007)

    Article  MathSciNet  Google Scholar 

  32. Wagner, I.A., Lindenbaum, M., Bruckstein, A.M.: Distributed covering by ant-robots using evaporating traces. IEEE Trans. Robot. Autom. 15(5), 918–933 (1999)

    Article  Google Scholar 

  33. Saunders, J., Beard, R.: Obstacle avoidance using circular paths. In: Prof of the AIAA Guidance, Navigation and Control Conference and Exhibit, Hilton Head Island, South Carolina, AIAA-2007-6604 (2007)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to P. B. Sujit.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sujit, P.B., Beard, R. Multiple UAV exploration of an unknown region. Ann Math Artif Intell 52, 335–366 (2008). https://doi.org/10.1007/s10472-009-9128-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10472-009-9128-7

Keywords

Mathematics Subject Classifications (2000)

Navigation