Pour savoir comment effectuer et gérer un dépôt de document, consultez le « Guide abrégé – Dépôt de documents » sur le site Web de la Bibliothèque. Pour toute question, écrivez à corpus@ulaval.ca.
 

Personne :
Morin, Michael

En cours de chargement...
Photo de profil

Adresse électronique

Date de naissance

Projets de recherche

Structures organisationnelles

Fonction

Nom de famille

Morin

Prénom

Michael

Affiliation

Université Laval. Département d'opérations et systèmes de décision

ISNI

ORCID

Identifiant Canadiana

ncf11859154

person.page.name

Résultats de recherche

Voici les éléments 1 - 1 sur 1
  • PublicationAccès libre
    Intruder alert! Optimization models for solving the mobile robot graph-clear problem
    (Kluwer Academic Publishers, 2018-05-21) Morin, Michael; Castro, Margarita P.; Booth, Kyle E. C.; Tran, Tony T.; Liu, Chang; Beck, J. Christopher
    We develop optimization approaches to the graph-clear problem, a pursuit-evasion problem where mobile robots must clear a facility of intruders. The objective is to minimize the number of robots required. We contribute new formal results on progressive and contiguous assumptions and their impact on algorithm completeness. We present mixed-integer linear programming and constraint programming models, as well as new heuristic variants for the problem, comparing them to previously proposed heuristics. Our empirical work indicates that our heuristic variants improve on those from the literature, that constraint programming finds better solutions than the heuristics in run-times reasonable for the application, and that mixed-integer linear programming is superior for proving optimality. Given their performance and the appeal of the model-and-solve framework, we conclude that the proposed optimization methods are currently the most suitable for the graph-clear problem.