Investigating the benefits of re-optimisation while searching for two immobile entities on a network

DOI10.1504/IJMOR.2009.022875zbMATH Open1176.90266OpenAlexW2110992643MaRDI QIDQ843390FDOQ843390

Authors: Arun Jotshi, Rajan Batta 

Publication date: 12 October 2009

Published in: International Journal of Mathematics in Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijmor.2009.022875

Recommendations

• Search for an immobile entity on a network
• Multiple searchers searching for a randomly distributed immobile target on a unit network
• Optimal search for a moving target with no time information maximizing the expected reward
• scientific article; zbMATH DE number 1750452
• Using multiple searchers in constrained-path, moving-target search problems

zbMATH Keywords

search problemsundirected networkimmobile entitiesre-optimisation

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic network models in operations research (90B10) Search theory (90B40)

Cited In (3)

• Minimizing the average searching time for an object within a graph
• A Multi-Stage Model of Searching for Two Mobile Objects on a Graph
• Search for an immobile entity on a network

This page was built for publication: Investigating the benefits of re-optimisation while searching for two immobile entities on a network

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