TARTRL/RankingCost
The Ranking Cost algorithm for multi-path routing of gridworld.(多智能体路径规划，电路规划)
This helps operations engineers, circuit designers, or logistics planners efficiently find the best paths for multiple agents or components within a defined grid or layout. You input a map or grid showing possible routes and obstacles, and it outputs an image of the optimized paths along with visual cost maps. It's designed for anyone who needs to route multiple paths while minimizing total travel or interference.
No commits in the last 6 months.
Use this if you need to plan simultaneous, non-overlapping paths for multiple elements or agents in a confined, gridded space, such as designing circuit layouts or optimizing robot movements in a warehouse.
Not ideal if your routing problem involves continuous spaces, dynamic environments with unpredictable obstacles, or requires real-time path adjustments.
Stars
19
Forks
7
Language
Python
License
MIT
Category
Last pushed
Dec 20, 2021
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/agents/TARTRL/RankingCost"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
Toni-SM/skrl
Modular Reinforcement Learning (RL) library (implemented in PyTorch, JAX, and NVIDIA Warp) with...
facebookresearch/BenchMARL
BenchMARL is a library for benchmarking Multi-Agent Reinforcement Learning (MARL). BenchMARL...
utiasDSL/gym-pybullet-drones
PyBullet Gymnasium environments for single and multi-agent reinforcement learning of quadcopter control
datamllab/rlcard
Reinforcement Learning / AI Bots in Card (Poker) Games - Blackjack, Leduc, Texas, DouDizhu, Mahjong, UNO.
proroklab/VectorizedMultiAgentSimulator
VMAS is a vectorized differentiable simulator designed for efficient Multi-Agent Reinforcement...