Intruder alert! Optimization models for solving the mobile robot graph-clear problem

DOI10.1007/S10601-018-9288-3MaRDI QIDQ1617399zbMATH OpenOpenAlexFDO

Authors Michael Morin, Margarita P. Castro, Kyle E. C. Booth, Tony T. Tran, Chang Liu, J. Christopher Beck

Publication date 8 November 2018

Published in Constraints (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/1807/87983

zbMATH Keywords

constraint programminggraph-clear problemmixed-integer linear programmingmobile roboticsoptimizationpursuit-evasion

Mathematics Subject Classification ID

Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Positional games (pursuit and evasion, etc.) (91A24)

Recommendations

• Integer programming models and algorithms for the graph decontamination problem with mobile agents
• A graph search algorithm for indoor pursuit/evasion
• Clearing an orthogonal polygon to find the evaders
• scientific article; zbMATH DE number 5996845
• Graph-based algorithms for the efficient solution of optimization problems involving monotone functions

Cites work

• A language and a program for stating and solving combinatorial problems
• An annotated bibliography on guaranteed graph searching
• scientific article; zbMATH DE number 3590298 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1871404 (Why is no real title available?)
• Searching and pebbling
• Uniform random sampling of planar graphs in linear time

Cited in

(1)

• Domain-independent dynamic programming

Describes a project that uses

Uses Software

• NetworkX

This page was built for publication: Intruder alert! Optimization models for solving the mobile robot graph-clear problem

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