Scribd
Upload
5 views1 page

Problem Defination

Uploaded by

stealthstartupcollab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views1 page

Problem Defination

Uploaded by

stealthstartupcollab
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Problem 1:

Multi-Agent Pathfinding (MAPF)

Problem Setup

You are tasked with finding optimal paths for multiple robots in a grid while considering obstacles
and potential conflicts among robots. The goal is to compute paths for all robots such that:

 They reach their respective goal positions in minimal time.

 They minimize their total path distance.

 Conflicts between robots are avoided.

Grid Definition

The grid is defined as an MxN matrix where:

 0: Represents an unblocked, traversable node.

 1: Represents a blocked, non-traversable node.

 2: Represents the position of a robot.

Robot Definition

 There are P robots, each with an initial position Rk (k=1,2,...,P) and a goal position Gk.

 Robots can take one of the following actions:

o F: Move forward.

o L: Move left.

o R: Move right.

o B: Back

o S: Stay at the same position.

To find: Optimal Paths for all the robots with in minimum time and distance and without conflicts

You might also like