Self Organization

Self-organizing approaches inspired from biological systems, such as social insects,

genetic, molecular and cellular systems under morphogenesis, and human mental
development, has enjoyed great success in advanced robotic systems that need to
work in dynamic and changing environments. Compared with classical control
methods for robotic systems, the major advantages of bio-inspired self-organizing
robotic systems include robustness, self-repair and self-healing in the presence of
system failures and/or malfunctions, high adaptability to environmental changes,
and autonomous self-organization and self-reconfiguration without a centralized
control.
Particle Swarm Optimization (PSO)
Particle Swarm Optimization (PSO) is built on a simple yet powerful idea: individuals
in a group can achieve better results by learning from both their own experiences and
the successes of [Link] a flock of birds searching for food in an open field.
Each bird doesn’t know where the food is, but it can sense how far it is from others
and how successful each bird seems to be. As the search continues, birds gradually
adjust their direction — moving toward spots where they or their neighbours have
found more food. Over time, the flock converges near the best feeding area.
PSO translates this natural behaviour into a mathematical model. Here, each “bird” is
a particle, representing a possible solution to the optimization problem.
The position of a particle encodes the solution itself, while its velocity determines
how it moves through the search space. Each particle remembers the best position it
has found so far (its personal best, or pBest) and is also influenced by the best
position found by any particle in the swarm (the global best, or gBest).
Each particle in the swarm represents a candidate solution and moves through the
search space, updating its position based on a combination of individual experience
and social influence.
1. Particle Representation
Every particle has:
● A position which represents a potential solution to the problem.
● A velocity, which determines how the position changes in the next step.
● A fitness value, which measures how good that solution is according to an
objective function.
2. Memory and Influence
Each particle keeps track of:
● Personal best (pBest): The best position the particle itself has found so far.
● Global best (gBest): The best position discovered by any particle in the entire
swarm.
At each iteration, a particle adjusts its velocity based on three key factors:
 1. Inertia: The tendency to keep moving in the same direction as before.
2. Cognitive component: The pull toward the particle’s personal best position
(self-learning).
3. Social component: The pull toward the global best position (social learning).

PSO Algorithm

Step 1: Initialization

●
Randomly initialize N particles within the search space [minx,maxx]
[minx,maxx]
● Assign a random velocity to each particle
● Evaluate the fitness value of each particle
pBest= = current position

gBest = best pBest among all particles

Step 2: Velocity Update

At each iteration the velocity of a particle is updated using:

t+1 t t t
vi = w. vi + c1 . r1. ( pBesti - xi )+ c2 . r2. ( gBest - xi )

where
● w: inertia weight (controls exploration)
● c1 : cognitive coefficient (self-learning)
● c2 : social coefficient (swarm learning)
● r1 ,r2 : random values in [0,1]

Step 3: Position Update

After updating velocity the position is updated as:
t+1 t t+1
xi = xi + v i
If the new position goes outside [minx, maxx] clip it to the boundary.

Step 4: Update Best Positions

● If current fitness is better than pBest, update pBest
● If current fitness is better than gBest, update gBest
●
Step 5: Convergence
● Repeat Steps 2–4 for a fixed number of iterations or until convergence
● The swarm gradually moves toward the optimal solution
Difference between Particle Swarm Optimization (PSO) and Genetic Algorithm (GA)

Parameter PSO Genetic Algorithm (GA)

Based on social behavior of Based on natural evolution and
Inspiration birds or fish genetics
Particles move continuously Uses randomized population
through the search space evolution
Search Strategy
Population No creation or deletion New individuals are created
Update particles only change position using crossover and mutation
Selection, crossover and
Velocity and position updates mutation
Operators Used
Variable Best suited for continuous Handles both continuous and
Handling optimization discrete variables
Complexity Simple structure with faster More complex and generally
and Speed convergence slower

Ant Colony Optimization

Ant Colony Optimization (ACO) is a nature-inspired algorithm that learns from how
real ants collectively find the shortest path to food without any central control.
Instead of fixed rules, it improves solutions over time through simple behaviour and
cooperation making it effective for complex optimization problems. In nature, ants
follow a simple process like:
● They move randomly and leave a pheromone trail
● Shorter paths gather pheromones faster
● More ants follow stronger trails
● Over time, the shortest path becomes dominant

Key Components
Ant Colony Optimization is built on a few core components that work together to
guide the search toward optimal solutions.
1. Ants: Simple agents that explore the problem space and construct solutions
step by step.
2. Pheromone trails: Numerical values that store past experience and indicate
which paths are more promising.
3. Heuristic information: Problem specific knowledge such as distance, cost or
time that helps ants make informed decisions.
4. Probability based movement: Ants choose paths using probabilities
influenced by pheromones and heuristic values, rather than fixed rules.
5. Pheromone evaporation: Pheromone levels gradually decrease over time,
preventing premature convergence and encouraging continued exploration.
How it Works
Ant Colony Optimization operates through an iterative loop that progressively refines
solutions based on collective learning.
 1. Initialization: Set initial parameters and assign small pheromone values to
all paths.
2. Ant path construction: Each ant builds a solution by moving through the
problem space based on pheromones and heuristic information.
3. Solution evaluation: The quality of each solution is measured using a fitness
or cost function.
4. Pheromone update: Good solutions receive more pheromone reinforcement,
while pheromones on other paths evaporate.
5. Iteration until best path is found: The process repeats until a stopping
condition is met or the best path is discovered.
Turning Ant Behaviour into a Problem Solving Strategy
Ant Colony Optimization converts the natural behaviour of ants into a computational
problem solving framework, where simple agents collectively build high quality
solutions.
1. Ants as agents: In ACO, each ant is a simple computational agent that
constructs a solution step by step, similar to how real ants explore routes.
2. Pheromones as memory: Pheromones are numerical values assigned to
paths, representing how effective those paths were in previous solutions.
3. Nodes and paths: Nodes represent possible states or locations, while paths
represent transitions between them, similar to routes between a nest and food.
4. Decision making: Ants select paths probabilistically, considering both
pheromone strength and path quality instead of following fixed rules.
Parameters in Ant Colony Optimization
The performance and behaviour of Ant Colony Optimization depend on a few key
parameters that balance exploration and exploitation.
1. Number of ants: Determines how many solutions are explored in each
iteration. More ants improve exploration but increase computation.
2. Pheromone importance: Controls how strongly ants follow previously
successful paths. Higher importance means more exploitation of known good
solutions.
3. Heuristic importance: Defines how much ants rely on problem specific
information such as distance or cost while choosing paths.
4. Evaporation rate: Decides how quickly pheromone values fade over time. A
higher rate encourages exploration, while a lower rate favours stability.
How Ants Discover the Shortest Path
Ant Colony Optimization is inspired by how real ants search for food and collectively
discover the shortest path without any central control. Their behaviour can be
understood through a few simple ideas:
1. Random exploration: Ants initially move in different directions, exploring
multiple possible paths.
2. Pheromone trails: When an ant finds food, it returns while leaving a chemical
trail that guides other ants.
3. Shorter paths strengthen faster: Ants on shorter routes return more quickly
and deposit pheromones more often, while longer paths fade due to
evaporation.
4. Indirect communication: Ants coordinate through pheromone signals rather
than a leader and is known as stigmergy.
Calculating the Shortest Path
1. Probability of Choosing the Next Path
An ant does not randomly choose a path. It selects the next node using probability.

Pij=
● τij: pheromone on path i to j
● ηij: how good the path looks (usually shorter distance)
● α: importance of pheromone
● β: importance of distance
2. Heuristic Value (Distance Information)
Heuristic value represents how good a path looks based on distance. For shortest
path problems:
ηij=
 ● dij: distance between nodes i and j
● Smaller distance: larger heuristic value
This formula helps ants prefer shorter paths while making decisions.
3. Pheromone Update Rule
After all ants complete their paths, pheromones are updated:
τij= (1 – ρ ) τij + ∆ τij
● Old pheromone partially evaporates
● New pheromone is added on good paths
● ρ: evaporation rate (between 0 and 1)

4. Pheromone Added by an Ant

● Each ant adds pheromone based on path quality:
∆ τij =

● Q: constant value
● L: total length of the path
● Shorter path: more pheromone added

Swarm Intelligence
Swarm intelligence describes the way that complex behaviours can arise from large
numbers of individual agents each following very simple rules. For example, ants
use the approach to find the most efficient route to the food source. Individual ants
do nothing more than follow the strongest pheromone trail left by other ants. But, by
repeated process of trial and error by many ants, the best route to the food is quickly
revealed.
Swarm Robotics
Swarm intelligence (SI) is an artificial intelligence technique based around the study
of collective behaviour in decentralized, self-organized systems. The concept of
SWARM ROBOTICS is based on this basis of grouping of multiple robots or devices
and perform the desired task. Swarm robotics is a new approach to the coordination
of multi-robot systems which consist of large numbers of mostly simple physical
robots. This approach emerged on the field of artificial swarm intelligence, as well as
the biological studies of insects, ants and other fields in nature, where swarm
behaviour occurs.
Swarm robotics is defined by several key characteristics:
1) Scalable: The control architecture of each robot is same, no matter the number of
robots.
2) Flexible: The robots may be inserted or deleted to/from the environment, no
requirement for any change in the task operation.
3) Robust: Not only due to unit redundancy but also through minimalist unit design.
4) Self-Organization: Robots in a swarm organize themselves to perform tasks
efficiently. This includes things like task allocation, formation control, and
environmental mapping.
5) Decentralization: There is no central controller or decision-maker. Each robot
operates based on local information, which leads to robustness and fault tolerance.
Swarm Robotics have varied applications in all fields like communication, military
services, civil engineering, building construction etc.
Communication and Coordination
Communication between robots is a critical aspect of swarm robotics. While some
swarm robotic systems rely on direct communication (such as wireless signals or
infrared), others use indirect forms of communication, known as stigmergy. This
form of communication occurs when robots leave markers in the environment, such
as paths or signals, which other robots can follow.
● Direct Communication: Robots exchange information using radio frequency
(RF) signals, infrared communication, or Wi-Fi. This allows robots to
coordinate their movements, share sensor data, and collaboratively solve
problems.
● Indirect Communication (Stigmergy): This form of communication allows
robots to communicate indirectly through the environment. For example,
robots may leave markers or traces to inform others of their actions, such as
placing flags or dropping materials in specific locations.
Effective coordination ensures that each robot works in harmony with others and
that the overall swarm behaviour is efficient.
Localization and Sensing
Localization is a crucial problem in swarm robotics. Each robot must be able to
determine its position relative to others and to environmental features. This is often
achieved using sensors such as cameras, LIDAR, infrared sensors, or GPS, depending
on the scale of the swarm.
● Range-Based Localization: Robots determine their position by measuring
distances to other robots or fixed landmarks. This technique is particularly
useful for indoor environments where GPS is unavailable.
● Vision-Based Localization: Robots equipped with cameras use visual data to
estimate their position and orientation. This method is commonly used in
scenarios where robots must navigate through complex environments, such
as cluttered spaces.

Task Allocation and Behavior Coordination

A fundamental challenge in swarm robotics is the allocation of tasks. Since each

robot is limited in its capabilities, the swarm must collectively divide tasks in a way
that maximizes efficiency. There are several approaches to task allocation:
● Task Partitioning: Tasks are divided among robots based on their
capabilities or proximity to a task. For example, in a search-and-rescue
mission, some robots may focus on exploration, while others perform specific
rescue tasks.
● Role Assignment: Robots are assigned specific roles based on their position
in the swarm, such as leader, follower, or task-specific roles. This hierarchical
structure may emerge naturally or be explicitly designed.
● Behavioral Coordination: Swarm robots must be programmed to follow
certain behavior rules. For instance, robots may exhibit behaviors such as
flocking, foraging, or herding. Coordination protocols ensure that these
behaviors interact in a complementary way, leading to the accomplishment of
larger tasks.

TYPES OF SWARM
1. Modular Robots
A module is essentially a small, relatively simple robot or piece of a robot. Modular
robots are made of lots of these small, identical modules. A modular robot can
consist of a few modules or many, depending on the robot’s design and the task it
needs to perform. Some modular robots currently exist only as computer
simulations; others are still in the early stages of development.
2. Chain robots
Chain robots are long chains that can connect to one another at specific points.
Depending on the number of chains and where they connect, these robots can
resemble snakes or spiders. They can also become rolling loops or bipedal, walking
robots. A set of modular chains could navigate an obstacle course by crawling
through a tunnel as a snake, crossing rocky terrain as a spider and riding a tricycle
across a bridge as a biped. Examples of chain robots are Palo Alto Research Center’s
(PARC) Polybot and Polypod and NASA’s snakebot.