Scribd
Upload
8 views4 pages

Ai Lab 10

Uploaded by

Nitya Kushwah
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
8 views4 pages

Ai Lab 10

Uploaded by

Nitya Kushwah
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/ 4

Experiment- 10

Aim: To implement the two point path robot.


The robotic path planning problem is a classic. A robot, with certain dimensions, is attempting to
navigate between point A and point B while avoiding the set of all obstacles, Cobs.A two-point path
robot, also known as a two-point motion robot, is a type of robot that can move between two specific
points in a given environment. This type of robot is typically used in applications where precise
movement between two fixed locations is required.These robots are commonly used in scenarios where
tasks involve moving objects or tools between two fixed positions, such as pick-and-place operations in
manufacturing or assembly lines. They are often simpler in design and control compared to robots with
more sophisticated mobility and functionality.

Fig 12.1

Algorithm:

Step-1 Define a grid representing the environment with obstacles. 0 represents a passable cell, and
1 represents an obstacle and define directions (up, down, left, right) for movement.

Step-2 Create two separate queues for the start and end searches, respectively and create two sets
for tracking visited nodes in the start and end searches.

Step-3 Now add the start node to and the end node .While both queue_start and queue_end have
nodes.Pop a node from both queue_start and queue_end If current_start is equal to current_end, or
current_start is in visited_end .

Return True

Step-4 For each direction in directions, check neighboring nodes Ensure the neighboring node is within the
grid boundaries.Ensure the neighboring node is not an obstacle.
Step-5 If conditions are met, add the neighboring node to the appropriate queue .

Step-6 If the loop completes without finding a meeting point, return False.

Code:
Output:

You might also like