Fast Collision Checking: From Single Robots to Multi-Robot Teams

05/10/2013
by   Joshua Bialkowski, et al.
0

We examine three different algorithms that enable the collision certificate method from [Bialkowski, et al.] to handle the case of a centralized multi-robot team. By taking advantage of symmetries in the configuration space of multi-robot teams, our methods can significantly reduce the number of collision checks vs. both [Bialkowski, et al.] and standard collision checking implementations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/14/2023

Collision Detection for Multi-Robot Motion Planning with Efficient Quad-Tree Update and Skipping

This paper presents a novel and efficient collision checking approach ca...
research
06/20/2020

A Distributed Multi-Robot Coordination Algorithm for Navigation in Tight Environments

This work presents a distributed method for multi-robot coordination bas...
research
01/22/2019

Improved Discrete RRT for Coordinated Multi-robot Planning

This paper addresses the problem of coordination of a fleet of mobile ro...
research
04/01/2023

Applications of No-Collision Transportation Maps in Manifold Learning

In this work, we investigate applications of no-collision transportation...
research
02/05/2020

Autonomous Navigation in Unknown Environments using Sparse Kernel-based Occupancy Mapping

This paper focuses on real-time occupancy mapping and collision checking...
research
10/12/2022

Quantifying hierarchy in scientific teams

This paper provides a detailed description of the data collection and ma...
research
10/20/2019

i-RIM applied to the fastMRI challenge

We, team AImsterdam, summarize our submission to the fastMRI challenge (...

Please sign up or login with your details

Forgot password? Click here to reset