Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Pursuit and Evasion in Polygonal Environments - A Mixed Integer Linear Programming Approach.
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
KTH, School of Engineering Sciences (SCI), Mathematics (Dept.), Optimization and Systems Theory.
2011 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This report addresses improvements to an already existent model of a Pursuit-and-Evasion

problem. The model is formulated using Mixed Integer Linear Programming (MILP).

The computation time of the original model is first thoroughly examined by solving for

increasingly large areas, and with a varying number of pursuers. Some improvements to

the model are suggested for shortening the computation time. Finally, a new model is

suggested with the aims of being more realistic and to address an issue in the original

model that meant that pursuers must not share tiles (i.e they must stay separated at all

times).

Abstract [sv]

Denna rapport introducerar förbättringar till en existerande modell av ett Pursuit-And-

Evasion problem. Modellen är formulerad med hjälp av Mixed Integer Linear Programming

(MILP). Först testas lösningstiden för originalmodellen utförligt på större och större

områden, och med olika antal sökare. Några förbättringar föreslås för att förkorta beräkningstiden,

och sedan föreslås även en helt ny modell. Syftet med den nya modellen är

att den ska vara mer realistisk, och dessutom så försöker den åtgärda ett problem i originalmodellen

som gör att sökare inte får stå för nära varandra.

Place, publisher, year, edition, pages
2011. , 35 p.
National Category
Engineering and Technology
Identifiers
URN: urn:nbn:se:kth:diva-105763OAI: oai:DiVA.org:kth-105763DiVA: diva2:572007
Uppsok
Technology
Supervisors
Available from: 2012-11-26 Created: 2012-11-26 Last updated: 2013-02-18Bibliographically approved

Open Access in DiVA

Richard Hermansson, Erik Peldan kandidatex(802 kB)94 downloads
File information
File name FULLTEXT01.pdfFile size 802 kBChecksum SHA-512
fb266f2fc820833c599e6aa28ff8154efd8348d3adce6edc86c698f83956d768f3cc17b74c56a085b95756938125b472ff27c0f4ea46076bbb3679e94b853eda
Type fulltextMimetype application/pdf

By organisation
Optimization and Systems Theory
Engineering and Technology

Search outside of DiVA

GoogleGoogle Scholar
Total: 94 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

urn-nbn

Altmetric score

urn-nbn
Total: 141 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf