There are 1 repository under collision-checking topic.
Points, Lines, Boxes, Polygons (also hollow), Ellipses, Circles. RayCasting, offsets, rotation, scaling, bounding box padding, flags for static and ghost/trigger bodies
Motion Planner for Self Driving Cars
List of commonly used robotics libraries and packages
The official repo for NeurIPS 2021 paper 'Reducing Collision Checking for Sampling-Based Motion Planning Using Graph Neural Networks'
My solution for udacity path planning project. This makes the car drive > 20 miles without collision without constraint violation
RRT (Rapidly-Exploring Random Trees) using Dubins curve, with collision check in MATLAB
Code for our paper "Autonomous Navigation in Unknown Environments with Sparse Bayesian Kernel-based Occupancy Mapping".
This is a structure allowing you to find suitable collision-candidates out of a bulk of sprites or similar very fast.
Code of the ITSC2023 paper: "Efficient Path Planning in Large Unknown Environments with Switchable System Models for Automated Vehicles". Author: Oliver Schumann
Polar Collision Grids: Effective Interaction Modelling for Pedestrian Trajectory Prediction in Shared Space Using Collision Checks (ITSC 2023)
Uncertainty-Aware DRL for Autonomous Vehicle Crowd Navigation in Shared Space (IEEE-IV-2024) - Pedestrian Trajectory Prediction Part
Code for our ICRA paper "Autonomous Navigation in Unknown Environments with Sparse Kernel-based Occupancy Mapping"
Tile based collision detection and response in MonoGame. Handles solid tiles, ground detection, platforms and slopes.
CudaSoftCollisions is a library that allow you to detect self collisions in a tetrahedrical mesh that is deformed over time.
This package checks for collisions while offline with its own model. This is useful especially while checking collisions for situations where collision links are disabled for experiments (allowing moveit to collide links in the simulation, e.g. while testing DawnIK Solver).
A simple c++ header-only single file that uses the Separating Axis Theorem (SAT) to detect collisions between two Oriented Bounding Boxes (OBB) and generate contact points for vertex-face collisions and edge-edge collisions.
This repository shows how to build a quad tree in a squared map. This data structure can be used to check for collisions super efficiently. Used mainly in games.
A data structure for efficient collision detection in a 2D space
A collision detection algorithm using smart space division to improve detection speed.
A browser based game inspired by the 1980 Atari arcade classic.
Wrapper for Stephen Cameron's Enhanced GJK code
Canvas animation basics