Research
Research
The RoboBees project at Harvard Microrobotics Laboratory seeks to develop small, flying robots inspired
by the flight capabilities of bees and other insects. These tiny robots, known as “RoboBees,” are
designed to mimic the wing-flapping mechanisms and aerodynamics of insects, enabling them to hover,
fly, and perch on surfaces. RoboBees have the potential for applications in swarm exploration and
mapping of distant planets or for monitoring environmental conditions in space.
MICROMOUSE:
Micromouse is a robotics competition that involves building completely autonomous robots capable of
navigating through a maze. The goal of the competition is for the robot to find the shortest path from a
designated starting point to the center of the maze as quickly as possible.The robot may use wheels or
tracks for movement and is equipped with sensors, such as infrared or ultrasonic sensors, to detect walls
and obstacles.Teams typically pre-program the robot or use algorithms that allow the robot to make real-
time decisions based on sensor inputs.
The success of a micromouse largely depends on the efficiency of the algorithm used for maze
exploration and pathfinding. Various algorithms, such as flood-fill, A*, Dijkstra's, or other heuristic
approaches, can be employed to optimize the robot’s path and minimize the time taken to reach the
center.
FLOOD-FILL ALGORITHM:
The flood-fill algorithm is a simple technique used to explore and identify connected regions in a grid or
a 2D array. The algorithm starts at a specific point (usually the starting position) and recursively visits
neighboring cells, marking them as visited. It continues until all reachable cells are explored, creating a
filled region or finding the target location.
A* ALGORITHM:
It guarantees the shortest path by using a heuristic to estimate the cost from the current position to the
goal.
Working:
The algorithm maintains two lists: an open list and a closed list. The open list contains the nodes to be
evaluated, and the closed list contains nodes that have already been evaluated. A* uses a combination of
the actual cost to reach a node (the path cost from the starting point) and a heuristic function (the
estimated cost from that node to the goal) to prioritize which nodes to evaluate next. The heuristic
function is usually an admissible and consistent heuristic to ensure optimal results
DIJKSTRA’S ALGORITHM:-
Dijkstra’s algorithm maintains a list of unexplored nodes and their tentative distances from the starting
node. It iteratively selects the node with the smallest tentative distance, explores its neighbors, and
updates their tentative distances if a shorter path is found. This process continues until the target node is
reached, and the shortest path is determined.
Most efficient:- A*
The same concept can be further incorporated into SPACE ROBOTICS for
Autonomous navigation and path planning.
SLAM (Simultaneous Localization and Mapping): SLAM algorithms, often powered
by ML techniques, allow robots to build maps of their surroundings while simultaneously localizing
themselves within those maps. SLAM is crucial for space robots to explore unknown environments and
create detailed maps for future missions.There are several types of SLAM algorithms, but two main
categories are EKF-based (Extended Kalman Filter) SLAM and Graph-based SLAM.
1.EKF-based SLAM:
Extended Kalman Filter-based SLAM is one of the earliest and most widely used SLAM methods. It
applies the principles of the Kalman Filter, a recursive mathematical algorithm that estimates the state of
a system based on noisy sensor measurements. In EKF-based SLAM, the robot’s position and map
features (such as landmarks or key points) are represented as probability distributions.
1.Prediction: The robot’s motion model predicts its future position based on control inputs (e.g., wheel
encoder readings).
2.Update: When the robot observes new landmarks or features through sensors like cameras or LIDAR, it
updates its position estimate and the map using the sensor data.
EKF-based SLAM works well in small environments with few landmarks, but it may face challenges in
larger or more complex environments due to linearization errors and the need to maintain accurate
covariance estimates
Graph-based SLAM: Graph-based SLAM represents the environment as a graph, where nodes correspond
to robot poses (positions) and landmarks, and edges represent the constraints or measurements
between these nodes. The goal is to optimize the graph to find the most likely positions of the robot and
landmarks that best explain the observed data.
• Online SLAM: The graph is optimized as new sensor measurements arrive, and the robot’s position and
map are updated in real-time.
• Offline SLAM: All sensor data is collected, and the graph optimization is performed after the fact to
generate a consistent and globally optimal map and robot trajectory.
Graph-based SLAM algorithms, such as Least Squares SLAM (LS-SLAM) and Pose Graph Optimization, are
capable of handling larger and more complex environments. They generally provide more accurate
results and are less prone to issues like linearization errors compared to EKF-based SLAM.