Dynamic vehicle routing with limited communications

PDF

Authors
  1. Pike, D.
Corporate Authors
Defence R&D Canada - Ottawa, Ottawa ONT (CAN);Royal Military Coll of Canada, Kingston ONT (CAN)
Abstract
Unmanned vehicles are becoming essential platforms for dangerous and difficult tasks reducing the risk for humans. The biggest challenges involve guaranteed mission success despite degraded mission critical hardware and communications networks. The multiple Dynamic Travelling Repairmen Problem (m-DTRP) has applications for unmanned vehicles for search and rescue applications, exploration applications as well as combat scenarios. The m-DTRP has been studied extensively in literature for theoretical scenarios but solutions lack application in mobile robotics applications with impractical communications assumptions. We propose the development of an algorithm for the m-DTRP that relies on local demand and position information and local communications ability to collaborate with other agents to optimize routes. The algorithm uses the transmission of target points with expected service times for agents to decide which demands to take on locally. We expect to observe lower bounds on the number of agents required for system time to converge based on target generation rate and environment area. We expect the algorithm to be a platform for diverse environments with heterogeneous swarms of agents.

Il y a un résumé en français ici.

Report Number
DRDC-OTTAWA-CR-2011-184 — Contractor Report
Date of publication
01 Dec 2011
Number of Pages
30
DSTKIM No
CA037031
CANDIS No
536677
Format(s):
Electronic Document(PDF)

Permanent link

Document 1 of 1

Date modified: