Autonomous search for mines

DOI10.1016/S0377-2217(97)00373-1zbMATH Open0952.93092OpenAlexW2044871439WikidataQ56992353 ScholiaQ56992353MaRDI QIDQ1296038FDOQ1296038

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

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

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)

Cites Work

• Title not available (Why is that?)

Cited In (7)

• Surface mining: main research issues for autonomous operations
• G-NETWORKS AND THEIR APPLICATIONS TO MACHINE LEARNING, ENERGY PACKET NETWORKS AND ROUTING: INTRODUCTION TO THE SPECIAL ISSUE
• 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
• FESTSCHRIFT FOR EROL GELENBE'S 70TH BIRTHDAY
• 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)