Two phase solution for an intelligent moving target search problem based on a 0–1 linear model
| hal.structure.identifier | Institut de Mathématiques de Bordeaux [IMB] | |
| hal.structure.identifier | Reformulations based algorithms for Combinatorial Optimization [Realopt] | |
| dc.contributor.author | DETIENNE, Boris | |
| hal.structure.identifier | Laboratoire de Recherche en Informatique [LRI] | |
| dc.contributor.author | QUADRI, Dominique | |
| hal.structure.identifier | Universidade Federal do Ceará = Federal University of Ceará [UFC] | |
| dc.contributor.author | RODRIGUES, Diego Carlos | |
| dc.date.accessioned | 2024-04-04T03:19:40Z | |
| dc.date.available | 2024-04-04T03:19:40Z | |
| dc.date.created | 2014-10-15 | |
| dc.date.issued | 2014-10-15 | |
| dc.identifier.issn | 0020-7543 | |
| dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/194528 | |
| dc.description.abstractEn | This paper presents a generic discrete model for the moving, intelligent target problem. Our objective is to maximise the probability of detection of the moving target with respect to target and searcher’s constraints. The solution method proposed here is composed on two stages. The first one aims at providing a large-scale strategy by solving an Integer Linear Program approach. As a direct solution of this problem is not practically possible, we use a decomposition of the problem into a searcher’s strategy on one side, and the target’s strategy on the other side. A good strategy for the searcher is determined using a sliding window procedure. Concerning the target, our approach consists in simulating some of the target’s possible strategies and considering each of these possibilities as an independent and deterministic entity. The second stage is dedicated to adjusting the large-scale strategy provided by stage 1. Finally, numerical results are presented so as to assess the impact of our approach. | |
| dc.language.iso | en | |
| dc.publisher | Taylor & Francis | |
| dc.subject.en | detecting search problem | |
| dc.subject.en | intelligent moving target | |
| dc.subject.en | Integer Linear Programming | |
| dc.subject.en | Simulation | |
| dc.title.en | Two phase solution for an intelligent moving target search problem based on a 0–1 linear model | |
| dc.type | Article de revue | |
| dc.identifier.doi | 10.1080/00207543.2014.970714 | |
| dc.subject.hal | Informatique [cs]/Mathématique discrète [cs.DM] | |
| bordeaux.journal | International Journal of Production Research | |
| bordeaux.page | 7177-7192 | |
| bordeaux.volume | 52 | |
| bordeaux.hal.laboratories | Institut de Mathématiques de Bordeaux (IMB) - UMR 5251 | * |
| bordeaux.issue | 24 | |
| bordeaux.institution | Université de Bordeaux | |
| bordeaux.institution | Bordeaux INP | |
| bordeaux.institution | CNRS | |
| bordeaux.peerReviewed | oui | |
| hal.identifier | hal-01102172 | |
| hal.version | 1 | |
| hal.popular | non | |
| hal.audience | Internationale | |
| hal.origin.link | https://hal.archives-ouvertes.fr//hal-01102172v1 | |
| bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=International%20Journal%20of%20Production%20Research&rft.date=2014-10-15&rft.volume=52&rft.issue=24&rft.spage=7177-7192&rft.epage=7177-7192&rft.eissn=0020-7543&rft.issn=0020-7543&rft.au=DETIENNE,%20Boris&QUADRI,%20Dominique&RODRIGUES,%20Diego%20Carlos&rft.genre=article |
Fichier(s) constituant ce document
| Fichiers | Taille | Format | Vue |
|---|---|---|---|
|
Il n'y a pas de fichiers associés à ce document. |
|||