Skip to main content

Featured post

A* ALGORITHM BASICS FOR PATH FINDING & HEURISTICS METHODS : ARTIFICIAL INTELLIGENCE

 A* ALGORITHM BASICS FOR PATH FINDING A* , widely used  known form of best-first search & path planning algorithm nowadays in mobile robots,games. this is the function for A*,                                     f(n) = g(n) + h(n) g ( n ) is the cost of the path from the start node to n , and h ( n ) is a heuristic function that estimates the cost of the cheapest path from n to the goal This will find cheapest f(n) value in neighbor nodes to archive goal node. check below image  A to B path finding with g(n),h(n),f(n) value In the final level check below image Now we will check the Algorithm // A* Search Algorithm 1. Initialize the open list 2. Initialize the closed list put the starting node on the open list (you can leave its f at zero) 3. while the open list is not empty a) find the node with the least f on the open list, call it "q" b) pop q off the open list c) generate q's 8 successors

INTRODUCTION TO SWARM ROBOTICS


Happy to write about swarm robots in my blog, keep on checking my blog guys more interesting stuffs are waiting for you , This is a turning point for robotics lovers & my first post about swarm robots
A short & quick Introduction about Swarm Robotics have a look

Swarm robotics is defined as,
"the study of how a large number of relatively simple physically embodied agents can be designed such that a desired collective behavior emerges from the local interactions among agents and between the agents and the environment"

Have a look below video to get an quick understanding about swarm robots,its from Big Hero 6  movie

 what are the special things in Swarm Robotics
  • scalable
  • system’s efficiency will not affect 
  • addition or removal of robots do not change the functioning or efficiency of a swarm robotic system
  • purely based on local sensing the system is adaptable and flexible
  • applicable to dynamic problem scenarios
  • single robot faults won’t affect the total system’s performance
  • decentralized manner purely based on local sensing
  • very low level computational power
  • most of the swarm robots adopt bio-inspired animal behavior 
  • local interaction with other robots
  • group task completing concept
  • very low level localization capability 
 what are the applications of Swarm Robotics
  • Search and Rescue : robots are used in search and rescue operations especially in disaster management
  • Area Mapping : Terrain Mapping refers to building a map of the unknown terrain using robots
  • Waste Management : some collecting mechanism are being used for removing wastes on the water bodies
let see what are interesting research area in Swarm Robotics
  • Cooperative Object Transportation : One of the scintillating skills of natural swarm system is its capability of transporting objects/prey to its nest, especially the ant colonies
  • Cooperative/single Forging : scalable, flexible, and efficient algorithm for robot swarms to collect objects in un-mapped environments
so next we will see what are the Collective behaviors in Swarm Robotics

  • Aggregation:Aggregation refers to the grouping of all robots at a common point



  • Collective Navigation and Exploration:Collective navigation refers to, a robot reaching a destination by moving through an unknown environment with the help of other robots



  • Flocking : In nature, different species of animals show this behavior. A flock of birds, fish schools, the formation of herds in ungulates etc. are some examples of natural flocks. Flocking of swarm robots, inspired by these natural scenarios, is the coordinated movement of robots towards a common goal or simple coordinated movement


major general methodologies for  Cooperative Object Transportation
  • Gripping
  • Caging
  • Pushing
 check below videos

Comments

Popular posts from this blog

Getting Started with ARGoS Large-Scale Swarm Robot Simulator in Ubuntu

ARGoS (Autonomous Robots Go Swarming) is a multi-robot simulator designed to support large teams of robots. Its design is pretty different from the design of other simulators. Its most distinctive feature is that the 3D simulated world can be divided in regions, and each region can be assigned to a different physics engine. Furthermore, ARGoS' design revolves around the concept of tunable accuracy. In other words, in ARGoS, everything is a plug-in (robot models, sensors, actuators, physics engines, visualisations, etc) and the user can select which plug-ins to use for an experiment.  Since different plug-ins have different accuracy and computational costs, users can choose which plug-ins to use for each aspect of the simulation and assign resources only where it matters. This makes the simulation as fast as possible. At the time of writing, ARGoS supports the Swarmanoid robots (foot-bot and eye-bot) and the e-puck. ARGoS supports Linux and Mac OSX. Binary packages are availa

A* ALGORITHM BASICS FOR PATH FINDING & HEURISTICS METHODS : ARTIFICIAL INTELLIGENCE

 A* ALGORITHM BASICS FOR PATH FINDING A* , widely used  known form of best-first search & path planning algorithm nowadays in mobile robots,games. this is the function for A*,                                     f(n) = g(n) + h(n) g ( n ) is the cost of the path from the start node to n , and h ( n ) is a heuristic function that estimates the cost of the cheapest path from n to the goal This will find cheapest f(n) value in neighbor nodes to archive goal node. check below image  A to B path finding with g(n),h(n),f(n) value In the final level check below image Now we will check the Algorithm // A* Search Algorithm 1. Initialize the open list 2. Initialize the closed list put the starting node on the open list (you can leave its f at zero) 3. while the open list is not empty a) find the node with the least f on the open list, call it "q" b) pop q off the open list c) generate q's 8 successors

Ros Topics : Ros Tutorial

Topics , Its look like pipe line connection between two or more nodes,This is the way to transfer data continuously within two nodes.    Each message in ROS is transported using named buses called topics. When a node sends a message through a topic, then we can say the node is publishing a topic. When a node receives a message through a topic, then we can say that the node is subscribing to a topic. The publishing node and subscribing node are not aware of each other's existence. We can even subscribe a topic that might not have any publisher. In short, the production of information and consumption of it are decoupled. Each topic has a unique name, and any node can access this topic and send data through it as long as  they have the right message type Ros topic have two types of method   1. topic publisher   2. topic subscriber  ROS has a tool to work with topics called rostopic . It is a command-line tool that gives us information about the topic or publishes

Translate