Back to search

Cal Poly

Decentralized, Noncooperative Multirobot Path Planning with Sample-BasedPlanners

Abstract

dc:description.abstract

In this thesis, the viability of decentralized, noncooperative multi-robot path planning algorithms is tested. Three algorithms based on the Batch Informed Trees (BIT*) algorithm are presented. The first of these algorithms combines Optimal Reciprocal Collision Avoidance (ORCA) with BIT*. The second of these algorithms uses BIT* to create a path which the robots then follow using an artificial potential field (APF) method. The final algorithm is a version of BIT* that supports replanning. While none of these algorithms take advantage of sharing information between the robots, the algorithms are able to guide the robots to their desired goals, with the algorithm that combines ORCA and BIT* having the robots successfully navigate to their goals over 93% for multiple environments with teams of two to eight robots.

Degree

thesis:*
Name thesis:degree_name
MS in Electrical Engineering
Discipline thesis:degree_discipline
Electrical Engineering

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Le, William
Contributors dc:contributor
  • Xiao-Hua (Helen) Yu
  • Electrical Engineering
  • College of Engineering

Subjects

dc:subject × 4

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Cal Poly
Base URL
digitalcommons.calpoly.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Le, William. Decentralized, Noncooperative Multirobot Path Planning with Sample-BasedPlanners. https://digitalcommons.calpoly.edu/theses/2557