Aerial-ground vehicle path coordination algorithms for monitoring applications

Kenny Chour; Sivakumar Rathinam; Swaroop Darbha

doi:10.1117/12.2558657

23 April 2020 Aerial-ground vehicle path coordination algorithms for monitoring applications

Kenny Chour, Sivakumar Rathinam, Swaroop Darbha

Proceedings Volume 11413, Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications II; 1141315 (2020) https://doi.org/10.1117/12.2558657
Event: SPIE Defense + Commercial Sensing, 2020, Online Only

Abstract

This study concerns a multi-UAV path planning problem in concert with a known ground vehicle path. The environment is given as a grid map, where each cell is either a target, an obstacle or contains nothing (neutral). Respectively, each cell has a reward that is either positive, negative, or zero. The team of UAVs has to visit as many targets as possible under a given time span or distance constraint, to maximize the collected reward. More formally, this problem is a generalization of the Orienteering Problem (OP) and is NP-Hard. In addition, the inclusion of obstacle avoidance and area coverage introduces additional complications that the current literature has not readily addressed. We propose using a greedy heuristic based on the A* algorithm, which involves three stages (selection, insertion, and post-processing) to solve this problem. A large scale problem instance is generated and the results are presented for different variations of our proposed algorithm. For large problems with thousand of nodes, our algorithm was able to provide a feasible solution to the proposed problem within few minutes of computation time on a standard laptop.

Conference Presentation

Citation Download Citation

Kenny Chour, Sivakumar Rathinam, and Swaroop Darbha "Aerial-ground vehicle path coordination algorithms for monitoring applications", Proc. SPIE 11413, Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications II, 1141315 (23 April 2020); https://doi.org/10.1117/12.2558657

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available