Autonomous search for mines

DOI10.1016/S0377-2217(97)00373-1MaRDI QIDQ1296038zbMATH OpenOpenAlexWikidataFDO

Authors Erol Gelenbe, Yonghuan Cao

Publication date 11 January 2001

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0377-2217(97)00373-1

zbMATH Keywords

greedy algorithmsautonomous agentsoptimal strategiesrobotsautonomous searchdemininginfinite horizon algorithmsspatio-temporal distributions

Mathematics Subject Classification ID

Search theory (90B40) Automated systems (robots, etc.) in control theory (93C85)

Recommendations

• DYLEMA: Using walking robots for landmine detection and location
• Scheduling an autonomous robot searching for hidden targets
• Optimal distributed searching in the plane with and without uncertainty
• Searching in the plane
• Sensor planning for elusive targets

Cited in

(7)

• G-networks and their applications to machine learning, energy packet networks and routing: Introduction to the special issue
• Festschrift for Erol Gelenbe's 70th birthday
• Surface mining: main research issues for autonomous operations
• An information roadmap method for robotic sensor path planning
• ENERGY-AWARE NAVIGATION IN LARGE-SCALE EVACUATION USING G-NETWORKS
• DYLEMA: Using walking robots for landmine detection and location
• EROL GELENBE: A CAREER IN MULTI-DISCIPLINARY PROBABILITY MODELS

This page was built for publication: Autonomous search for mines

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