Planning for opportunistic surveillance with multiple robots

We are interested in the multiple robot surveillance problem where robots must allocate waypoints to be visited among themselves and plan paths through different waypoints while avoiding obstacles. Furthermore, the robots are allocated specific times to reach their respective goal locations and as a result they have to decide which robots have to visit which waypoints. Such a problem has the challenge of computing the allocation of waypoints across robots, ordering for these waypoints and dynamical feasibility of the paths between waypoints. We present an algorithm that runs a series of graph searches to solve the problem and provide theoretical analysis that our approach yields an optimal solution. We present simulated results as well as experiments on two UAVs that validate the capability of our algorithm. For a single robot, we can solve instances having 10-15 waypoints and for multiple robots, instances having five robots and 10 waypoints can be solved.

[1]  Duc-Cuong Dang,et al.  A Memetic Algorithm for the Team Orienteering Problem , 2008, EvoWorkshops.

[2]  Alain Hertz,et al.  Metaheuristics for the team orienteering problem , 2005, J. Heuristics.

[3]  Michel Gendreau,et al.  An exact algorithm for team orienteering problems , 2007, 4OR.

[4]  Matteo Fischetti,et al.  Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..

[5]  Bruce L. Golden,et al.  A fast and effective heuristic for the orienteering problem , 1996 .

[6]  Dirk Van Oudheusden,et al.  A Path Relinking approach for the Team Orienteering Problem , 2010, Comput. Oper. Res..

[7]  C. Keller.  Algorithms to solve the orienteering problem: A comparison , 1989 .

[8]  Zuren Feng,et al.  Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..

[9]  Michel Gendreau,et al.  A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..

[10]  B. Golden,et al.  A multifaceted heuristic for the orienteering problem , 1988 .

[11]  Mark H. Karwan,et al.  An Optimal Algorithm for the Orienteering Tour Problem , 1992, INFORMS J. Comput..

[12]  Dirk Van Oudheusden,et al.  A guided local search metaheuristic for the team orienteering problem , 2009, Eur. J. Oper. Res..

[13]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[14]  Qiwen Wang,et al.  Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..

[15]  Michel Gendreau,et al.  A branch-and-cut algorithm for the undirected selective traveling salesman problem , 1998, Networks.

[16]  S. Kulturel-Konak,et al.  Meta heuristics for the orienteering problem , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[17]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[18]  R. Vohra,et al.  The Orienteering Problem , 1987 .

[19]  Vijay Kumar,et al.  Multi-agent path planning with multiple tasks and distance constraints , 2010, 2010 IEEE International Conference on Robotics and Automation.

[20]  Gilbert Laporte,et al.  The selective travelling salesman problem , 1990, Discret. Appl. Math..

[21]  Dirk Van Oudheusden,et al.  The orienteering problem: A survey , 2011, Eur. J. Oper. Res..

[22]  I. Kaminer,et al.  Time-Critical Cooperative Control of Multiple Autonomous Vehicles: Robust Distributed Strategies for Path-Following Control and Time-Coordination over Dynamic Communications Networks , 2012, IEEE Control Systems.

[23]  Ram Ramesh,et al.  An efficient four-phase heuristic for the generalized orienteering problem , 1991, Comput. Oper. Res..

[24]  T. Tsiligirides,et al.  Heuristic Methods Applied to Orienteering , 1984 .

[25]  Alonzo Kelly,et al.  Generating near minimal spanning control sets for constrained motion planning in discrete state spaces , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[26]  Tom M. Cavalier,et al.  A heuristic for the multiple tour maximum collection problem , 1994, Comput. Oper. Res..

[27]  Isaac Kaminer,et al.  A Computationally Efficient Approach to Trajectory Management for Coordinated Aerial Surveillance , 2013 .

[28]  M. F. Tasgetiren,et al.  A Genetic Algorithm with an Adaptive Penalty Function for the Orienteering Problem , 2005 .

[29]  Bruce L. Golden,et al.  The team orienteering problem , 1996 .

[30]  Oliver Brock,et al.  Planning Long Dynamically-Feasible Maneuvers for Autonomous Vehicles , 2009 .

[31]  Elise Miller-Hooks,et al.  A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..