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
Crowding through narrow spaces
KTH, School of Computer Science and Communication (CSC).
2013 (English)Independent thesis Basic level (degree of Bachelor), 10 credits / 15 HE creditsStudent thesis
Abstract [en]

This report compares two steering behavior algorithms in

crowded path following. Both steering and path following

could be a part of a flocking simulation. The report is

divided into two parts, one introductory part which explains

what a flocking simulation is, what the goal of the report is

and what methodology is used to acquire that goal. The

introductory part is followed by the concepts part. In the

concepts part there will be an extensive explanation of the

path following algorithm used as it’s a core function. A

solid understanding will aid the conviction that excluding

certain common behaviors are legitimate for the purpose of

comparing the two steering algorithms. There’s also

sections for other behaviors such as steering and separation.

In conclusion either of the steering algorithms

1 could be

used in a very crowded path traversal simulation.

This report was made independently and without

collaboration.

Abstract [sv]

Denna rapport jamfor tva styrningsbeteendes-algoritmer da

man foljer en vag. Bade styrningsebeteendet och beteendet

att folja en vag kan vara en del av en flocksimulation.

Denna rapport ar uppdelad i tva delar. Den ena ar en

introduktionsdel som forklarar vad en flocksimulation ar,

vad rapportens mal ar och vad for metod som anvands for

att komma fram till malet. Introduktionsdelen foljs av en

konceptdel. I konceptdelen finns en omfattande forklaring

av folja-vag-algoritmen. En solid forstaelse for algoritmen

kommer att assistera overtygelsen om att det ar legitimt att

exkludera vissa vanliga beteenden for syftet att jamfora tva

styrningsalgoritmer. Det finns ocksa sektioner for andra

beteenden som styrning och separation. Resultatet av

testerna tyder pa att bada styrningsalgoritmerna kan

anvandas.

Denna rapport gjordes sjalvstandigt utan samarbete.

Place, publisher, year, edition, pages
2013.
Series
Kandidatexjobb CSC, K13028
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-134942OAI: oai:DiVA.org:kth-134942DiVA: diva2:668818
Educational program
Master of Science in Engineering - Computer Science and Technology
Supervisors
Examiners
Available from: 2013-12-13 Created: 2013-12-02 Last updated: 2013-12-13Bibliographically approved

Open Access in DiVA

Crowding through narrow spaces(238 kB)17 downloads
File information
File name FULLTEXT01.pdfFile size 238 kBChecksum SHA-512
8d9b9f27c2ce3460cb6d3d87fb05c1a4f39f72d715cc6378063ffe0300e50dcc2333e200fa00c5b2ef417a4e422cf6e95697dbd53f2c40d6b0f71a49abf9547c
Type fulltextMimetype application/pdf

By organisation
School of Computer Science and Communication (CSC)
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
Total: 17 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: 56 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