Fast Collision Checking: From Single Robots to Multi-Robot Teams
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Anticipatory Navigation in Crowds by Probabilistic Prediction of Pedestrian Future Movements
Critical for the coexistence of humans and robots in dynamic environments is the capability for agents to understand each other's actions, and anticipate their movements. This paper presents Stochastic Process Anticipato…
NavigateA Configuration-Space Decomposition Scheme for Learning-based Collision Checking
Motion planning for robots of high degrees-of-freedom (DOFs) is an important problem in robotics with sampling-based methods in configuration space C as one popular solution. Recently, machine learning methods have been …
BIG-bench Machine LearningMotion PlanningPlant PhenotypingImproving Machine Learning-Based Robot Self-Collision Checking with Input Positional Encoding
This manuscript investigates the integration of positional encoding -- a technique widely used in computer graphics -- into the input vector of a binary classification model for self-collision detection. The results demo…
Binary ClassificationEfficient Multi-Robot Motion Planning with Precomputed Translation-Invariant Edge Bundles
Solving multi-robot motion planning (MRMP) requires generating collision-free kinodynamically feasible trajectories for multiple interacting robots. We introduce Kinodynamic Translation-Invariant Edge Bundles or KiTE-Ext…
Motion PlanningMulti-robot Path Planning in Well-formed Infrastructures: Prioritized Planning vs. Prioritized Wait Adjustment (Preliminary Results)
We study the problem of planning collision-free paths for a group of homogeneous robots. We propose a novel approach for turning the paths that were planned egocentrically by the robots, e.g. without taking other robots'…