ARIA Systems Group
- 11 followers
- Smead Aerospace Engineering Sciences at the University of Colorado Boulder
- http://www.AriaSystems.group
Popular repositories
-
Chance-Constrained-K-CBS
Chance-Constrained-K-CBS PublicKinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for agent with complex, possibly unique, kinodynamic constraints.
-
Multi-Robot-OMPL
Multi-Robot-OMPL PublicForked from ompl/ompl
Our implementation of Kinodynamic Conflict Based Search (K-CBS) inside the The Open Motion Planning Library (OMPL)
-
NeuralNetControlBarrier
NeuralNetControlBarrier PublicWe introduce a method of safety certification and control for Neural Network Dynamic Models (NNDMs) via stochastic barrier functions.
-
K-CBS-Demos
K-CBS-Demos PublicDemonstrations of our Kinodynamic Conflict-Based Search algorithm that are too involved to be included in OMPL.
-
Explanation-Guided-CBS
Explanation-Guided-CBS PublicOur implementation of Explanation-Guided CBS (XG-CBS) inside C++.
Repositories
- regret_synthesis_toolbox Public
Source code for Regret synthesis for two-player turn-based game played on graphs - ICRA 22
-
- MAPF-PC Public Forked from HanZhang39/MAPF-PC
Forked version of the original MAPF-PC repository to be used for Efficient LTL + MAPF Planning.
- Delay-Robust-MAPF Public
- K-CBS-Demos Public
Demonstrations of our Kinodynamic Conflict-Based Search algorithm that are too involved to be included in OMPL.
- Congestion-MAPF Public Forked from Jiaoyang-Li/MAPF-LNS2
Congestion MAPF is a new project of ours where instead of minimizing common cost metrics such as SOC, or makespan, we want to minimize the "congestion" of the plan.
- Chance-Constrained-K-CBS Public
Kinodynamic-CBS (K-CBS) is a decentralized motion planning algorithm capable of solving complex multi-agent motion planning queries for agent with complex, possibly unique, kinodynamic constraints.
