Multi-UAV Monitoring with Priorities and Limited Energy Resources

This paper introduces a monitoring problem with limited energy resources and soft constraints on priorities employing a fleet of unmanned aerial vehicles (UAVs). This monitoring problem is a generalization of application cases ranging from surveillance of open-air events to monitoring crime scenes or disaster sites. In order to compute solutions, we propose an insertion heuristic with a negotiation mechanism for energy resources. The solution quality of the heuristic method is compared to cases where an optimal solution is known resulting in an average deviation of approximately 4%. By using this approach, we are able to plan routes for real-world scenarios which are currently unsolvable by general problem solvers in acceptable time. Moreover, the run-time is within seconds for such scenarios. Therefore, the method can be applied to dynamic environments, where re-planning during the mission is required.

[1]  Peter Stone,et al.  A multi-robot system for continuous area sweeping tasks , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[2]  Nathan Michael,et al.  Multi-robot persistent surveillance planning as a Vehicle Routing Problem , 2011, 2011 IEEE International Conference on Automation Science and Engineering.

[3]  Nicholas R. Jennings,et al.  Near-optimal continuous patrolling with teams of mobile information gathering agents , 2013, Artif. Intell..

[4]  Alexis Drogoul,et al.  Multi-agent Patrolling: An Empirical Analysis of Alternative Architectures , 2002, MABS.

[5]  Daniela Rus,et al.  Multi-robot monitoring in dynamic environments with guaranteed currency of observations , 2010, 49th IEEE Conference on Decision and Control (CDC).

[6]  Yann Chevaleyre,et al.  Recent Advances on Multi-agent Patrolling , 2004, SBIA.

[7]  Noa Agmon,et al.  Multi-robot area patrol under frequency constraints , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[8]  Amal El Fallah Seghrouchni,et al.  Working as a Team: Using Social Criteria in the Timed Patrolling Problem , 2012, 2012 IEEE 24th International Conference on Tools with Artificial Intelligence.

[9]  Gerhard Friedrich,et al.  Variable Neighborhood Search for Continuous Monitoring Problem with Inter-Depot Routes , 2013, KI.

[10]  Daniela Rus,et al.  Persistent monitoring of events with stochastic arrivals at multiple stations , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[11]  Emilio Frazzoli,et al.  Persistent patrol with limited-range on-board sensors , 2010, 49th IEEE Conference on Decision and Control (CDC).

[12]  Daniela Favaretto,et al.  Ant colony system for a VRP with multiple time windows and multiple visits , 2007 .

[13]  Bernhard Rinner,et al.  Networked UAVs as aerial sensor network for disaster management applications , 2010, Elektrotech. Informationstechnik.

[14]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[15]  Giorgio Cannata,et al.  A Minimalist Algorithm for Multirobot Continuous Coverage , 2011, IEEE Transactions on Robotics.

[16]  Yeong-Dae Kim,et al.  Heuristics for determining a patrol path of an unmanned combat vehicle , 2012, Comput. Ind. Eng..

[17]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..

[18]  Bohdana Ratitch,et al.  Multi-agent patrolling with reinforcement learning , 2004, Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, 2004. AAMAS 2004..

[19]  Gerhard Friedrich,et al.  Routing for Continuous Monitoring by Multiple Micro AVs in Disaster Scenarios , 2012, ECAI.

[20]  Anouck Girard,et al.  Persistent Visitation with Fuel Constraints , 2012 .