ERA

Download the full-sized PDF of Solving multi-agent pathfinding problems in polynomial time using tree decompositionsDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3M340

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Graduate Studies and Research, Faculty of

Collections

This file is in the following collections:

Theses and Dissertations

Solving multi-agent pathfinding problems in polynomial time using tree decompositions Open Access

Descriptions

Other title
Subject/Keyword
multiagent
polynomial
path planning
pathfinding
algorithm
Type of item
Thesis
Degree grantor
University of Alberta
Author or creator
Khorshid, Mokhtar
Supervisor and department
Holte, Robert (Computing Science)
Sturtevant, Nathan (Computing Science)
Examining committee member and department
Gouglas, Sean (Humanities)
Mueller, Martin (Computing Science)
Department
Department of Computing Science
Specialization

Date accepted
2011-10-02T14:09:23Z
Graduation date
2011-11
Degree
Master of Science
Degree level
Master's
Abstract
Multi-agent pathfinding problems involve finding plans for agents that must travel from their start locations to their targets without colliding. Recent work produced a number of algorithms to solve the problem as well as an ample supply of related theory. This work is based on a related work that studied the feasibility of multi-agent pathfinding problems on trees. Our work takes this further to actually provide a constructive proof of how to solve multi-agent pathfinding problems in a tree and culminates in a novel approach that called tree-based agent swapping strategy (TASS). I also provide a family of algorithms that decompose graphs to trees. Experimental results showed that TASS can find solutions to multi-agent pathfinding problems on a highly crowded tree with 1000 nodes and 996 agents in less than 3 seconds. Further experiments compared TASS with other modern contending algorithms and the results were very favorable.
Language
English
DOI
doi:10.7939/R3M340
Rights
License granted by Mokhtar Khorshid (mokhtar@ualberta.ca) on 2011-09-30T17:00:00Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
2014-04-28T20:46:50.274+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 1214424
Last modified: 2015:10:12 10:22:51-06:00
Filename: Khorshid_Mokhtar_Fall 2011.pdf
Original checksum: 101a4e61948acab34723805eac5b05bd
Well formed: true
Valid: true
File title: Frontmatter
File title: Solving Multi-Agent Pathfinding Problems in Polynomial Time Using Tree Decompositions
File author: Mokhtar Mohamed Khorshid
Page count: 75
Activity of users you follow
User Activity Date