albaintelligence Goto Github PK

a2j

Code for paper "A2J: Anchor-to-Joint Regression Network for 3D Articulated Pose Estimation from a Single Depth Image". ICCV2019

aa-sipp-m

Algorithm for prioritized multi-agent path finding (MAPF) in grid-worlds. Moves into arbitrary directions are allowed (each agent is allowed to follow any-angle path on the grid). Timeline is continuous, i.e. action durations are not explicitly discretized into timesteps. Different agents' size and moving speed are supported. Planning is carried out in (x, y, \theta) configuration space, i.e. agents' orientation are taken into account.

awr-adaptive-weighting-regression

Code for paper <AWR: Adaptive Weighting Regression for 3D Hand Pose Estimation>. Accepted by AAAI 2020.

boox

Multi-agent path finding (MAPF), Token Swapping (TSWAP) and related solvers. Among others SMT-based solvers, variants of CBS, and SAT-based solvers are implemented. Recently also continuous variants of MAPF (MAPF^R) are supported.

cbs--prioritizedplanning--mp

cbs-sipp

C++ implementation of CBS with using SIPP as a low-level planner

cbsh2

Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search

cbsh2-rtc

An optimal MAPF sovler: CBS+prioritizing conflicts+bypassing+high-level heuritstics+symmetry reasoning

cl-cbs

An Efficient Multi-Agent Path Finding Solver for Car-Like Robots

continuous-cbs

Continuous CBS - a modification of conflict based search algorithm, that allows to perform actions (move, wait) of arbitrary duration. Timeline is not discretized, i.e. is continuous.

crh_star

A framework offering a scalable, and deadlock-free implementation of prioritised planning with novel customisation options designed to improve performance.

deckgl

An R Interface to deck.gl

digital-real-estate-index

dirt-simple-postgis-http-api

Dirt Simple PostGIS HTTP API

distributedrl_mapf

Distributed RL/IL code for Multi-Agent Path Finding (MAPF)

dstar-lite-pathplanner

Implementation of the D* lite algorithm in Python for "Improved Fast Replanning for Robot Navigation in Unknown Terrain"

eecbs

A bounded-suboptimal solver for Multi-Agent Path Finding

flatland

Solution of NeurIPS 2020 Flatland Challenge from the team An_old_driver.

flatland-challenge

Multi-agent reinforcement learning on trains, for Deep Learning class at UNIBO

genie-awesome

🎉 A list of awesome things related to Julia's Genie Framework

genie.jl

The highly productive Julia web framework

genie_guides_books

hog2

Pathfinding and search testbed/visualization suite. Current code is in PDB-refactor branch.

idcbs

Disjoint CBSH and IDCBS integrated with LPA* and other incremental techniques

lian

Heuristic search algorithm for generating smooth paths for single-shot grid-based 2D path finding.

libmultirobotplanning

Library with search algorithms for task and path planning for multi robot/agent systems

lplian

Lifelong Planning version of LIAN algorithm

mapf

A MAPF framework in C#, with implementations for MA-CBS, ICBS, CBSH, ID, A*, A*+OD, and EPEA*

mapf-ir

Iterative Refinement for Real-Time Multi-Robot Path Planning (IROS-21)

mapf-lns

Anytime Multi-Agent Path Finding via Large-Neighborhood Search