Accommodating Plan Revisions with Multiple Agents for Local Search in Road Networks

Published: Jul 1, 2018
Abstract
In planning operations involving searching all nodes in a networks, one is interested in determining an optimal search. Optimal searches aim to use all available agents to find the quickest allocations and paths to search all nodes. However, problems arise when an agent is dropped during the search process; for example in a search and rescue mission an Unmanned Aerial Vehicle (UAV) might be tasked to stay at a location after finding survivors...
Paper Details
Title
Accommodating Plan Revisions with Multiple Agents for Local Search in Road Networks
Published Date
Jul 1, 2018
Journal
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.