Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

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

From MaRDI portal
Publication:1617399
Jump to:navigation, search

DOI10.1007/s10601-018-9288-3zbMath1402.90102OpenAlexW2804731818MaRDI QIDQ1617399

Chang Liu, Margarita P. Castro, Kyle E. C. Booth, Tony T. Tran, Michael Morin, 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

optimizationconstraint programmingmixed-integer linear programmingpursuit-evasionmobile roboticsgraph-clear problem


Mathematics Subject Classification ID

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



Uses Software

  • NetworkX


Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • An annotated bibliography on guaranteed graph searching
  • A language and a program for stating and solving combinatorial problems
  • Searching and pebbling
  • Uniform random sampling of planar graphs in linear time


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1617399&oldid=13921196"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 03:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki