Scheduling an autonomous robot searching for hidden targets

DOI10.1007/s10479-019-03141-1zbMath1462.90047OpenAlexW2922308911WikidataQ128219129 ScholiaQ128219129MaRDI QIDQ829171

N. E. Zubov

Publication date: 5 May 2021

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-019-03141-1

zbMATH Keywords

scheduling algorithmemergency evacuationintelligent robotsearch-and-rescue

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Optimal discrete search with imperfect specificity
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Using multiple searchers in constrained-path, moving-target search problems
• Infinite-horizon scheduling algorithms for optimal search for hidden objects
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling an autonomous robot searching for hidden targets