Back to search

University of Denver

Multi-Agent Pathfinding in Mixed Discrete-Continuous Time and Space

Abstract

dc:description.abstract

In the multi-agent pathfinding (MAPF) problem, agents must move from their current locations to their individual destinations while avoiding collisions. Ideally, agents move to their destinations as quickly and efficiently as possible. MAPF has many real-world applications such as navigation, warehouse automation, package delivery and games. Coordination of agents is necessary in order to avoid conflicts, however, it can be very computationally expensive to find mutually conflict-free paths for multiple agents – especially as the number of agents is increased. Existing state-ofthe- art algorithms have been focused on simplified problems on grids where agents have no shape or volume, and each action executed by the agents have the same duration, resulting in simplified collision detection and synchronous, timed execution. In the real world agents have a shape, and usually execute actions with variable duration. This thesis re-formulates the MAPF problem definition for continuous actions, designates specific techniques for continuous-time collision detection, re-formulates two popular algorithms for continuous actions and formulates a new algorithm called Conflict-Based Increasing Cost Search (CBICS) for continuous actions.

Degree

thesis:*
Name thesis:degree_name
Ph.D.
Level thesis:degree_level
Dissertation

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Walker, Thayne T.
Contributors dc:contributor
  • Nathan R. Sturtevant
  • Scott T. Leutenegger
  • Matthew J. Rutherford

Subjects

dc:subject × 8

Rights

dc:rights
Statement dc:rights
  • <p>Copyright is held by the author. User is responsible for all copyright compliance.</p>
  • Thayne T. Walker
Language dc:language
en

Identifiers

dc:identifier.*
Repository record dc:identifier
https://digitalcommons.du.edu/etd/2086

Chain of custody

source
Harvested from
University of Denver
Base URL
digitalcommons.du.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Walker, Thayne T.. Multi-Agent Pathfinding in Mixed Discrete-Continuous Time and Space. Dissertation thesis, https://digitalcommons.du.edu/etd/2086