Scheduling an autonomous robot searching for hidden targets

DOI10.1007/S10479-019-03141-1MaRDI QIDQ829171zbMATH OpenOpenAlexWikidataFDO

Authors 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

emergency evacuationintelligent robotscheduling algorithmsearch-and-rescue

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1129405
• A stochastic optimization approach for robot scheduling
• Optimal robot scheduling for web search engines
• Infinite-horizon scheduling algorithms for optimal search for hidden objects
• scientific article; zbMATH DE number 1594557
• scientific article; zbMATH DE number 7295087

Cites work

• scientific article; zbMATH DE number 4209901 (Why is no real title available?)
• scientific article; zbMATH DE number 3357742 (Why is no real title available?)
• Infinite-horizon scheduling algorithms for optimal search for hidden objects
• 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

Cited in

(2)

• Autonomous search for mines
• Honey-pot constrained searching with local sensory information

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829171)