Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters

Matouš Kulhan, Pavel Surynek
7/5/2022
cs.AIcs.RO

No confident code implementation found for this paper. 2 possible matches can be shown below.

Abstract

We study the planning and acting phase for the problem of multi-agent path finding (MAPF) in this paper. MAPF is a problem of navigating agents from their start positions to specified individual goal positions so that agents do not collide with each other. Specifically we focus on executing MAPF plans with a group of Crazyflies, small indoor quadcopters . We show how to modify the existing continuous time conflict-based search algorithm (CCBS) to produce plans that are suitable for execution with the quadcopters. The acting phase uses the the Loco positioning system to check if the plan is executed correctly. Our finding is that the CCBS algorithm allows for extensions that can produce safe plans for quadcopters, namely cylindrical protection zone around each quadcopter can be introduced at the planning level.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 2 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{kulhan2022plan,
  title  = {Plan Execution for Multi-Agent Path Finding with Indoor Quadcopters},
  author = {Matouš Kulhan and Pavel Surynek},
  year   = {2022},
  eprint = {2207.01752},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2207.01752v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2207.01752.svg)](https://codeofpaper.com/paper/2207.01752)

Discussion