ROS2 Multi-Robot Task Allocator (Greedy)

Medium Multi-Robot 0% pass rate

Practice the ROS2 Multi-Robot Task Allocator (Greedy) coding problem in Multi-Robot. Browser-based execution with automated grading — no local ROS install required. 0% of engineers pass this challenge.

Problem Statement

Assign tasks to the nearest available robot. A basic fleet management algorithm.

Requirements

  • Node dispatcher
  • Subscribe: /robot_poses (Array of poses) and /pending_tasks (Array of locations)
  • Logic: For the next task, find the robot with minimum Euclidean distance.
  • Publish: /assignments (RobotID, TaskID)

Input/Output Format

Output:

  • Assignment messages.

⚠️ Common Pitfalls

  • Race conditions: Assigning the same robot to two tasks.

📚 Helpful Resources

Frequently asked questions

What is the ROS2 Multi-Robot Task Allocator (Greedy) practice problem?

It is a hands-on Multi-Robot challenge on SimuCode where you implement and run ROS2 code in the browser with runtime-verified tests.

How do I practice ROS2 Multi-Robot Task Allocator (Greedy) online?

Open this page, sign in, and solve the problem in the built-in IDE. Your solution is graded against real ROS2 execution checks.

What skills does ROS2 Multi-Robot Task Allocator (Greedy) test?

This Medium problem focuses on Multi-Robot skills used in robotics interviews and production systems.